Towards fully multivariate algorithmics: Some new results and directions in parameter ecology

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

Volumn 5874 LNCS, Issue , 2009, Pages 2-10

  Fellows, Michael ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; NEW RESULTS; PARAMETERIZED COMPLEXITY; RESEARCH DIRECTIONS;

ALGORITHMS; ECOLOGY;

COMBINATORIAL MATHEMATICS;

EID: 78650191429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10217-2_2     Document Type: Conference Paper

References (27)

1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991).
2. Bodlaender, H., Fellows, M., Hallett, M.: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In: Proceedings of the ACM Symposium on the Theory of Computing (STOC), pp. 449-458 (1994).
3. Bodlaender, H.L., Koster, A.M.: Combinatorial optimisation on graphs of bounded treewidth. The Computer Journal 51, 255-269 (2007).
4. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small width. SIAM J. Computing 25, 1305-1317 (1996).
5. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation 201, 216-231 (2005).
6. Fellows, M., Downey, R., Langston, M. (Guest eds.): The Computer Journal: Two special issues of surveys of various aspects of parameterized complexity and algorithmics. The Computer Journal 51(1&3) (2008).
7. Courcelle, B.: The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12-75 (1990).
8. Ding, G.: Subgraphs and well-quasi-ordering. J. Graph Theory 16, 489-502 (1992).
9. Downey, R., Estivill-Castro, V., Fellows, M., Prieto-Rodriguez, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electron. Notes Theor. Comp. Sci. 78, 205-218 (2003).
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999).
11. Downey, R., Fellows, M., Hallett, M., Kapron, B., Wareham, H.T.: The parameterized complexity of some problems in logic and linguistics. In: Matiyasevich, Y.V., Nerode, A. (eds.) LFCS 1994. LNCS, vol. 813, pp. 89-100. Springer, Heidelberg (1994).
12. Parameterized approximation for dominating set problems. Information Processing Letters 109, 68-70 (2008).
13. Downey, R., Fellows, M., Stege, U.: Parameterized complexity: a framework for systematically confronting computational intractability. In: Graham, R., Kratochvil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, Proceedings of the DIMACS-DIMATIA Workshop on the Future of Discrete Mathematics, Prague, 1997. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49-99 (1999).
14. Fellows, M., Fomin, F., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 366-377. Springer, Heidelberg (2007).
15. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006).
16. Fellows, M., Hermelin, D., Rosamond, F.: Well-quasi-ordering bounded treewidth graphs. In: Proceedings of IWPEC 2009. LNCS, vol. 5917. Springer, Heidelberg (to appear).
17. Fellows, M., Hermelin, D., Rosamond, F.: Parameter ecology, well-quasi-ordering and universal antichains (manuscript, 2009).
18. Fellows, M., Lokshtanov, D., Misra, N., Rosamond, F., Saurabh, S.: Graph Layout Problems Parameterized by Vertex Cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294-305. Springer, Heidelberg (2008).
19. Fellows, M., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F., Saurabh, S.: The complexity ecology of parameters: an illustration using bounded max leaf number. Theory of Computing Systems (2009).
20. Henglein, F., Mairson, H.G.: The complexity of type inference for higher-order typed lambda calculi. In: Proc. Symp. on Principles of Programming Languages (POPL), pp. 119-130. ACM Press, New York (1991).
21. Impagliazzo, R., Paturi, R.:Which problems have strongly exponential complexity? J. Computer and Systems Sciences 63, 512-530 (2001).
22. Lichtenstein, O., Pneuli, A.: Checking That Finite-State Concurrents Programs Satisfy Their Linear Specification. In: Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pp. 97-107 (1985).
23. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006).
24. Robertson, N., Seymour, P.: Graph minors: a survey. In: Anderson, J. (ed.) Surveys in Combinatorics, pp. 153-171. Cambridge University Press, Cambridge (1985).
25. Robertson, N., Seymour, P.: Graph minors XX. Wagner's conjecture. J. Comb. Th. Series B 92, 325-357 (2004).
26. Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 601-612. Springer, Heidelberg (2008).
27. Szeider, S.: Not so easy problems for tree decomposable graphs. In: Proc. ICDM 2008 (to appear).