Some Recent Presentations

• Linear Kernels Using Structural Parameters on Sparse Graph Classes. At the 4th Workshop on Kernelization (WORKER 2013). University of Warsaw, Poland.
• Linear Kernels on Sparse Graph Classes. At the University of Orleans, France, 2013.
• Lower Bounds on the Complexity of MSO₁ Model-Checking. At STACS 2012, Paris.
• Linear Kernels for Graphs Excluding a Topological Minor. At Schloss Dagstuhl, 2012.
• Lower Bounds on the Complexity of MSO₁ Model-Checking. At the Treewidth and Combinatorial Optimization Workshop (TACO 2012), Maastricht University.
• Linear Kernels for Problems on Sparse Graphs. At University of Paris Dauphine, LAMSADE.
• Lower Bounds on the Complexity of MSO₁ Model-Checking. At University of Paris Dauphine, LAMSADE.
• Are There any Good Digraph Width Measures? At IPEC 2010, The Institute of Mathematical Sciences, Chennai, India.