, Efficient approximation for triangulation of minimum treewidth, Proc. of the 17th Conference on Uncertainty in Artificial Intelligence (UAI), pp.7-15, 2001.
, Efficient algorithms for combinatorial problems on graphs with bounded decomposability ??? A survey, BIT, vol.2, issue.1, pp.2-23, 1985.
DOI : 10.1007/BF01934985
, The map asymptotics constant t g, Electrononic Journal of Combinatorics, vol.15, issue.1, pp.51-59, 2008.
, Counting simplicial decompositions in surfaces with boundaries
, Dynamic programming on graphs with bounded treewidth, Proc. of the 15th International Colloquium on Automata, Languages and Programming (ICALP), pp.105-118, 1988.
DOI : 10.1007/3-540-19488-6_110
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8503
, Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs, Discrete & Computational Geometry, vol.37, issue.2, pp.213-235, 2007.
DOI : 10.1007/s00454-006-1292-5
, Indecomposable permutations, hypermaps and labeled Dyck paths, Journal of Combinatorial Theory, Series A, vol.116, issue.8, pp.1326-1343, 2009.
DOI : 10.1016/j.jcta.2009.02.008
URL : https://hal.archives-ouvertes.fr/hal-00344954
, 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), pp.30-53, 1988.
DOI : 10.1007/3-540-50728-0_34
, -minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893, 2005.
DOI : 10.1145/1101821.1101823
URL : https://hal.archives-ouvertes.fr/inria-00100521
, The Bidimensional Theory of Bounded-Genus Graphs, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.357-371, 2006.
DOI : 10.1137/040616929
, Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus, Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), pp.172-183, 2006.
DOI : 10.1007/11785293_18
, Subexponential parameterized algorithms, Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), pp.15-27, 2007.
DOI : 10.1016/j.cosrev.2008.02.004
URL : https://hal.archives-ouvertes.fr/inria-00455210
, Catalan structures and dynamic programming in Hminor-free graphs, Proc. of the 19th annual ACM-SIAM Symposium on Discrete algorithms Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos (SODA), pp.631-640, 2008.
, Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions, Proc. of the 13th Annual European Symposium on Algorithms (ESA), pp.95-106, 2005.
DOI : 10.1007/11561071_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.6055
, Dynamic Generators of Topologically Embedded Graphs, Proc. of the 14th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp.599-608, 2003.
, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739
, Analytic combinatorics of non-crossing configurations, Discrete Mathematics, vol.204, issue.1-3, pp.203-229, 1999.
DOI : 10.1016/S0012-365X(98)00372-0
URL : https://hal.archives-ouvertes.fr/inria-00073493
, Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up, Proc. of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pp.581-592, 2004.
DOI : 10.1007/978-3-540-27836-8_50
, Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, SIAM Journal on Computing, vol.36, issue.2, pp.281-309, 2006.
DOI : 10.1137/S0097539702419649
, On self duality of pathwidth in polyhedral graph embeddings, Journal of Graph Theory, vol.14, issue.1, pp.42-54, 2007.
DOI : 10.1002/jgt.20219
, The number of rooted triangular maps on a surface, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.236-249, 1991.
DOI : 10.1016/0095-8956(91)90065-R
, Computing vertex connectivity: new bounds from old techniques, Proceedings of 37th Conference on Foundations of Computer Science, pp.222-250, 2000.
DOI : 10.1109/SFCS.1996.548505
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7430
, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 1998.
DOI : 10.1109/SFCS.1998.743516
URL : http://doi.org/10.1006/jcss.2001.1774
, Graphs on surfaces, 2001.
, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919
, Graph Minors .XII. Distance on a Surface, Journal of Combinatorial Theory, Series B, vol.64, issue.2, pp.240-272, 1995.
DOI : 10.1006/jctb.1995.1034
URL : http://doi.org/10.1006/jctb.1999.1919
, Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs, Electronic Notes in Discrete Mathematics, vol.32, pp.59-66, 2009.
DOI : 10.1016/j.endm.2009.02.009
, Call routing and the ratcatcher, Combinatorica, vol.32, issue.2, pp.217-241, 1994.
DOI : 10.1007/BF01215352
, Algorithms for Vertex Partitioning Problems on Partial k-Trees, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.529-550, 1997.
DOI : 10.1137/S0895480194275825
, The graph genus problem is NP-complete, Journal of Algorithms, vol.10, issue.4, pp.568-576, 1989.
DOI : 10.1016/0196-6774(89)90006-0
, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.
, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex
, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399