Contraction bidimensionality: The accurate picture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5757 LNCS, Issue , 2009, Pages 706-717

  Fomin, Fedor V ^a   Golovach, Petr ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; BIDIMENSIONALITY THEORY; PARAMETERIZED; STRUCTURE OF GRAPH; TREE-WIDTH;

COMBINATORIAL MATHEMATICS; SHRINKAGE;

APPROXIMATION ALGORITHMS;

EID: 70350401895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_63     Document Type: Conference Paper

References (19)

1. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270-279. IEEE Computer Society, Los Alamitos (2007)
2. Demaine, E., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal 51, 292-302 (2007)
3. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discrete Math. 18, 501-511 (2004/2005)
4. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52, 866-893 (2005)
5. Demaine, E.D., Hajiaghayi, M.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28, 19-36 (2008)
6. Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS 2005, pp. 637-646. IEEE Computer Society, Los Alamitos (2005)
7. Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction. Algorithmica (to appear, 2009)
8. Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: The bidimensional theory of bounded-genus graphs. SIAM J. Discrete Math. 20, 357-371 (2006) (electronic)
9. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comp. Sci. Rev. 2, 29-39 (2008)
10. Geelen, J.F., Richter, R.B., Salazar, G.: Embedding grids in surfaces. European J. Combin. 25, 785-792 (2004)
11. Mohar, B.: Combinatorial local planarity and the width of graph embeddings. Canad. J. Math. 44, 1272-1288 (1992)
12. Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins University Press, Baltimore (2001)
13. Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323-348 (1994)
14. Robertson, N., Seymour, P.D.: Disjoint paths-a survey. SIAM J. Algebraic Discrete Methods 6, 300-305 (1985)
15. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Series B 41, 92-114 (1986)
16. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to treedecomposition. J. Combin. Theory Ser. B 52, 153-190 (1991)
17. Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89, 43-76 (2003)
18. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323-348 (1994)
19. Thomassen, C.: A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B 70, 306-311 (1997)