Problems parameterized by treewidth tractable in single exponential time: A logical approach

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

Volumn 6907 LNCS, Issue , 2011, Pages 520-531

  Pilipczuk, Michał ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL TIME; EXPONENTIAL TIME HYPOTHESIS; LOCAL CONDITIONS; LOGICAL APPROACHES; MODAL LOGIC; PARAMETERIZED; ROBUST ALGORITHM; TREE-WIDTH;

ALGORITHMS; COMPUTER SCIENCE; MODEL CHECKING;

PARAMETERIZATION;

EID: 80052124208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_47     Document Type: Conference Paper

References (23)

1. Alber, J., Niedermeier, R.: Improved tree decomposition based algorithms for domination-like problems. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 221-233. Springer, Heidelberg (2002)
2. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991)
3. Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation 85(1), 12-75 (1990)
4. Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M.,Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. CoRR, abs/1103.0534 (2010)
5. Demaine, E., Fomin, F., Hajiaghayi, M., Thilikos, D.: Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, p. 190. Springer, Heidelberg (2003)
6. Demaine, E.D., Hajiaghayi, M.T.: The bidimensionality theory and its algorithmic applications. The Computer Journal 51(3), 292-302 (2008)
7. Dorn, F., Fomin, F.V., Thilikos, D.M.: Fast subexponential algorithm for non-local problems on graphs of bounded genus. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 172-183. Springer, Heidelberg (2006) (Pubitemid 44123968)
8. Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc., Orlando (1974)
9. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275-291 (2000)
10. Fiorini, S., Hardy, N., Reed, B., Vetta, A.: Planar graph bipartization in linear time. In: Proc. 2nd GRACO, Electronic Notes in Discrete Mathematics, pp. 265-271. Elsevier, Amsterdam (2005)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)
12. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and tree Width. Algorithmica 54(2), 181-207 (2009)
13. Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 215-224 (2002)
14. Kleinberg, J., Tardos, É.: Algorithm Design. Addison-Wesley, Reading (2005)
15. Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)
16. Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. In: 22st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 (2011)
17. Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: 22st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 (2011)
18. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory of Computing Systems 43(2), 234-253 (2008)
19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
20. Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B 36(1), 49-64 (1984)
21. van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566-577. Springer, Heidelberg (2009)
22. van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/Exclusion Meets Measure and Conquer. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 554-565. Springer, Heidelberg (2009)
23. Weyer, M.: Modifizierte parametrische Komplexitätstheorie. Dissertation, Albert-Ludwigs-Universität Freiburg (2007)