The Theory of Partitions, 1984. ,
Efficient algorithms for combinatorial problems on graphs with bounded decomposability -a survey, BIT, vol.25, issue.1, pp.2-23, 1985. ,
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size, Proc. of APPROX-RANDOM, vol.5171, pp.276-289, 2008. ,
Dynamic programming on graphs with bounded treewidth, Proc. of the 15th International Colloquium on Automata, Languages and Programming (ICALP), vol.317, pp.105-118, 1988. ,
Surface split decompositions and subgraph isomorphism in graphs on surfaces, Proc. of STACS, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00678193
On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences, vol.67, issue.4, pp.789-807, 2003. ,
The monadic second-order logic of graphs: definable sets of finite graphs, Proc. of the 14th International Workshop on Graph-theoretic Concepts in Computer Science (WG), vol.344, pp.30-53, 1988. ,
Wojtaszczyk. Solving connectivity problems parameterized by treewidth in single exponential time, Proc. of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.150-159, 2011. ,
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. ,
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. ,
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus, Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), vol.4059, pp.172-183, 2006. ,
Subexponential parameterized algorithms, Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), vol.4596, pp.15-27, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00455210
Catalan Structures and Dynamic Programming in H-minor-free Graphs, Proc. of the 19th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.631-640, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00904498
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Algorithmica, vol.58, issue.3, pp.790-810, 2010. ,
, Parameterized Complexity, 1999.
On line arrangements in the hyperbolic plane, European Journal of Combinatorics, vol.23, issue.5, pp.549-557, 2002. ,
, Parameterized Complexity Theory, 2006.
Structure theorem and isomorphism test for graphs with excluded topological subgraphs, 2011. ,
Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001. ,
Generalized triangulations and diagonal-free subsets of stack polyominoes, Journal of Combinatorial Theory, Series A, vol.112, issue.1, pp.117-142, 2005. ,
A simpler algorithm and shorter proof for the graph minor decomposition, Proc. of the 43rd ACM Symposium on Theory of Computing (STOC), pp.451-458, 2011. ,
A simpler algorithm and shorter proof for the graph minor decomposition, Proc. of the 43rd ACM Symposium on Theory of Computing (STOC), pp.451-458, 2011. ,
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal, Proc. of the 22nd annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.777-789, 2011. ,
Slightly Superexponential Parameterized Problems, Proc. of the 22nd annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.760-776, 2011. ,
Graphs on surfaces, 2001. ,
Matching is as easy as matrix inversion, Combinatorica, vol.7, issue.1, pp.105-113, 1987. ,
A generalization of diagonal flips in a convex polygon, Theoretical Computer Science, vol.235, issue.2, pp.271-282, 2000. ,
Invitation to Fixed-Parameter Algorithms, 2006. ,
Graph minors. X. Obstructions to Tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991. ,
Graph minors. XVI. Excluding a Non-planar Graph, Journal of Combinatorial Theory, Series B, vol.77, pp.1-27, 1999. ,
Graph minors. XVI. Excluding a non-planar graph, Journal of Combinatorial Theory, Series B, vol.89, issue.1, pp.43-76, 2003. ,
Asymptotic enumeration of non-crossing partitions on surfaces, the Proc. of ICALP, 2011. ,
Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms (TALG), 2011. ,
Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994. ,
Faster approximation schemes and parameterized algorithms on (odd-)H-minorfree graphs, Theoretical Computer Science, vol.417, pp.95-107, 2012. ,