Tight Bounds for Linkages in Planar Graphs, Proceedings of the 38th International Colloquium of Automata, Languages and Programming (ICALP), vol.6755, pp.110-121, 2011. ,
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth, 12th International Symposium on Parameterized and Exact Computation, vol.4, p.12, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01733845
, Meta) Kernelization. J. ACM, vol.63, issue.5, 2016.
FPT algorithms for plane completion problems, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, vol.26, pp.1-26, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01370324
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. Handbook of Graph Grammars, pp.313-400, 1997. ,
, Marcin Pilipczuk, Micha? Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable, Proceedings of the 54th Annual Symposium on Foundations of Computer Science (FOCS), pp.197-207, 2013. ,
Hitting Forbidden Minors: Approximation and Kernelization, SIAM Journal on Discrete Mathematics, vol.30, issue.1, pp.383-410, 2016. ,
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp.470-479, 2012. ,
Uniform kernelization complexity of hitting forbidden minors, ACM Transactions on Algorithms, vol.13, issue.3, p.35, 2017. ,
Linear kernels for edge deletion problems to immersion-closed graph classes, 2016. ,
The Parameterized Complexity of Graph Cyclability, SIAM J. Discrete Math, vol.31, issue.1, pp.511-541, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01083993
Obtaining planarity by contracting few edges, Theor. Comput. Sci, vol.476, pp.38-46, 2013. ,
Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp.479-488, 2011. ,
A Near-optimal Planarization Algorithm, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '14, pp.1802-1811, 2014. ,
Planarity Allowing Few Error Vertices in Linear Time, Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), pp.639-648, 2009. ,
The induced disjoint path problem, 13th Conference on Integer Programming and Combinatorial Optimization, vol.5035, pp.47-61, 2008. ,
Graph and map isomorphism and all polyhedral embeddings in linear time, Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), vol.28, p.17, 2008. ,
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width, Proceedings of the 49th Annual Symposium on Foundations of Computer Science (FOCS), pp.771-780, 2008. ,
Odd cycle packing, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp.695-704, 2010. ,
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions, ACM Transactions on Algorithms, vol.12, issue.2, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00829999
, Chordal Deletion is Fixed-Parameter Tractable. Algorithmica, vol.57, issue.4, pp.747-768, 2010.
Obtaining a Planar Graph by Vertex Deletion, Algorithmica, vol.62, issue.3-4, pp.807-822, 2012. ,
Graph Minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.92-114, 1986. ,
Graph Minors. XIII. The disjoint paths problem, J. Comb. Theory Ser. B, vol.63, issue.1, pp.65-110, 1995. ,