Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics

Volumn 34, Issue 3, 2013, Pages 541-566

  Fellows, Michael R ^a   Jansen, Bart M P ^b   Rosamond, Frances ^a  

^a CHARLES DARWIN UNIVERSITY   (Australia)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84865955573     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2012.04.008     Document Type: Article

References (119)

1. Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H., Crown structures for vertex cover kernelization. Theory Comput. Syst. 41:3 (2007), 411–430, 10.1007/s00224-007-1328-0.
2. Alber, J., Fellows, M.R., Niedermeier, R., Polynomial-time data reduction for dominating set. J. ACM 51:3 (2004), 363–384, 10.1145/990308.990309.
3. Arnborg, S., Lagergren, J., Seese, D., Easy problems for tree-decomposable graphs. J. Algorithms 12:2 (1991), 308–340, 10.1016/0196-6774(91)90006-K.
4. Bar-Yehuda, R., Even, S., A local-ratio theorem for approximating the weighted vertex cover problem. Analysis and Design of Algorithms for Combinatorial Problems, 109, 1985, 27–45, 10.1016/S0304-0208(08)73101-3.
5. Böcker, S., Briesemeister, S., Bui, Q.B.A., Truß, A., Going weighted: parameterized algorithms for cluster editing. Theoret. Comput. Sci. 410:52 (2009), 5467–5480, 10.1016/j.tcs.2009.05.006.
6. N. Betzler, S. Hemmann, R. Niedermeier, A multivariate complexity analysis of determining possible winners given incomplete votes, in: Proc. 21st IJCAI, 2009, pp. 53–58.
7. H.L. Bodlaender, Kernelization: new upper and lower bound techniques, in: Proc. 4th IWPEC, 2009, pp. 17–37. http://dx.doi.org/10.1007/978-3-642-11269-0_2.
8. Bodlaender, H.L., A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:6 (1996), 1305–1317, 10.1145/167088.167161.
9. Bodlaender, H.L., A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209:1–2 (1998), 1–45, 10.1016/S0304-3975(97)00228-4.
10. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D., On problems without polynomial kernels. J. Comput. System Sci. 75:8 (2009), 423–434, 10.1016/j.jcss.2009.04.001.
11. Bodlaender, H.L., Fellows, M.R., Hallett, M.T., Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy. Proc. 26th STOC, 1994, ACM, 449–458, 10.1145/195058.195229.
12. H.L. Bodlaender, F.V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, D.M. Thilikos, (Meta) kernelization, in: Proc. 50th FOCS, 2009, pp. 629–638. http://dx.doi.org/10.1109/FOCS.2009.46.
13. H.L. Bodlaender, B.M.P. Jansen, S. Kratsch, Preprocessing for treewidth: a combinatorial analysis through kernelization, in: Proc. 38th ICALP, 2011, pp. 437–448. http://dx.doi.org/10.1007/978-3-642-22006-7_37.
14. H.L. Bodlaender, B.M.P. Jansen, S. Kratsch, Kernel bounds for path and cycle problems, in: Proc. 6th IPEC, 2011, pp. 145–158. http://dx.doi.org/10.1007/978-3-642-28050-4_12.
15. H.L. Bodlaender, B.M.P. Jansen, S. Kratsch, Cross-composition: a new technique for kernelization lower bounds, in: Proc. 28th STACS, pp. 165–176, 2011. http://dx.doi.org/10.4230/LIPIcs.STACS.2011.165.
16. Bodlaender, H.L., Koster, A.M.C.A., Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51:3 (2008), 255–269, 10.1093/comjnl/bxm037.
17. Bodlaender, H.L., van Antwerpen-de Fluiter, B., Reduction algorithms for graphs of small treewidth. Inform. and Comput. 167:2 (2001), 86–119, 10.1006/inco.2000.2958.
18. Brandstädt, A., Le, V.B., Spinrad, J.P., Graph Classes: A Survey. 1999, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
19. Buss, J.F., Goldsmith, J., Nondeterminism within P. SIAM J. Comput. 22:3 (1993), 560–572, 10.1137/0222038.
20. Cai, L., Parameterized complexity of vertex colouring. Discrete Appl. Math. 127:3 (2003), 415–429, 10.1016/S0166-218X(02)00242-1.
21. Cai, L., Juedes, D.W., On the existence of subexponential parameterized algorithms. J. Comput. System Sci. 67:4 (2003), 789–807, 10.1016/S0022-0000(03)00074-6.
22. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G., Tight lower bounds for certain parameterized NP-hard problems. Inform. and Comput. 201:2 (2005), 216–231, 10.1016/j.ic.2005.05.001.
23. Chen, J., Feng, Q., Liu, Y., Lu, S., Wang, J., Improved deterministic algorithms for weighted matching and packing problems. Theoret. Comput. Sci. 412:23 (2011), 2503–2512, 10.1016/j.tcs.2010.10.042.
24. Chen, J., Fernau, H., Kanj, I.A., Xia, G., Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37:4 (2007), 1077–1106, 10.1137/050646354.
25. Chen, J., Kanj, I.A., Jia, W., Vertex cover: further observations and further improvements. J. Algorithms 41:2 (2001), 280–301, 10.1006/jagm.2001.1186.
26. Chen, J., Kanj, I.A., Xia, G., Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411:40–42 (2010), 3736–3756, 10.1016/j.tcs.2010.06.026.
27. Chlebík, M., Chlebíková, J., Crown reductions for the minimum weighted vertex cover problem. Discrete Appl. Math. 156:3 (2008), 292–312, 10.1016/j.dam.2007.03.026.
28. 2) steps, in: Proc. 30th WG, 2004, pp. 257–269. http://dx.doi.org/10.1007/978-3-540-30559-0_22.
29. Chung, F.R.K., On the cutwidth and topological bandwidth of a tree. SIAM J. Algebr. Discrete Methods 6 (1985), 268–277, 10.1137/0606026.
30. Chung, F.R.K., Seymour, P.D., Graphs with small bandwidth and cutwidth. Discrete Math. 75:1–3 (1989), 113–119, 10.1016/0012-365X(89)90083-6.
31. Courcelle, B., The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inform. and Comput. 85:1 (1990), 12–75, 10.1016/0890-5401(90)90043-H.
32. Courcelle, B., Makowsky, J.A., Rotics, U., Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33:2 (2000), 125–150, 10.1007/s002249910009.
33. Crescenzi, P., Silvestri, R., Trevisan, L., On weighted vs. unweighted versions of combinatorial optimization problems. Inform. and Comput. 167:1 (2001), 10–26, 10.1006/inco.2000.3011.
34. M. Cygan, D. Lokshtanov, M. Pilipczuk, M. Pilipczuk, S. Saurabh, On the hardness of losing width, in: Proc. 6th IPEC, 2011, pp. 159–168. http://dx.doi.org/10.1007/978-3-642-28050-4_13.
35. M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J.M.M. van Rooij, J.O. Wojtaszczyk, Solving connectivity problems parameterized by treewidth in single exponential time, in: Proc. 52nd FOCS, 2011, pp. 150–159. http://dx.doi.org/10.1109/FOCS.2011.23.
36. M. Cygan, M. Pilipczuk, M. Pilipczuk, On group feedback vertex set parameterized by the size of the cutset, CoRR, abs/1112.6255, 2011.
37. M. Cygan, M. Pilipczuk, M. Pilipczuk, J.O. Wojtaszczyk, On multiway cut parameterized above lower bounds, in: Proc. 6th IPEC, 2011, pp. 1–12. http://dx.doi.org/10.1007/978-3-642-28050-4_1.
38. B. de Fluiter, Algorithms for graphs of small treewidth, Ph.D. Thesis, Utrecht University, 1997. URL: http://igitur-archive.library.uu.nl/dissertations/01847381/inhoud.htm.
39. E. DeLaViña, B. Waller, A note on a conjecture of Hansen et al. Manuscript. URL: http://cms.dt.uh.edu/faculty/delavinae/research/DelavinaWaller2009.pdf.
40. H. Dell, D. van Melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, in: Proc. 42nd STOC, 2010, pp. 251–260. http://dx.doi.org/10.1145/1806689.1806725.
41. M. Dom, D. Lokshtanov, S. Saurabh, Incompressibility through colors and IDs, in: Proc. 36th ICALP, 2009, pp. 378–389. http://dx.doi.org/10.1007/978-3-642-02927-1_32.
42. Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A., Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electron. Notes Theor. Comput. Sci. 78 (2003), 209–222, 10.1016/S1571-0661(04)81014-4.
43. Downey, R., Fellows, M.R., Parameterized Complexity Monographs in Computer Science, 1999, Springer, New York.
44. R. Downey, M. Fellows, B. Kapron, M. Hallett, H. Wareham, The parameterized complexity of some problems in logic and linguistics, in: Proc. 3rd LFCS, 1994, pp. 89–100. http://dx.doi.org/10.1007/3-540-58140-5_10.
45. Downey, R.G., Fellows, M.R., Langston, M.A., (eds.) The Computer Journal: Special Issue on Parameterized Complexity, Volume 51, 2008, 10.1093/comjnl/bxm111.
46. Downey, R.G., Fellows, M.R., Stege, U., Parameterized complexity: a framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, 1999, AMS and DIMACS, 49–99.
47. Downey, R.G., Thilikos, D.M., Confronting intractability via parameters. Comput. Sci. Rev. 5:4 (2011), 279–317, 10.1016/j.cosrev.2011.09.002.
48. Eisenbrand, F., Grandoni, F., On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326:1–3 (2004), 57–67, 10.1016/j.tcs.2004.05.009.
49. V. Estivill-Castro, M. Fellows, M. Langston, F. Rosamond, FPT is P-time extremal structure I, in: Proc. 1st ACiD, 2005, pp. 1–41.
50. 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. and Comput. 209:2 (2011), 143–153, 10.1016/j.ic.2010.11.026.
51. M.R. Fellows, D. Hermelin, F.A. Rosamond, Well-quasi-orders in subclasses of bounded treewidth graphs, in: Proc. 4th IWPEC, 2009, pp. 149–160. http://dx.doi.org/10.1007/978-3-642-11269-0_12.
52. M.R. Fellows, M.A. Langston, Fast self-reduction algorithms for combinatorical problems of VLSI-design, in: Proc. 3rd AWOC, 1988, pp. 278–287. http://dx.doi.org/10.1007/BFb0040395.
53. Fellows, M.R., Langston, M.A., On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discrete Math. 5:1 (1992), 117–126, 10.1137/0405010.
54. Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S., The complexity ecology of parameters: an illustration using bounded max leaf number. Theory Comput. Syst. 45:4 (2009), 822–848, 10.1007/s00224-009-9167-9.
55. M.R. Fellows, D. Lokshtanov, N. Misra, F.A. Rosamond, S. Saurabh, Graph layout problems parameterized by vertex cover, in: Proc. 19th ISAAC, 2008, pp. 294–305. http://dx.doi.org/10.1007/978-3-540-92182-0_28.
56. M. Fellows, F. Rosamond, A. Slinko, Sensing God's will is fixed parameter tractable, Technical Report, ResearchSpace@Auckland 561, 2008. URL: http://hdl.handle.net/2292/5089.
57. 2-packing: weighted versions, in: Proc. 17th COCOON, 2011, pp. 343–353. http://dx.doi.org/10.1007/978-3-642-22685-4_31.
58. Fiala, J., Golovach, P.A., Kratochvíl, J., Parameterized complexity of coloring problems: treewidth versus vertex cover. Theoret. Comput. Sci. 412:23 (2011), 2513–2523, 10.1016/j.tcs.2010.10.043.
59. Flum, J., Grohe, M., Parameterized Complexity Theory. 2006, Springer-Verlag New York, Inc.
60. F.V. Fomin, S. Gaspers, P.A. Golovach, K. Suchan, S. Szeider, E.J. van Leeuwen, M. Vatshelle, Y. Villanger, k-gap interval graphs, in: Proc. 10th LATIN, 2012, pp. 350–361. http://dx.doi.org/10.1007/978-3-642-29344-3_30.
61. F.V. Fomin, D. Lokshtanov, N. Misra, G. Philip, S. Saurabh, Hitting forbidden minors: approximation and kernelization, in: Proc. 28th STACS, pp. 189–200, 2011. http://dx.doi.org/10.4230/LIPIcs.STACS.2011.189.
62. F.V. Fomin, D. Lokshtanov, V. Raman, S. Saurabh, Bidimensionality and EPTAS, in: Proc. 22nd SODA, 2011, pp. 748–759. URL: http://arxiv.org/abs/1005.5449.
63. F. Fomin, D. Lokshtanov, S. Saurabh, D.M. Thilikos, Bidimensionality and kernels, in: Proc. 21st SODA, 2010, pp. 503–510.
64. Frank, A., Tardos, E., An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7 (1987), 49–65, 10.1007/BF02579200.
65. Frick, M., Grohe, M., The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130:1–3 (2004), 3–31, 10.1016/j.apal.2004.01.007.
66. R. Ganian, Twin-cover: beyond vertex cover in parameterized algorithmics, in: Proc. 6th IPEC, 2011, pp. 259–271. http://dx.doi.org/10.1007/978-3-642-28050-4_21.
67. Garey, M.R., Johnson, D.S., Computers and Intractability, A Guide to the Theory of NP-Completeness. 1979, W.H. Freeman and Company, New York.
68. M. Grohe, K. Kawarabayashi, D. Marx, P. Wollan, Finding topological subgraphs is fixed-parameter tractable, in: Proc. 43rd STOC, 2011, pp. 479–488. http://dx.doi.org/10.1145/1993636.1993700.
69. Grötschel, M., Lovász, L., Schrijver, A., Geometric Algorithms and Combinatorial Optimization Algorithms and Combinatorics, vol. 2, 1988, Springer.
70. Guo, J., Niedermeier, R., Invitation to data reduction and problem kernelization. SIGACT News 38:1 (2007), 31–45, 10.1145/1233481.1233493.
71. Gutin, G., Kim, E.J., Lampis, M., Mitsou, V., Vertex cover problem parameterized above and below tight bounds. Theory Comput. Syst. 48:2 (2011), 402–410, 10.1007/s00224-010-9262-y.
72. Harary, F., Graph Theory Addison-Wesley Series in Mathematics, 1994, Perseus Books.
73. P. Heggernes, P. van ’t Hof, B.M.P. Jansen, S. Kratsch, Y. Villanger, Parameterized complexity of vertex deletion into perfect graph classes, in: Proc. 18th FCT, 2011, pp. 240–251. http://dx.doi.org/10.1007/978-3-642-22953-4_21.
74. Henglein, F., Mairson, H.G., The complexity of type inference for higher-order typed lambda calculi. J. Funct. Programming 4:4 (1994), 435–477, 10.1017/S0956796800001143.
75. Impagliazzo, R., Paturi, R., Zane, F., Which problems have strongly exponential complexity?. J. Comput. System Sci. 63:4 (2001), 512–530, 10.1006/jcss.2001.1774.
76. B. Jansen, Kernelization for maximum leaf spanning tree with positive vertex weights, in: Proc. 7th CIAC, 2010, pp. 192–203. http://dx.doi.org/10.1007/978-3-642-13073-1_18.
77. B.M.P. Jansen, H.L. Bodlaender, Vertex cover kernelization revisited: upper and lower bounds for a refined parameter, in: Proc. 28th STACS, 2011, pp. 177–188. http://dx.doi.org/10.4230/LIPIcs.STACS.2011.177.
78. B.M.P. Jansen, S. Kratsch, Data reduction for graph coloring problems, in: Proc. 18th FCT, 2011, pp. 90–101. http://dx.doi.org/10.1007/978-3-642-22953-4_8.
79. B.M.P. Jansen, S. Kratsch, On polynomial kernels for structural parameterizations of odd cycle transversal, in: Proc. 6th IPEC, 2011, pp. 132–144. http://dx.doi.org/10.1007/978-3-642-28050-4_11.
80. B.M.P. Jansen, S. Kratsch, On polynomial kernels for structural parameterizations of odd cycle transversal, CoRR, abs/1107.3658, 2011. URL: http://arxiv.org/abs/1107.3658.
81. Kannan, R., Minkowski's convex body theorem and integer programming. Math. Oper. Res. 12 (1987), 415–440, 10.1287/moor.12.3.415.
82. K. Kawarabayashi, B. Mohar, B.A. Reed, A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width, in: Proc. 49th FOCS, 2008, pp. 771–780. http://dx.doi.org/10.1109/FOCS.2008.53.
83. Khuller, S., Algorithms column: the vertex cover problem. SIGACT News 33:2 (2002), 31–33, 10.1145/564585.564598.
84. Kleitman, D.J., West, D.B., Spanning trees with many leaves. SIAM J. Discrete Math. 4:1 (1991), 99–106, 10.1137/0404010.
85. Komusiewicz, C., Niedermeier, R., Uhlmann, J., Deconstructing intractability—a multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9:1 (2011), 137–151, 10.1016/j.jda.2010.07.003.
86. S. Kratsch, M. Wahlström, Representative sets and irrelevant vertices: new tools for kernelization, in: Proc. 53rd FOCS, 2012 (in press). URL: http://arxiv.org/abs/1111.2195.
87. Lampis, M., Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64:1 (2012), 19–37, 10.1007/s00453-011-9554-x.
88. Lampis, M., A kernel of order 2k−clogk for vertex cover. Inform. Process. Lett. 111:23–24 (2011), 1089–1091, 10.1016/j.ipl.2011.09.003.
89. O. Lichtenstein, A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, in: Proc. 12th POPL, 1985, pp. 97–107. http://dx.doi.org/10.1145/318593.318622.
90. Marx, D., Parameterized complexity and approximation algorithms. Comput. J. 51:1 (2008), 60–78, 10.1093/comjnl/bxm048.
91. Marx, D., Parameterized coloring problems on chordal graphs. Theoret. Comput. Sci. 351:3 (2006), 407–424, 10.1016/j.tcs.2005.10.008.
92. D. Marx, B. O'Sullivan, I. Razgon, Finding small separators in linear time via treewidth reduction, CoRR, abs/1110.4765, 2011. URL: http://arxiv.org/abs/1110.4765.
93. S. Mishra, V. Raman, S. Saurabh, S. Sikdar, König deletion sets and vertex covers above the matching size, in: Proc. 19th ISAAC, 2008, pp. 836–847. http://dx.doi.org/10.1007/978-3-540-92182-0_73.
94. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R., The complexity of König subgraph problems and above-guarantee vertex cover. Algorithmica 61:4 (2011), 857–881, 10.1007/s00453-010-9412-2.
95. S. Mishra, V. Raman, S. Saurabh, S. Sikdar, C.R. Subramanian, The complexity of finding subgraphs whose matching number equals the vertex cover number, in: Proc. 18th ISAAC, 2007, pp. 268–279. http://dx.doi.org/10.1007/978-3-540-77120-3_25.
96. Nemhauser, G., Trotter, L., Vertex packings: structural properties and algorithms. Math. Program. 8 (1975), 232–248, 10.1007/BF01580444.
97. Nešetřil, J., Poljak, S., On the complexity of the subgraph problem. Comment. Math. Univ. Carolin. 26:2 (1985), 415–419 URL: http://dml.cz/dmlcz/106381.
98. Nichterlein, A., Dom, M., Niedermeier, R., Aspects of a multivariate complexity analysis for rectangle tiling. Oper. Res. Lett. 39:5 (2011), 346–351, 10.1016/j.orl.2011.06.001.
99. Niedermeier, R., Invitation to Fixed-Parameter Algorithms. 2006, Oxford University Press.
100. R. Niedermeier, Reflections on multivariate algorithmics and problem parameterization, in: Proc. 27th STACS, 2010, pp. 17–32. http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2495.
101. Niedermeier, R., Rossmanith, P., On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47:2 (2003), 63–77, 10.1016/S0196-6774(03)00005-1.
102. Perkovic, L., Reed, B.A., An improved algorithm for finding tree decompositions of small width. Internat. J. Found Comput. Sci. 11:3 (2000), 365–371.
103. M. Pilipczuk, Problems parameterized by treewidth tractable in single exponential time: a logical approach, in: Proc. 36th MFCS, 2011, pp. 520–531. http://dx.doi.org/10.1007/978-3-642-22993-0_47.
104. V. Raman, M.S. Ramanujan, S. Saurabh, Paths, flowers and vertex cover, in: Proc. 19th ESA, 2011, pp. 382–393. http://dx.doi.org/10.1007/978-3-642-23719-5_33.
105. Razgon, I., O'Sullivan, B., Almost 2-SAT is fixed-parameter tractable. J. Comput. System Sci. 75:8 (2009), 435–450, 10.1016/j.jcss.2009.04.002.
106. Robertson, N., Seymour, P., Graph Minors: A Survey Surveys in Combinatorics, 1985, Cambridge University Press, 153–171.
107. Robertson, N., Seymour, P.D., Graph minors. XX. Wagner's conjecture. J. Combin. Theory Ser. B 92:2 (2004), 325–357, 10.1016/j.jctb.2004.08.001.
108. R. Sasák, Comparing 17 graph parameters, Master's Thesis, University of Bergen, 2010. URL: http://hdl.handle.net/1956/4329.
109. Schrijver, A., Combinatorial Optimization. Polyhedra and Efficiency. 2003, Springer, Berlin.
110. Seymour, P.D., Thomas, R., Call routing and the ratcatcher. Combinatorica 14:2 (1994), 217–241, 10.1007/BF01215352.
111. Soleimanfallah, A., Yeo, A., A kernel of order 2k−c for vertex cover. Discrete Math. 311:10–11 (2011), 892–895, 10.1016/j.disc.2011.02.014.
112. Szeider, S., Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12 (2011), 1–21, 10.1145/1877714.1877718.
113. Szeider, S., Not so easy problems for tree decomposable graphs. Selected and Revised Papers of ICDM 2008 India RMS Lecture Notes Series, vol. 13, 2010, Ramanujan Mathematical Society, 179–190 URL: http://arxiv.org/abs/1107.1177.
114. J. Uhlmann, M. Weller, Two-layer planarization parameterized by feedback edge set, in: Proc. 7th TAMC, 2010, pp. 431–442. http://dx.doi.org/10.1007/978-3-642-13562-0_39.
115. J.M.M. van Rooij, H.L. Bodlaender, P. Rossmanith, Dynamic programming on tree decompositions using generalised fast subset convolution, in: Proc. 17th ESA, 2009, pp. 566–577. http://dx.doi.org/10.1007/978-3-642-04128-0_51.
116. Parameterized complexity wiki: table of FPT races. URL: http://fpt.wikidot.com/fpt-races.
117. R. Williams, Improving exhaustive search implies superpolynomial lower bounds, in: Proc. 42nd STOC, 2010, pp. 231–240.
118. Wilson, R., Graphs, Colourings and the Four-Colour Theorem. 2002, Oxford Science Publications.
119. Yap, C.-K., Some consequences of non-uniform conditions on uniform classes. Theoret. Comput. Sci. 26 (1983), 287–300, 10.1016/0304-3975(83)90020-8.