The bidimensional theory of bounded-genus graphs

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

Volumn 3153, Issue , 2004, Pages 191-203

  Demaine, Erik D ^a   Hajiaghayi, Mohammadtaghi ^a   Thilikos, Dimitrios M ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

BOUNDED-GENUS GRAPHS; COMBINATORIAL OPTIMIZATION PROBLEMS; CONNECTED DOMINATING SET; EDGE DOMINATING SET; FEEDBACK VERTEX SET; FIXED-PARAMETER ALGORITHMS; GRAPH CONTRACTION; MINIMUM MAXIMAL MATCHING;

GRAPH THEORY;

EID: 35048896664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_12     Document Type: Article

References (23)

1. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica, 33(4):461-493, 2002.
2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. A. Rosamond, and U. Stege. Refined search tree technique for DOMINATING SET on planar graphs. In MFCS 2001, LNCS 2136, pp. 111-122.
3. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: Exponential speed-up for planar graph problems. ECCC, 8(23), 2001.
4. E. Amir. Efficient approximation for triangulation of minimum treewidth. In UAI 2001, pp. 7-15.
5. M.-S. Chang, T. Kloks, and C.-M. Lee. Maximum clique transversals. In WG 2001, pp. 300-310.
6. E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos. Bidimensional parameters and local treewidth. SIAM J. Discr. Math. To appear. A preliminary version appears in LATIN 2004, LNCS 2976, 2004, pp. 109-118.
7. E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos. Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs. In ICALP 2003, pp. 829-844.
8. E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. In SODA 2004, pp. 823-832.
9. E. D. Demaine and M. Hajiaghayi. Diameter and treewidth in minor-closed graph families, revisited. Algorithmica. To appear.
10. E. D. Demaine and M. Hajiaghayi. Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In SODA 2004, pp. 833-842.
11. E. D. Demaine, M. Hajiaghayi, N. Nishimura, P. Ragde, and D. M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. System Sci.. To appear.
12. 5-minor-free graphs. In ISAAC 2002, LNCS 2518, pp. 262-273.
13. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
14. F. V. Fomin and D. M. Thilikos. Dominating sets in planar graphs: Branch-width and exponential speed-up. In SODA 2003, pp. 168-177.
15. G. Gutin, T. Kloks, and C. Lee. Kernels in planar digraphs. In Optimization Online. Mathematical Programming Society, 2001.
16. I. Kanj and L. Perković. Improved parameterized algorithms for planar dominating set. In MFCS 2002, LNCS 2420, pp. 399-410.
17. T. Kloks, C. M. Lee, and J. Liu. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs. In WG 2002, LNCS 2573, pp. 282-296.
18. L. Lovász. Personal communication, Dec. 2003.
19. N. Robertson and P. D. Seymour. Graph minors - a survey. In Surveys in Combinatorics, pp. 153-171. Cambridge Univ. Press, 1985.
20. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7(3):309-322, 1986.
21. N. Robertson and P. D. Seymour. Graph minors. VII. Disjoint paths on a surface. J. Combin. Theory Ser. B, 45(2):212-254, 1988.
22. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B, 52(2):153-190, 1991.
23. N. Robertson and P. D. Seymour. Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B, 89(1):43-76, 2003.