Domination problems in nowhere-dense classes of graphs

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 157-168

  Dawar, Anuj ^a   Kreutzer, Stephan ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DOMINATING SET PROBLEMS; DOMINATION PROBLEM; EXCLUDED-MINORS; GRAPH CLASS; INDUCED SUBGRAPHS; KEY FEATURE; PARAMETERIZED COMPLEXITY; STRUCTURAL DECOMPOSITION;

SOFTWARE ENGINEERING;

EID: 84866641744     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2315     Document Type: Conference Paper

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. Rosamond, and U. Stege. A refined search tree technique for dominating set on planar graphs. Journal of Comput. Syst. Sci., 71(4): 385-405, 2005.
3. N. Alon and S. Gutner. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. In COCOON, pages 394-405, 2007.
4. A. Atserias, A. Dawar, and Ph G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. Journal of the ACM, 53(2): 208-237, 2006.
5. J. Bar-Ilan, G. Kortsarz, and D. Peleg. How to allocate network centers. J. Algorithms, 15(3): 385-415, 1993.
6. Marco Cesati. http://bravo.ce.uniroma2.it/home/cesati/research/ compendium/, September 15 2006.
7. A. Dawar. Finite model theory on tame classes of structures. In MFCS, Volume 4708 of LNCS, pages 2-12. Springer, 2007.
8. A. Dawar. Homomorphism preservation on quasi-wide classes. to appear in JCSS, 2008. see also arXiv:0811.4497v1 [cs.LO].
9. A. Dawar, M. Grohe, and S. Kreutzer. Locally excluding a minor. In Logic in Computer Science (LICS), pages 270-279, 2007.
10. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. on Algorithms, 1(1): 33-47, 2005.
11. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and h-minor-free graphs. J. ACM, 52(6): 866-893, 2005.
12. R. Diestel. Graph Theory. Springer-Verlag, 3rd edition, 2005.
13. R. Downey and M. Fellows. Parameterized Complexity. Springer, 1998.
14. J.A. Ellis, H. Fan, and M.R. Fellows. The dominating set problem is fixed parameter tractable for graphs of bounded genus. J. Algorithms, 52(2): 152-168, 2004.
15. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
16. F. V. Fomin and D. M. Thilikos. Dominating sets in planar graphs: branch-width and exponential speed-up. In SODA, pages 168-177, 2003.
17. P. A. Golovach and Y. Villanger. Parameterized complexity for domination problems on degenerate graphs. In WG, Volume 5344 of LNCS, pages 195-205. Springer, 2008.
18. I. A. Kanj and L. Perkovic. Improved parameterized algorithms for planar dominating set. In MFCS, pages 399-410, 2002.
19. J. Nešetřil and P. Ossona de Mendez. First-order properties of nowhere dense structures. to appear in Journal of Symbolic Logic, 2008.
20. J. Nešetřil and P. Ossona de Mendez. Grad and classes with bounded expansion I-III. European Journal of Combinatorics, 29, 2008. Series of 3 papers appearing in volumes (3) and (4).
21. J. Nešetřil and P. Ossona de Mendez. On nowhere dense graphs. to appear in European Journal of Combinatorics, 2008.
22. J. Nešetřil and P. Ossona de Mendez. Structural properties of sparse graphs. In M. Grötschel and G.O.H. Katona, editors, Building Bridges Between Mathematics and Computer Science, Volume 19. Springer, 2008.
23. G. Philip, V. Raman, and S. Sikdar. Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels. In ESA, Volume 5757 of LNCS, pages 694-705. Springer, 2009.