Parameterized complexity of three edge contraction problems with degree constraints, Acta Informatica, vol.51, issue.7, pp.473-497, 2014. ,
An O(c?k n) 5-approximation algorithm for treewidth, FOCS 2013, pp.499-508, 2013. ,
(meta) kernelization, FOCS 2009, pp.629-638, 2009. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01483628
, , 2009.
The spanning subgraphs of Eulerian graphs, Journal of Graph Theory, vol.1, issue.1, pp.79-84, 1977. ,
NP-completeness results for edge modification problems, Discrete Applied Mathematics, vol.154, issue.13, pp.1824-1844, 2006. ,
Fixed-parameter tractability of graph modification problems for hereditary properties, Inf. Process. Lett, vol.58, issue.4, pp.171-176, 1996. ,
Parameterized complexity of even/odd subgraph problems, Journal of Discrete Algorithms, vol.9, issue.3, pp.231-240, 2011. ,
Parameterized complexity of Eulerian deletion problems, Algorithmica, vol.68, issue.1, pp.41-61, 2014. ,
Editing to Eulerian graphs, FSTTCS 2014. LIPIcs, vol.29, pp.97-108, 2014. ,
Editing to a planar graph of given degrees, CSR 2015. Lecture Notes in Computer Science, vol.9139, pp.143-156, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01225602
Fundamentals of Parameterized Complexity, Texts in Computer Science, 2013. ,
, Parameterized complexity theory. Texts in Theoretical Computer Science, 2006.
Linear kernels for (connected) dominating set on H -minor-free graphs, SODA 2012, pp.82-93, 2012. ,
Win-win kernelization for degree sequence completion problems, SWAT 2014, vol.8503, pp.194-205, 2014. ,
The planar hamiltonian circuit problem is NP-complete, SIAM J. Comput, vol.5, issue.4, pp.704-714, 1976. ,
Explicit linear kernels via dynamic programming, STACS 2014. LIPIcs, vol.25, pp.312-324, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01084007
A linear kernel for planar red-blue dominating set, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00846771
Editing to a connected graph of given degrees, MFCS 2014, Part II, vol.8635, pp.324-335, 2014. ,
Editing to a graph of given degrees, Theor. Comput. Sci, vol.591, pp.72-84, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01225602
Efficient planarity testing, J. ACM, vol.21, issue.4, pp.549-568, 1974. ,
Parameterized complexity of finding subgraphs with hereditary properties, Theor. Comput. Sci, vol.289, issue.2, pp.997-1008, 2002. ,
Linear kernels and single-exponential algorithms via protrusion decompositions, ICALP 2013, vol.7965, pp.613-624, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00829999
, Treewidth, Computations and Approximations, vol.842, 1994.
The node-deletion problem for hereditary properties is NP-complete, J. Comput. Syst. Sci, vol.20, issue.2, pp.219-230, 1980. ,
Editing graphs to satisfy degree constraints: A parameterized approach, J. Comput. Syst. Sci, vol.78, issue.1, pp.179-191, 2012. ,
Parameterized complexity of finding regular induced subgraphs, J. Discrete Algorithms, vol.7, issue.2, pp.181-190, 2009. ,
Complexity classification of some edge modification problems, Discrete Applied Mathematics, vol.113, issue.1, pp.109-128, 2001. ,
Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications, vol.31, 2006. ,
Deciding whether a planar graph has a cubic subgraph is NPcomplete, Discrete Mathematics, vol.126, issue.1-3, pp.349-357, 1994. ,
Node-and edge-deletion NP-complete problems, STOC 1978, pp.253-264, 1978. ,