Kernelizations for parameterized counting problems

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

Volumn 4484 LNCS, Issue , 2007, Pages 703-714

  Thurley, Marc ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

BUSS KERNELIZATION; HYPERGRAPHS; PARAMETER TRACTABILITY; PARAMETERIZED COUNTING PROBLEMS;

PARAMETERIZATION;

EID: 35448958780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72504-6_64     Document Type: Conference Paper

References (28)

1. Susanne Albers and Tomasz Radzik, editors. Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, volume 3221 of Lecture Notes in Computer Science. Springer, 2004.
2. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12(2):308-340, 1991.
3. Hans L. Bodlaender, editor. Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, volume 2880 of Lecture Notes in Computer Science. Springer, 2003.
4. Hajo Broersma, Matthew Johnson, and Stefan Szeider, editors. Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK, volume 4 of Texts in Algorithmics. King's College, London, 2005.
5. Jianer Chen, Iyad A. Kanj, and Weijia Jia. Vertex cover: Further observations and further improvements. J. Algorithms, 41(2):280-301, 2001.
6. 2) steps. In WG, pages 257-269, 2004.
7. Bruno Courcelle, Johann A. Makowsky, and Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics, 108(1-2):23-52, 2001.
8. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw. Greedy localization, iterative compression, modeled crown reductions: New fpt techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover. In Downey et al. [14], pages 271-280.
9. Frank K. H. A. Dehne, Alejandro López-Ortiz, and Jörg-Rüdiger Sack, editors. Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, volume 3608 of Lecture Notes in Computer Science. Springer, 2005.
10. Josep Díaz, Maria J. Serna, and Dimitrios M. Thilikos. Fixed parameter algorithms for counting and deciding bounded restrictive list h-colorings. In Albers and Radzik [1], pages 275-286.
11. R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In P. Clote, J. Remmel (eds.): Feasible Mathematics II, pages 219-244. Boston: Birkhäuser, 1995.
12. Rodney G. Downey and Michael R. Fellows. Fixed parameter tractability and completeness. In Complexity Theory: Current Research, pages 191-225, 1992.
13. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer, 1999.
14. Rodney G. Downey, Michael R. Fellows, and Frank K. H. A. Dehne, editors. Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, volume 3162 of Lecture Notes in Computer Science. Springer, 2004.
15. Michael R. Fellows. Blow-ups, win/win's, and crown rules: Some new directions in fpt. In Bodlaender [3], pages 1-12.
16. Henning Fernau. Parameterized algorithmics: A graph-theoretic approach. Habilitationsschrift, Universität Tübingen, 2005.
17. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Springer, 2006.
18. M. Frick. Easy Instances for Model Checking. PhD thesis, Universität Freiburg, 2001.
19. Daniel Lokshtanov and Christian Sloper. Fixed parameter set splitting, linear kernel and improved running time. In Broersma et al. [4], pages 105-113.
20. Luke Mathieson, Elena Prieto, and Peter Shaw. Packing edge disjoint triangles: A parameterized view. In Downey et al. [14], pages 127-137.
21. Rolf Niedermeier. Invitation to fixed-parameter algorithms. Habilitationsschrift, Universität Tübingen, 2002.
22. Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Parameterized counting algorithms for general graph covering problems. In Dehne et al. [9], pages 99-109.
23. Christos H. Papadimitriou. Computational Complexity. Pearson, 1994.
24. Peter Rossmanith. (unpublished).
25. Dan Roth. On the hardness of approximate reasoning. Artif. Intell., 82(1-2):273-302, 1996.
26. M. Thurley. Tractability and intractability of parameterized counting problems. diploma thesis, humboldt Universität zu berlin, 2006.
27. Leslie G. Valiant, The complexity of computing the permanent. Theor. Comput. Sci., 8:189-201, 1979.
28. Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8(3):410-421, 1979.