Confronting intractability via parameters

Computer Science Review

Volumn 5, Issue 4, 2011, Pages 279-317

  Downey, Rodney G ^a   Thilikos, Dimitrios M ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Parameterized algorithms; Parameterized complexity

Indexed keywords

EID: 80055044336     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2011.09.002     Document Type: Review

References (280)

1. R. Downey, Parameterized complexity for the skeptic, in: Proceedings. 18th IEEE Annual Conference on Proceedings 18th IEEE Annual Conference on Computational Complexity, 2003, pp. 147-168.
2. Downey R.G., Fellows M.R. Parameterized Complexity. Monographs in Computer Science 1999, Springer-Verlag, New York.
3. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness 1979, W.H. Freeman and Co., San Francisco, Calif.
4. K. Weihe, Covering trains by stations or the power of data reduction, in: R. Battiti and A.A. Bertossi (Eds.), Proceedings of Algorithms and Experiments, ALEX98, 1998, pp. 1-8.
5. M. Grohe, K. Kawarabayashi, D. Marx, P. Wollan, Finding topological subgraphs is fixed-parameter tractable, in: STOC 2011, 2011, pp. 479-488.
6. Robertson N., Seymour P.D. Graph minors-a survey. London Math. Soc. Lecture Note Ser. 1985, vol. 103:153-171. Cambridge Univ. Press, Cambridge.
7. Karp R.M. On the computational complexity of combinatorial problems. Networks 1975, 5(1):45-68. (Proc. of the Symposium on Large-Scale Networks, Evanston, IL, USA, 18-19 April 1974).
8. Chen J., Kanj I.A., Xia G. Improved upper bounds for vertex cover. Theoret. Comput. Sci. 2010, 411:3736-3756.
9. Cheetham J., Dehne F., Rau-Chaplin A., Stege U., Taillon P.J. Solving large FPT problems on coarse-grained parallel machines. J. Comput. System Sci. 2003, 67(4):691-706.
10. Langston M.A., Perkins A.D., Saxton A.M., Scharff J.A., Voy B.H. Innovative computational methods for transcriptomic data analysis: a case study in the use of FPT for practical algorithm design and implementation. Comput. J. 2008, 51(1):26-38.
11. Impagliazzo R., Paturi R., Zane F. Which problems have strongly exponential complexity. J. Comput. System Sci. 2001, 63(4):512-530. (special issue on) FOCS (Palo Alto, CA).
12. Chen Y., Grohe M. An isomorphism between subexponential and parameterized complexity theory. SIAM J. Comput. 2007, 37:1228-1258.
13. Abrahamson K.A., Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Logic 1995, 73(3):235-276.
14. Arora S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. 37th Annual Symposium on Foundations of Computer Science 1996, 2-11. IEEE Comput. Soc. Press, Los Alamitos, CA.
15. Chekuri C., Khanna S. A PTAS for the multiple knapsack problem. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000, 213-222. ACM, New York.
16. Shamir R., Tsur D. The maximum subforest problem: approximation and exact algorithms (extended abstract). Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms 1998, 394-399. ACM, New York.
17. Chen J., Miranda A. A polynomial time approximation scheme for general multiprocessor job scheduling. SIAM J. Comput. 2001, 31(1):1-17. (electronic).
18. Erlebach T., Jansen K., Seidel E. Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 2005, 34(6):1302-1323. (electronic).
19. Arora S. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 38th Annual Symposium on Foundations of Computer Science 1997, 554-563. IEEE Computer Society, Washington, DC, USA.
20. Downey R.G., Fellows M.R., Langston M.A. The computer journal special issue on parameterized complexity: foreword by the guest editors. Comput. J. 2008, 51(1):1-6.
21. Downey R.G., McCartin C. Some new directions and questions in parameterized complexity. Developments in Language Theory 2004, 12-26.
22. Downey R.G., Fellows M.R., Stege U. Computational tractability: the view from Mars. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 1999, (69):73-97.
23. Downey R.G., Fellows M.R., Stege U. Parameterized complexity: a framework for systematically confronting computational intractability. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1999, vol. 49:49-99. Amer. Math. Soc., Providence, RI.
24. Fellows M.R. Parameterized complexity: the main ideas and connections to practical computing. Lecture Notes in Comput. Sci. 2002, vol. 2547:51-77. Springer, Berlin.
25. Fellows M.R. Parameterized complexity: the main ideas and some research frontiers. Lecture Notes in Comput. Sci. 2001, vol. 2223:291-307. Springer, Berlin.
26. Fellows M.R. New directions and new challenges in algorithm design and complexity, parameterized. Lecture Notes in Comput. Sci. 2003, vol. 2748:505-519. Springer, Berlin.
27. Downey R.G., Fellows M.R. Parameterized complexity after (almost) ten years: review and open questions. Aust. Comput. Sci. Commun. 1999, vol. 21:1-33. Springer, Singapore.
28. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications 2006, vol. 31. Oxford University Press, Oxford.
29. Flum J., Grohe M. Parameterized complexity and subexponential time. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 2004, (84):71-100.
30. Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness. I. Basic results. SIAM J. Comput. 1995, 24(4):873-921.
31. Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoret. Comput. Sci. 1995, 141(1-2):109-131.
32. Abrahamson K., Fellows M., Ellis J., Mata M. On the complexity of fixed parameter problems. 30th Annual IEEE Symposium on Foundations of Computer Science 1989, 210-215. IEEE Computer Society, Los Alamitos, CA, USA.
33. Cai L., Chen J., Downey R.G., Fellows M.R. On the parameterized complexity of short computation and factorization. Arch. Math. Logic 1997, 36:321-337.
34. Cai L., Juedes D. On the existence of subexponential parameterized algorithms. J. Comput. System Sci. 2003, 67(4):789-807. Parameterized Computation and Complexity 2003.
35. Downey R.G., Estivill-Castro V., Fellows M., Prieto E., Rosamund F.A. Cutting up is hard to do: the parameterised complexity of k-cut and related problems. Electron. Notes Theor. Comput. Sci. 2003, 78:209-222. CATS'03, Computing: the Australasian Theory Symposium.
36. Downey R.G., Fellows M.R., Vardy A., Whittle G. The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 1999, 29:545-570.
37. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness, in: Proc. of the Twenty-First Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, MB, 1991, vol. 87, 1992, pp. 161-178.
38. Cesati M. The turing way to parameterized complexity. J. Comput. System Sci. 2003, 67(4):654-685. Parameterized Computation and Complexity 2003.
39. Cesati M. Perfect code is W[1]-complete. Inform. Process. Lett. 2002, 81(3):163-168.
40. Bodlaender H.L., Fellows M.R., Hallett M.T. Beyond np-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy. Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing 1994, 449-458. ACM, New York, NY, USA.
41. van Rooij I., Wareham T. Parameterized complexity in cognitive modeling: foundations, applications and opportunities. Comput. J. 2008, 51(3):385-404.
42. C. Bazgan, Schémas d'approximation et complexité paramétrée, Technical Report, Rapport de Stage de DEA d'Informatique, Orsay, 1995.
43. Cai L., Fellows M., Juedes D., Rosamond F. The complexity of polynomial-time approximation. Theory Comput. Syst. 2007, 41:459-477.
44. Cai L., Juedes D. Subexponential parameterized algorithms collapse the W-hierarchy. Lecture Notes in Comput. Sci. 2001, vol. 2076:273-284. Springer, Berlin.
45. Alber J., Bodlaender H.L., Fernau H., Kloks T., Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 2002, 33(4):461-493.
46. Kloks T., Lee C.M., Liu J. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. Lecture Notes in Comput. Sci. 2002, vol. 2573:282-295. Springer, Berlin.
47. Fomin F.V., Thilikos D.M. Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM J. Comput. 2006, 36(2):281-309. (electronic).
48. Koutsonas A., Thilikos D. Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms. Algorithmica 2010, 1-17.
49. Chen Y., Flum J. On miniaturized problems in parameterized complexity theory. Theoret. Comput. Sci. 2006, 351:314-336.
50. Chen J., Chor B., Fellows M., Huang X., Juedes D., Kanj I.A., Xia G. Tight lower bounds for certain parameterized NP-hard problems. Inform. Comput. 2005, 201:216-231.
51. Marx D. Closest substring problems with small distances. SIAM J. Comput. 2008, 38:1382-1410.
52. Chen J., Meng J. On parameterized intractability: hardness and completeness. Computer J. 2008, 51(1):39-59.
53. Fomin F.V., Golovach P.A., Lokshtanov D., Saurabh S. Clique-width: on the price of generality. SODA'09: Proc. of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms 2009, 825-834. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
54. F. Fomin, P. Golovach, D. Lokshtanov, S. Saurabh, Algorithmic lower bounds for problems parameterized with clique-width, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, 2010, pp. 493-502.
55. D. Lokshtanov, D. Marx, S. Saurabh, Known algorithms on graphs of bounded treewidth are probably optimal, in: 22st ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 2011.
56. D. Lokshtanov, D. Marx, S. Saurabh, Known algorithms on graphs of bounded treewidth are probably optimal, CoRR, 2010. arxiv:1007.5450.
57. M. Alekhnovich, A. Razborov, Resolution is not automatizable unless W[P] is tractable, in: Foundations of Computer Science, Annual IEEE Symposium on, vol. 0, 2001, p. 210.
58. K. Eickmeyer, M. Grohe, M. Grüber, Approximation of natural w[p]-complete minimisation problems is hard, in: IEEE Conference on Computational Complexity, 2008, pp. 8-18.
59. Flum J., Grohe M. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series 2006, Springer-Verlag, Berlin.
60. Frick M., Grohe M. Deciding first-order properties of locally tree-decomposable graphs. Lecture Notes in Computer Science 1999, vol. 1644:331-340. Springer, Berlin, Heidelberg. J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.).
61. Frick M., Grohe M. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 2004, 130(1-3):3-31.
62. Luks E.M. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci. 1982, 25:42-65.
63. Schöning U. Graph isomorphism is in the low hierarchy. Lecture Notes in Computer Science 1987, vol. 247:114-124. Springer, Berlin, Heidelberg. F. Brandenburg, G. Vidal-Naquet, M. Wirsing (Eds.).
64. Bodlaender H.L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 1990, 11:631-643.
65. McCartin C. Parameterized counting problems. Ann. Pure Appl. Logic 2006, 138(1-3):147-182.
66. Flum J., Grohe M. The parameterized complexity of counting problems. SIAM J. Comput. 2004, 33(4):892-922.
67. Downey R.G., Fellows M.R., Regan K.W. Parameterized circuit complexity and the W hierarchy. Theoret. Comput. Sci. 1998, 191:97-115.
68. Müller M. Randomized approximations of parameterized counting problems. Lecture Notes in Computer Science 2006, vol. 4169:50-59. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
69. Müller M. Parameterized derandomization. Proceedings of the 3rd International Conference on Parameterized and Exact Computation 2008, 148-159. Springer-Verlag, Berlin, Heidelberg.
70. Montoya J.A. The parameterized complexity of probability amplification. Inform. Process. Lett. 2008, 109:46-53.
71. Müller M. Valiant-Vazirani lemmata for various logics. Electron. Colloq. Comput. Complex. ECCC 2008, 15(063).
72. Downey R., Fellows M. Fixed-parameter tractability and completeness. III. Some structural aspects of the W hierarchy. Complexity Theory 1993, 191-225. Cambridge Univ. Press, Cambridge.
73. Cesati M., Fellows M.R. Sparse parameterized problems. Ann. Pure Appl. Logic 1996, 82(1):1-15.
74. Cai L., Huang X. Fixed-parameter approximation: conceptual framework and approximability results. Lecture Notes in Computer Science 2006, vol. 4169:96-108. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
75. Chen Y., Grohe M., Grüber M. On parameterized approximability. Lecture Notes in Computer Science 2006, vol. 4169:109-120. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
76. Downey R., Fellows M., McCartin C. Parameterized approximation problems. Lecture Notes in Computer Science 2006, vol. 4169:121-129. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
77. F. Abu-Khzam, R.L. Collins, M.R. Fellows, M.A. Langston, W.H. Suters, C.T. Symons, Kernelization algorithms for the vertex cover problem: theory and experiments, in: ALENEX/ANALC, 2004, pp. 62-69.
78. Guo J., Niedermeier R. Invitation to data reduction and problem kernelization. SIGACT News 2007, 38:31-45.
79. Nemhauser G.L., Trotter L.E. Vertex packings: structural properties and algorithms. Math. Program. 1975, 8:232-248.
80. Dinur I., Safra S. The importance of being biased. Proceedings of the Tthiry-Fourth Annual ACM Symposium on Theory of Computing 2002, 33-42. ACM, New York, NY, USA.
81. D. Harnik, M. Naor, On the compressibility of np instances and cryptographic applications, in: Foundations of Computer Science, Annual IEEE Symposium on, vol. 0, 2006, pp. 719-728.
82. Bodlaender H.L., Downey R.G., Fellows M.R., Hermelin D. On problems without polynomial kernels. J. Comput. System Sci. 2009, 75:423-434.
83. Fortnow L., Santhanam R. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. System Sci. 2011, 77(1):91-106. Celebrating Karp's Kyoto Prize.
84. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 1996, 25(6):1305-1317.
85. H.L. Bodlaender, S. Thomassé, A. Yeo, Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels, Technical Report UU-CS-2008-030, Department of Information and Computing Sciences, Utrecht University, 2008.
86. Chen Y., Flum J., Müller M. Lower bounds for kernelizations and other preprocessing procedures. Lecture Notes in Computer Science 2009, vol. 5635:118-128. Springer, Berlin, Heidelberg. K. Ambos-Spies, B. Löwe, W. Merkle (Eds.).
87. Fernau H., Fomin F.V., Lokshtanov D., Raible D., Saurabh S., Villanger Y. Kernel(s) for problems with no kernel: on out-trees with many leaves. Leibniz International Proceedings in Informatics (LIPIcs) 2009, vol. 3:421-432. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. S. Albers, J.-Y. Marion (Eds.).
88. S. Kratsch, Co-nondeterminism in compositions: a kernelization lower bound for a ramsey-type problem, CoRR, 2011. arxiv:1107.3704.
89. Dell H., van Melkebeek D. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. Proceedings of the 42nd ACM Symposium on Theory of Computing 2010, 251-260. ACM, New York, NY, USA.
90. H. Buhrman, J.M. Hitchcock, NP-hard sets are exponentially dense unless coNP⊆ NP/poly, in: IEEE Conference on Computational Complexity, 2008, pp. 1-7.
91. Dom M., Lokshtanov D., Saurabh S. Incompressibility through colors and ids. Lecture Notes in Computer Science 2009, vol. 5555:378-389. Springer, Berlin, Heidelberg. S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, W. Thomas (Eds.).
92. Flum J., Grohe M., Weyer M. Bounded fixed-parameter tractability and log2n nondeterministic bits. J. Comput. System Sci. 2006, 72:34-71.
93. Downey R.G., Evans P.A., Fellows M.R. Parameterized learning complexity. Proceedings of the Sixth Annual Conference on Computational Learning Theory 1993, 51-57. ACM, New York, NY, USA.
94. Downey R.G., Fellows M.R. Parameterized computational feasibility. Progr. Comput. Sci. Appl. Logic 1995, vol. 13:219-244. Birkhäuser Boston, Boston, MA.
95. H. Fernau, Parameterized algorithmics: a graph-theoretic approach, Habilitationsschrift, Universitat Tubingen, Tubingen, Germany, 2005.
96. Buss J.F., Goldsmith J. Nondeterminism within P. SIAM J. Comput. 1993, 22(3):560-572.
97. Balasubramanian R., Fellows M., Raman V. An improved fixed-parameter algorithm for vertex cover. Inform. Process. Lett. 1998, 65:163-168.
98. Chen J., Kanj I.A., Jia W. Vertex cover: further observations and further improvements. J. Algorithms 2001, 41(2):280-301.
99. Niedermeier R., Rossmanith P. Upper bounds for vertex cover further improved. Lecture Notes in Comput. Sci. 1999, vol. 1563:561-570. Springer, Berlin.
100. Chen J., Liu L., Jia W. Improvement on vertex cover for low-degree graphs. Networks 2000, 35(4):253-259.
101. Niedermeier R., Rossmanith P. On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 2003, 47(2):63-77.
102. Robson J.M. Algorithms for maximum independent sets. J. Algorithms 1986, 7(3):425-440.
103. F.V. Fomin, F. Grandoni, D. Kratsch, Measure and conquer: a simple O(20.288n)) independent set algorithm, in: SODA, 2006, pp. 18-25.
104. Chen J., Fomin F.V., Liu Y., Lu S., Villanger Y. Improved algorithms for feedback vertex set problems. J. Comput. System Sci. 2008, 74:1188-1198.
105. Dehne F.K.H.A., Fellows M.R., Langston M.A., Rosamond F.A., Stevens K. An o(2O(k)n3) fpt algorithm for the undirected feedback vertex set problem. Theory Comput. Syst. 2007, 41(3):479-492.
106. Guo J., Gramm J., Hüffner F., Niedermeier R., Wernicke S. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. System Sci. 2006, 72(8):1386-1396.
107. Böcker S., Briesemeister S., Bui Q., Truss A. Going weighted: parameterized algorithms for cluster editing. Lecture Notes in Computer Science 2008, vol. 5165:1-12. Springer, Berlin, Heidelberg. B. Yang, D.-Z. Du, C. Wang (Eds.).
108. Gramm J., Guo J., Hüffner F., Niedermeier R. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 2004, 39(4):321-347.
109. Alon N., Gutner S. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 2009, 54(4):544-556.
110. Amini O., Fomin F., Saurabh S. Implicit branching and parameterized partial cover problems (extended abstract). IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2008, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany. R. Hariharan, M. Mukund, V. Vinay (Eds.).
111. Chen J., Friesen D.K., Jia W., Kanj I.A. Using nondeterminism to design efficient deterministic algorithms. Algorithmica 2004, 40(2):83-97.
112. Jia W., Zhang C., Chen J. An efficient parameterized algorithm for m-set packing. J. Algorithms 2004, 50(1):106-117.
113. Fellows M., Heggernes P., Rosamond F., Sloper C., Telle J.A. Finding k disjoint triangles in an arbitrary graph. Lecture Notes in Comput. Sci. 2004, vol. 3353:235-244. Springer, Berlin.
114. Chen J., Liu Y., Lu S., O'sullivan B., Razgon I. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 2008, 55:21:1-21:19.
115. Golovach P.A., Thilikos D.M. Paths of bounded length and their cuts: parameterized complexity and algorithms. Discrete Optim. 2011, 8(1):72-86. Parameterized Complexity of Discrete Optimization.
116. H.L. Bodlaender, D.M. Thilikos, Computing small search numbers in linear time, in: IWPEC, 2004, pp. 37-48.
117. Bodlaender H.L., Kloks T. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 1996, 21(2):358-402.
118. Bodlaender H.L., Fellows M.R., Thilikos D.M. Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. System Sci. 2009, 75(4):231-244.
119. Bodlaender H.L., Thilikos D.M. Constructive linear time algorithms for branchwidth. Lecture Notes in Computer Science 1997, vol. 1256:627-637. Springer, Berlin.
120. D.M. Thilikos, H.L. Bodlaender, Constructive linear time algorithms for branchwidth, Technical Report UU-CS-2000-38, Dept. of Computer Science, Utrecht University, 2000.
121. Thilikos D.M., Serna M.J., Bodlaender H.L. Constructive linear time algorithms for small cutwidth and carving-width. Lecture Notes in Comput. Sci. 2000, vol. 1969:192-203. Springer, Berlin.
122. Thilikos D.M., Serna M., Bodlaender H.L. Cutwidth. I. A linear time fixed parameter algorithm. J. Algorithms 2005, 56(1):1-24.
123. Thilikos D.M., Serna M., Bodlaender H.L. Cutwidth. II. Algorithms for partial w-trees of bounded degree. J. Algorithms 2005, 56(1):25-49.
124. Serna M., Thilikos D.M. Parameterized complexity for graph layout problems. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 2005, (86):41-65.
125. P. Berthomé, N. Nisse, A unified FPT algorithm for width of partition functions, Technical Report INRIA-00321766, INRIA, September 2008.
126. Hliněný P. Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 2006, 96(3):325-351.
127. Geelen J., Gerards B., Whittle G. Towards a structure theory for matrices and matroids. International Congress of Mathematicians 2006, vol. III:827-842. Eur. Math. Soc., Zürich.
128. Robertson N., Seymour P.D. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 1991, 52(2):153-190.
129. Courcelle B. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. Comput. 1990, 85(1):12-75.
130. Arnborg S., Lagergren J., Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 1991, 12:308-340.
131. Borie R.B., Parker R.G., Tovey C.A. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 1992, 7:555-581.
132. Kneis J., Langer A. A practical approach to Courcelle's theorem. Electron. Notes Theor. Comput. Sci. 2009, 251:65-81.
133. J. Kneis, A. Langer, P. Rossmanith, Courcelle's theorem-A game-theoretic approach, Discrete Optimization, Available online 30 June 2011.
134. Courcelle B. The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues. RAIRO Inform. Théor. Appl. 1992, 26(3):257-286.
135. Courcelle B., Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 1993, 109:49-82.
136. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars 1997, 313-400.
137. Fellows M.R., Fomin F.V., Lokshtanov D., Rosamond F.A., Saurabh S., Szeider S., Thomassen C. On the complexity of some colorful problems parameterized by treewidth. Inform. Comput. 2011, 209(2):143-153.
138. Golovach P., Thilikos D. Paths of bounded length and their cuts: parameterized complexity and algorithms. Lecture Notes in Comput. Sci. 2009, vol. 5917:210-221. Springer, Berlin.
139. Courcelle B., Makowsky J.A., Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 2000, 33(2):125-150.
140. A. Langer, P. Rossmanith, S. Sikdar, Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory, CoRR, 2011. arxiv:1102.0908.
141. Oum S., Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 2006, 96(4):514-528.
142. Nešetřil, de Mendez P.O. On nowhere dense graphs. European J. Combin. 2011, 32(4):600-617.
143. Nešetřil J., Ossona de Mendez P. Grad and classes with bounded expansion. I. Decompositions. European J. Combin. 2008, 29(3):760-776.
144. Nešetřil J., Ossona de Mendez P. Grad and classes with bounded expansion. II. Algorithmic aspects. European J. Combin. 2008, 29(3):777-791.
145. Nešetřil J., Ossona de Mendez P. Grad and classes with bounded expansion. III. Restricted graph homomorphism dualities. European J. Combin. 2008, 29(4):1012-1024.
146. J. Nešetřil, P.O. de Mendez, D.R. Wood, Characterisations and examples of graph classes with bounded expansion, Technical Report, Cornell University, February 2009. arxiv:0902.3265.
147. S. Kreutzer, Algorithmic meta-theorems, in: IWPEC, 2008, pp. 10-12.
148. Dawar A., Grohe M., Kreutzer S. Locally excluding a minor. Proc. of the 21st IEEE Symposium on Logic in Computer Science 2007, 270-279. IEEE, New York.
149. Z. Dvorak, D. Král, Algorithms for classes of graphs with bounded expansion, in: WG, 2009, pp. 17-32.
150. M. Grohe, Algorithmic meta theorems, in: WG, 2008, p. 30.
151. M. Grohe, Logic, graphs, and algorithms, in: Logic and Automata, 2008, pp. 357-422.
152. Dvorak Z., Kral D., Thomas R. Deciding first-order properties for sparse graphs. Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science 2010, 133-142. IEEE Computer Society, Washington, DC, USA.
153. Robertson N., Seymour P.D. Graph minors. XX. Wagner's conjecture. J. Combin. Theory Ser. B 2004, 92(2):325-357.
154. Robertson N., Seymour P.D. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 1995, 63(1):65-110.
155. Fellows M.R., Langston M.A. On search, decision, and the efficiency of polynomial-time algorithms. J. Comput. System Sci. 1994, 49(3):769-779.
156. van Leeuwen J. Graph algorithms. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990, 525-631. Elsevier Science.
157. Friedman H., Robertson N., Seymour P. The metamathematics of the graph minor theorem. Contemp. Math. 1987, vol. 65:229-261. Amer. Math. Soc., Providence, RI.
158. Dinneen M.J., Lai R. Properties of vertex cover obstructions. Discrete Math. 2007, 307(21):2484-2500.
159. Dinneen M.J., Cattell K., Fellows M.R. Forbidden minors to graphs with small feedback sets. Discrete Math. 2001, 230(1-3):215-252. Paul Catlin memorial collection (Kalamazoo, MI, 1996).
160. Adler I., Grohe M., Kreutzer S. Computing excluded minors. Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2008, 641-650. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
161. Cattell K., Dinneen M.J., Downey R.G., Fellows M.R., Langston M.A. On computing graph minor obstruction sets. Theoret. Comput. Sci. 2000, 233:107-127.
162. I. Adler, Open problems related to computing obstruction sets, Manuscript, September 2008.
163. Robertson N., Seymour P.D. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 1995, 63(1):65-110.
164. Kawarabayashi K. The disjoint paths problem: algorithm and structure. Lecture Notes in Computer Science 2011, vol. 6552:2-7. Springer, Berlin, Heidelberg. N. Katoh, A. Kumar (Eds.).
165. Robertson N., Seymour P. Graph minors. XXI. Graphs with unique linkages. J. Combin. Theory Ser. B 2009, 99(3):583-616.
166. N. Robertson, P. Seymour, Graph minors. XXII. Irrelevant vertices in linkage problems, Preprint, 1992.
167. K. Kawarabayashi, P. Wollan, A shorter proof of the graph minor algorithm: the unique linkage theorem, in: STOC, 2010, pp. 687-694.
168. I. Adler, S.G. Kolliopoulos, P.K. Krause, D. Lokshtanov, S. Saurabh, D.M. Thilikos, Tight bounds for linkages in planar graphs, in: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, 2011.
169. A. Dawar, S. Kreutzer, Domination problems in nowhere-dense classes, in: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, 2009, pp. 157-168.
170. Golovach P.A., Kamiński M., Paulusma D., Thilikos D.M. Induced packing of odd cycles in a planar graph. Lecture Notes in Comput. Sci. 2009, vol. 5878:514-523. Springer, Berlin.
171. Kawarabayashi K., Kobayashi Y. The induced disjoint path problem. Lecture Notes in Comput. Sci. 2008, vol. 5035:47-61. Springer, Berlin.
172. Kawarabayashi K., Reed B. Odd cycle packing. Proceedings of the 42nd ACM Symposium on Theory of Computing 2010, 695-704. ACM, New York, NY, USA.
173. Kobayashi Y., Kawarabayashi K. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms 2009, 1146-1155. ACM, SIAM.
174. Alber J., Niedermeier R. Improved tree decomposition based algorithms for domination-like problems. Lecture Notes in Computer Science 2002, vol. 2286:221-233. Springer, Berlin, Heidelberg. S. Rajsbaum (Ed.).
175. Alber J., Dorn F., Niedermeier R. Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Appl. Math. 2005, 145(2):219-231. Structural decompositions, width parameters, and graph labelings.
176. Betzler N., Niedermeier R., Uhlmann J. Tree decompositions of graphs: saving memory in dynamic programming. Discrete Optim. 2006, 3(3):220-229. Graphs and combinatorial optimization.
177. Dorn F. Dynamic programming and fast matrix multiplication. Proceedings of the 14th Conference on Annual European Symposium-Volume 14 2006, 280-291. Springer-Verlag, London, UK.
178. J.M.M. van Rooij, H.L. Bodlaender, P. Rossmanith, Dynamic programming on tree decompositions using generalised fast subset convolution, in: ESA, 2009, pp. 566-577.
179. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, Fourier meets möbius: fast subset convolution, in: STOC, 2007, pp. 67-74.
180. Impagliazzo R., Paturi R. The complexity of k-SAT. COCO'99: Proc. of the Fourteenth Annual IEEE Conference on Computational Complexity 1999, 237. IEEE Computer Society, Washington, DC, USA.
181. D. Lokshtanov, D. Marx, S. Saurabh, Slightly superexponential parameterized problems, in: 22st ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 2011, pp. 760-776.
182. M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. van Rooij, J.O. Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, 2011. arxiv:1103.0534.
183. Dorn F., Penninkx E., Bodlaender H.L., Fomin F.V. Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica 2010, 58(3):790-810.
184. Seymour P.D., Thomas R. Call routing and the ratcatcher. Combinatorica 1994, 14(2):217-241.
185. Dorn F., Fomin F.V., Thilikos D.M. Fast subexponential algorithm for non-local problems on graphs of bounded genus. Lecture Notes in Computer Science 2006, 172-183. Springer, Berlin.
186. F. Dorn, F.V. Fomin, D.M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, in: Proc. of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 2008, pp. 631-640.
187. J. Rué, I. Sau, D.M. Thilikos, Dynamic programming for graphs on surfaces, in: ICALP, vol. 1, 2010, pp. 372-383.
188. Reed B., Smith K., Vetta A. Finding odd cycle transversals. Oper. Res. Lett. 2004, 32(4):299-301.
189. Hüffner F. Algorithm engineering for optimal graph bipartization. Lecture Notes in Computer Science 2005, vol. 3503:11-18. Springer, Berlin, Heidelberg. S.E. Nikoletseas (Ed.).
190. Dehne F.K.H.A., Fellows M.R., Langston M.A., Rosamond F.A., Stevens K. An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem. Lecture Notes in Computer Science 2005, vol. 3595:859-869. Springer, Berlin.
191. Razgon I., O'Sullivan B. Almost 2-sat is fixed-parameter tractable. J. Comput. System Sci. 2009, 75:435-450.
192. Hüffner F., Komusiewicz C., Moser H., Niedermeier R. Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 2010, 47:196-217.
193. Guo J., Moser H., Niedermeier R. Iterative compression for exactly solving NP-hard minimization problems. Lecture Notes in Computer Science 2009, vol. 5515:65-80. Springer, Berlin, Heidelberg. J. Lerner, D. Wagner, K. Zweig (Eds.).
194. Alon N., Yuster R., Zwick U. Color-coding. J. Assoc. Comput. Mach. 1995, 42(4):844-856.
195. Papadimitriou C., Yannakakis M. On limited nondeterminism and the complexity of the v-c dimension. J. Comput. System Sci. 1996, 53:161-170.
196. M.L. Fredman, J. Komlós, E. Szemerédi, Storing a sparse table with O(1) worst-case access time, in: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 165-169.
197. Slot C.F., van Emde Boas P. On tape versus core; an application of space efficient perfect hash functions to the invariance of space. Elektron. Infverarb. Kybern. 1985, 21(4-5):246-253.
198. Schmidt J.P., Siegel A. The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 1990, 19:775-786.
199. Naor M., Schulman L.J., Srinivasan A. Splitters and near-optimal derandomization. Proceedings of the 36th Annual Symposium on Foundations of Computer Science 1995, 182-191. IEEE Computer Society, Washington, DC, USA.
200. Chen J., Lu S., Sze S.-H., Zhang F. Improved algorithms for path, matching, and packing problems. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2007, 298-307. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
201. Fellows M.R., Knauer C., Nishimura N., Ragde P., Rosamond F., Stege U., Thilikos D.M., Whitesides S. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 2008, 52(2):167-176.
202. E.D. Demaine, M. Hajiaghayi, D. Marx, Minimizing movement: fixed-parameter tractability, in: ESA, 2009, pp. 718-729.
203. Misra N., Raman V., Saurabh S., Sikdar S. The budgeted unique coverage problem and color-coding. Lecture Notes in Computer Science 2009, vol. 5675:310-321. Springer, Berlin, Heidelberg. A. Frid, A. Morozov, A. Rybalchenko, K. Wagner (Eds.).
204. Betzler N., Fellows M., Komusiewicz C., Niedermeier R. Parameterized algorithms and hardness results for some graph motif problems. Lecture Notes in Computer Science 2008, vol. 5029:31-43. Springer, Berlin, Heidelberg. P. Ferragina, G. Landau (Eds.).
205. Liu Y., Lu S., Chen J., Sze S.-H. Greedy localization and color-coding: improved matching and packing algorithms. Lecture Notes in Computer Science 2006, vol. 4169:84-95. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
206. Hüffner F., Wernicke S., Zichner T. Algorithm engineering for color-coding with applications to signaling pathway detection. Algorithmica 2008, 52:114-132.
207. Shlomi T., Segal D., Ruppin E., Sharan R. Qpath: a method for querying pathways in a protein-protein interaction network. BMC Bioinform. 2006, 133-144.
208. Scott J., Ideker T., Karp R.M., Sharan R. Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 2006, 13(2):133-144.
209. Alon N., Yuster R., Zwick U. Color coding. Encyclopedia of Algorithms 2008, Springer.
210. F.V. Fomin, D. Lokshtanov, V. Raman, S. Saurabh, Fast local search algorithm for weighted feedback arc set in tournaments, in: AAAI, 2010.
211. Alon N., Lokshtanov D., Saurabh S. Fast FAST. Lecture Notes in Computer Science 2009, vol. 5555:49-58. Springer, Berlin, Heidelberg. S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, W. Thomas (Eds.).
212. Chen J., Kanj I., Perkovic L., Sedgwick E., Xia G. Genus charactterizes the complexity of graph problems: some tight results. Lecture Notes in Computer Science 2003, vol. 2719. Springer Verlag.
213. Alber J., Bodlaender H.L., Fernau H., Niedermeier R. Fixed parameter algorithms for planar dominating set and related problems. 6th Scandinavian Workshop on Algorithm Theory 2000, 97-110. Springer, Berlin.
214. Demaine E.D., Fomin F.V., Hajiaghayi M., Thilikos D.M. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Trans. Algorithms 2005, 1(1):33-47.
215. Fernau H. Graph separator algorithms: A refined analysis. Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '02) 2002, 186-197. Springer-Verlag, London, UK. L. Kucera (Ed.).
216. Fernau H., Juedes D. A geometric approach to parameterized algorithms for domination problems on planar graphs. Lecture Notes in Comput. Sci. 2004, vol. 3153:488-499. Springer, Berlin.
217. Kanj I., Perković L. Improved parameterized algorithms for planar dominating set. Lecture Notes in Computer Science 2002, vol. 2420:399-410. Springer, Berlin.
218. Demaine E.D., Hajiaghayi M., Thilikos D.M. Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors. Algorithmica 2005, 41:245-267.
219. Demaine E.D., Fomin F.V., Hajiaghayi M., Thilikos D.M. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. Assoc. Comput. Mach. 2005, 52(6):866-893.
220. Gu Q.-P., Tamaki H. Improved bounds on the planar branchwidth with respect to the largest grid minor size. Lecture Notes in Computer Science 2010, vol. 6507:85-96. Springer, Berlin, Heidelberg. O. Cheong, K.-Y. Chwa, K. Park (Eds.).
221. Robertson N., Seymour P., Thomas R. Quickly excluding a planar graph. J. Combin. Theory Ser. B 1994, 62(2):323-348.
222. Gu Q.-P., Tamaki H. Optimal branch decomposition of planar graphs in O(n3) time. ACM Trans. Algorithms 2008, 4(3):1-13. Article No. 30.
223. F. Dorn, Designing subexponential algorithms: problems, techniques and structures, Ph.D. Thesis, University of Bergen, July 2007.
224. Demaine E.D., Hajiaghayi M., Thilikos D.M. The bidimensional theory of bounded-genus graphs. SIAM J. Discrete Math. 2006, 20(2):357-371.
225. F.V. Fomin, P. Golovach, D.M. Thilikos, Contraction bidimensionality: the accurate picture, 2009.
226. Demaine E.D., Hajiaghayi M. Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 2008, 28(1):19-36.
227. Demaine E.D., Fomin F.V., Hajiaghayi M., Thilikos D.M. Bidimensional parameters and local treewidth. SIAM J. Discrete Math. 2005, 18(3):501-511.
228. Dorn F., Fomin F.V., Thilikos D.M. Subexponential parameterized algorithms. Comput. Sci. Rev. 2008, 2(1):29-39.
229. Demaine E., Hajiaghayi M. The bidimensionality theory and its algorithmic applications. Comput. J. 2007, 51(3):292-302.
230. Demaine E.D., Hajiaghayi M. Bidimensionality. Encyclopedia of Algorithms 2008, Springer.
231. Sau I., Thilikos D.M. Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms 2010, 8(3):330-338. 9.
232. Demaine E.D., Hajiaghayi M. Bidimensionality: new connections between FPT algorithms and PTASs. Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms 2005, 590-601. ACM, SIAM, New York.
233. Fomin F.V., Lokshtanov D., Saurabh S., Thilikos D.M. Bidimensionality and kernels. Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms 2010, 503-510. SIAM. M. Charikar (Ed.).
234. F.V. Fomin, D. Lokshtanov, V. Raman, S. Saurabh, Bidimensionality and EPTAS, in: 22st ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 2011.
235. Dorn F., Fomin F.V., Lokshtanov D., Raman V., Saurabh S. Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. LIPIcs 2010, vol. 5:251-262. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
236. F.V. Fomin, Y. Villanger, Subexponential parameterized algorithm for minimum fill-in, CoRR, 2011. arxiv:1104.2230.
237. S. Tazari, Faster approximation schemes and parameterized algorithms on -minor-free and odd-minor-free graphs, in: MFCS, 2010, pp. 641-652.
238. Thilikos D.M. Fast sub-exponential algorithms and compactness in planar graphs. Lecture Notes in Computer Science 2011, Springer.
239. F.K.H.A. Dehne, M.R. Fellows, H. Fernau, E. Prieto, F.A. Rosamond, Nonblocker: parameterized algorithmics for minimum dominating set, in: SOFSEM, 2006, pp. 237-245.
240. Chen J., Fernau H., Kanj I.A., Xia G. Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 2007, 37(4):1077-1106.
241. Prieto E., Sloper C. Looking at the stars. Lecture Notes in Computer Science 2004, vol. 3162:138-148. Springer, Berlin, Heidelberg. R. Downey, M. Fellows, F. Dehne (Eds.).
242. Mathieson L., Prieto E., Shaw P. Packing edge disjoint triangles: a parameterized view. Lecture Notes in Computer Science 2004, vol. 3162:127-137. Springer, Berlin, Heidelberg. R. Downey, M. Fellows, F. Dehne (Eds.).
243. Abu-Khzam F. A quadratic kernel for 3-set packing. Lecture Notes in Computer Science 2009, vol. 5532:81-87. Springer, Berlin, Heidelberg. J. Chen, S. Cooper (Eds.).
244. Chlebíková J. The structure of obstructions to treewidth and pathwidth. Discrete Appl. Math. 2002, 120(1-3):61-71.
245. Burrage K., Estivill-Castro V., Fellows M., Langston M., Mac S., Rosamond F. The undirected feedback vertex set problem has a poly(k) kernel. Lecture Notes in Computer Science 2006, vol. 4169:192-202. Springer, Berlin, Heidelberg. H. Bodlaender, M. Langston (Eds.).
246. Bodlaender H. A cubic kernel for feedback vertex set. Lecture Notes in Computer Science 2007, vol. 4393:320-331. Springer, Berlin, Heidelberg. W. Thomas, P. Weil (Eds.).
247. Thomassé S. A quadratic kernel for feedback vertex set. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms 2009, 115-119. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
248. Fomin F.V., Lokshtanov D., Misra N., Philip G., Saurabh S. Hitting forbidden minors: approximation and kernelization. Leibniz International Proceedings in Informatics (LIPIcs) 2011, vol. 9:189-200. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. T. Schwentick, C. Dürr (Eds.).
249. P. Lemke, The maximum leaf spanning tree problem for cubic graphs is NP-complete, Institute for Mathematics and its Applications, Preprint, 1998.
250. Kleitman D.J., West D.B. Spanning trees with many leaves. SIAM J. Discrete Math. 1991, 4:99-106.
251. V. Estivill-Castro, M.R. Fellows, M.A. Langston, F.A. Rosamond, FPT is p-time extremal structure I, in: ACiD, 2005, pp. 1-41.
252. Alber J., Fellows M.R., Niedermeier R. Polynomial-time data reduction for dominating set. J. Assoc. Comput. Mach. 2004, 51(3):363-384.
253. Guo J., Niedermeier R. Linear problem kernels for NP-hard problems on planar graphs. Lecture Notes in Comput. Sci. 2007, vol. 4596:375-386. Springer, Berlin.
254. H. Bodlaender, F. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, D. Thilikos, (Meta) kernelization, in: Proc. of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, 2009.
255. Bodlaender H.L., van Antwerpen-de Fluiter B. Reduction algorithms for graphs of small treewidth. Inform. Comput. 2001, 167:86-119.
256. G. Gutin, L. van Iersel, M. Mnich, A. Yeo, Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables, Journal of Computer and System Sciences, Available online 9 February 2011.
257. Crowston R., Gutin G., Jones M., Kim E., Ruzsa I. Systems of linear equations over F and problems parameterized above average. Lecture Notes in Computer Science 2010, vol. 6139:164-175. Springer, Berlin, Heidelberg. H. Kaplan (Ed.).
258. N. Alon, S. Gutner, Kernels for the dominating set problem on graphs with an excluded minor, Technical Report, ECCC, 2008.
259. Philip G., Raman V., Sikdar S. Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels. Lecture Notes in Computer Science 2009, vol. 5757:694-705. Springer.
260. Alon N., Gutin G., Kim E.J., Szeider S., Yeo A. Solving MAX-r-SAT above a tight lower bound. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms 2010, 511-517. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
261. Gutin G., Kim E., Szeider S., Yeo A. A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. System Sci. 2011, 77:422-429.
262. Kratsch S., Marx D., Wahlström M. Parameterized complexity and kernelizability of max ones and exact ones problems. Proceedings of the 35th International Conference on Mathematical Foundations of Computer Science 2010, 489-500. Springer-Verlag, Berlin, Heidelberg.
263. Cygan M., Pilipczuk M., Pilipczuk M., Wojtaszczyk J.O. Kernelization hardness of connectivity problems in d-degenerate graphs. Proceedings of the 36th International Conference on Graph-Theoretic Concepts in Computer Science 2010, 147-158. Springer-Verlag, Berlin, Heidelberg.
264. Bodlaender H.L., Jansen B.M.P., Kratsch S. Cross-composition: a new technique for kernelization lower bounds. Leibniz International Proceedings in Informatics (LIPIcs) 2011, vol. 9:165-176. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. T. Schwentick, C. Dürr (Eds.).
265. H.L. Bodlaender, B.M.P. Jansen, S. Kratsch, Preprocessing for treewidth: a combinatorial analysis through kernelization, in: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2009, 2011.
266. D. Hermelin, C.-C. Huang, S. Kratsch, M. Wahlström, Parameterized two-player Nash equilibrium, in: Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, Lecture Notes in Computer Science, Springer (2011) (in press).
267. B.M.P. Jansen, H.L. Bodlaender, Vertex cover kernelization revisited: upper and lower bounds for a refined parameter, in: STACS, 2011, pp. 177-188.
268. Díaz J., Serna M.J., Thilikos D.M. Efficient algorithms for counting parameterized list h-colorings. J. Comput. System Sci. 2008, 74(5):919-937.
269. N. Nishimura, P. Ragde, D.M. Thilikos, Parameterized counting algorithms for general graph covering problems, in: WADS, 2005, pp. 99-109.
270. Thurley M. Kernelizations for parameterized counting problems. Proceedings of the 4th International Conference on Theory and Applications of Models of Computation 2007, 705-714. Springer-Verlag, Berlin, Heidelberg.
271. Demaine E.D., Hajiaghayi M., Marx D. 09511 abstracts collection-parameterized complexity and approximation algorithms. Dagstuhl Seminar Proceedings 2010, vol. 09511. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, Germany. E.D. Demaine, M. Hajiaghayi, D. Marx (Eds.).
272. Downey R.G., Fellows M.R., McCartin C., Rosamond F. Parameterized approximation of dominating set problems. Inform. Process. Lett. 2008, 109(1):68-70.
273. Jansen K. Parameterized approximation scheme for the multiple knapsack problem. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms 2009, 665-674. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
274. Marx D., Razgon I. Constant ratio fixed-parameter approximation of the edge multicut problem. Inform. Process. Lett. 2009, 109:1161-1166.
275. Cesati M., Ianni M.D. Parameterized parallel complexity. Proceedings of the 4th International Euro-Par Conference on Parallel Processing 1998, 892-896. Springer-Verlag, London, UK.
276. D. Marx, I. Razgon, Fixed-parameter tractability of multicut parameterized by the size of the cutset, in: STOC, 2011, pp. 469-478.
277. N. Bousquet, J. Daligault, S. Thomassé, Multicut is FPT, in: STOC, 2011, pp. 459-468.
278. Downey R.G., Fellows M.R. Fundamentals of Parameterized Complexity. Undegraduate Texts in Computer Science 2012, Springer-Verlag.
279. Fellows M.R., Langston M.A. Nonconstructive tools for proving polynomial-time decidability. J. Assoc. Comput. Mach. 1988, 35(3):727-739.
280. M.R. Fellows, M.A. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterisations (extended abstract), in: Proc. of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1989, 1989, pp. 520-525.