Faster parameterized algorithms for minor containment, Theoretical Computer Science, vol.412, issue.50, pp.7018-7028, 2011. ,
DOI : 10.1016/j.tcs.2011.09.015
URL : https://hal.archives-ouvertes.fr/lirmm-00736522
Fast Minor Testing in Planar Graphs, Algorithmica, vol.32, issue.2, pp.69-84, 2012. ,
DOI : 10.1007/s00453-011-9563-9
URL : https://hal.archives-ouvertes.fr/lirmm-00736769
Planar disjoint-paths completion, Parameterized and Exact Computation -6th International Symposium, IPEC 2011, pp.80-93, 2011. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01370272
A subexponential parameterized algorithm for proper interval completion, Algorithms -ESA 2014 -22th Annual European Symposium Proceedings, pp.173-184, 2014. ,
Planar graphs with bounded treewidth, 1988. ,
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Discrete Applied Mathematics, vol.64, issue.3, pp.207-217, 1996. ,
DOI : 10.1016/0166-218X(94)00125-W
Exploring subexponential parameterized complexity of completion problems, 31st International Symposium on Theoretical Aspects of Computer Science STACS 2014, pp.288-299, 2014. ,
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs, SIAM Journal on Computing, vol.28, issue.5, pp.1906-1922, 1999. ,
DOI : 10.1137/S0097539796303044
Interval Completion Is Fixed Parameter Tractable, SIAM Journal on Computing, vol.38, issue.5, pp.2007-2020, 2009. ,
DOI : 10.1137/070710913
URL : https://hal.archives-ouvertes.fr/lirmm-00115278
Congruent Graphs and the Connectivity of Graphs, American Journal of Mathematics, vol.54, issue.1, pp.150-168, 1932. ,
DOI : 10.2307/2371086
Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981. ,
DOI : 10.1137/0602010