Faster Parameterized Algorithms for Minor Containment, SWAT 2010, vol.6139, pp.322-333, 2010. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00736522
, Fast Minor Testing in Planar Graphs, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00904515
Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, vol.33, pp.461-493, 2002. ,
Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, pp.153-180, 1994. ,
Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893, 2005. ,
, Encyclopedia of Algorithms, 2008.
, Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.590-601, 2005.
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring, Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.637-646, 2005. ,
, Graph Theory, vol.173, 2005.
The Feasibility and Use of a Minor Containment Algorithm, Computer Science Technical Reports, vol.171, 2000. ,
Planar Subgraph Isomorphism Revisited, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp.263-274, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00455215
Subexponential parameterized algorithms, Computer Science Review, vol.2, issue.1, pp.29-39, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00455210
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Algorithmica, 2009. ,
, Parameterized Complexity, 1999.
On search, decision and the efficiency of polynomial-time algorithms, J. Comp. Syst. Sc, vol.49, pp.769-779, 1994. ,
Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979. ,
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n 1+? ) time ,
, ISAAC 2009, vol.5878, pp.984-993, 2009.
Improved bound on the planar branchwidth with respect to the largest grid minor size, 2009. ,
Branch decompositions and minor containment, Networks, vol.43, issue.1, pp.1-9, 2004. ,
Hadwiger's conjecture is decidable, Proc. of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp.445-454, 2009. ,
A shorter proof of the Graph Minor AlgorithmThe Unique Linkage Theorem, Proc. of the 42st Annual ACM Symposium on Theory of Computing, 2010. ,
Applications of a planar separator theorem, SIAM J. Comput, vol.9, pp.615-627, 1980. ,
Graphs on surfaces, 2001. ,
On random planar graphs, the number of planar graphs and their triangulations, J. Comb. Theory, Ser. B, vol.88, issue.1, pp.119-134, 2003. ,
Optimization and Recognition for K5-minor Free Graphs in Linear Time, Proc. of the 8th Latin American Symposium on Theoretical Informatics (LATIN), pp.206-215, 2008. ,
Graph Minors. XIII. The Disjoint Paths Problem, J. Comb. Theory, Ser. B, vol.63, issue.1, pp.65-110, 1995. ,
Quickly excluding a planar graph, J. Comb. Theory, Ser. B, vol.62, issue.2, pp.323-348, 1994. ,
Graph Minors. XX. Wagner's Conjecture, J. Comb. Theory, Ser. B, vol.92, issue.2, pp.325-357, 2004. ,
Dynamic Programming for Graphs on Surfaces, Proc. of the 37th International Colloquium on Automata, Languages and Programming, ICALP, 2010. ,
Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994. ,
A census of planar triangulations, Canadian Journal of Mathematics, vol.14, pp.21-38, 1962. ,