{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T17:25:13Z","timestamp":1784568313585,"version":"3.55.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T00:00:00Z","timestamp":1233187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00224-009-9167-9","type":"journal-article","created":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T20:44:41Z","timestamp":1233175481000},"page":"822-848","source":"Crossref","is-referenced-by-count":51,"title":["The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number"],"prefix":"10.1007","volume":"45","author":[{"given":"Michael","family":"Fellows","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,1,29]]},"reference":[{"key":"9167_CR1","series-title":"Proc. Applied Mathematics","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"F.N. Abu-Khzam","year":"2004","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, January 2004. Proc. Applied Mathematics, vol. 115, ACM\/SIAM, New York (2004)"},{"key":"9167_CR2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. J. ACM 51, 363\u2013384 (2004)","journal-title":"J. ACM"},{"key":"9167_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/3-540-45995-2_52","volume-title":"Proceedings of the 5th Latin American Theoretical IN-formatics (LATIN 2002)","author":"J. Alber","year":"2002","unstructured":"Alber, J., Niedermeier, R.: Improved tree decomposition based algorithms for domination-like problems. In: Proceedings of the 5th Latin American Theoretical IN-formatics (LATIN 2002). Lecture Notes in Computer Science, vol. 2286, pp. 613\u2013627. Springer, Berlin (2002)"},{"key":"9167_CR4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"9167_CR5","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a forest. J. Comb. Theory B 52, 274\u2013283 (1991)","journal-title":"J. Comb. Theory B"},{"key":"9167_CR6","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small width. SIAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"9167_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/978-3-540-70918-3_28","volume-title":"Proceedings STACS 2007","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L.: A cubic kernel for feedback vertex set. In: Proceedings STACS 2007. Lecture Notes in Computer Science, vol. 4393, pp. 320\u2013331. Springer, Berlin (2007)"},{"key":"9167_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Koster, A.M.: Combinatorial optimisation on graphs of bounded treewidth. Comput. J. 51, 255\u2013269 (2007)","journal-title":"Comput. J."},{"key":"9167_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013458 (1994)","DOI":"10.1145\/195058.195229"},{"key":"9167_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/11847250_18","volume-title":"Proceedings IWPEC 2006","author":"K. Burrage","year":"2006","unstructured":"Burrage, K., Estivill-Castro, V., Fellows, M., Langston, M., Mac, S., Rosamond, F.: The undirected feedback vertex set problem has polynomial kernel size. In: Proceedings IWPEC 2006. Lecture Notes in Computer Science, vol. 4169, pp. 192\u2013202. Springer, Berlin (2006)"},{"key":"9167_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s001530050069","volume":"36","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R., Fellows, M.: The parameterized complexity of short computation and factorization. Arch. Math. Log. 36, 321\u2013338 (1997). Proceedings of the Sacks Symposium","journal-title":"Arch. Math. Log."},{"key":"9167_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201, 216\u2013231 (2005)","journal-title":"Inf. Comput."},{"key":"9167_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Proceedings MFCS 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Proceedings MFCS 2006. Lecture Notes in Computer Science, vol. 4162, pp. 238\u2013249. Springer, Berlin (2006)"},{"key":"9167_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Proceedings WG 2004","author":"B. Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.: Linear kernels in linear time, or how to save k colors in O(n 2) steps. In: Proceedings WG 2004. Lecture Notes in Computer Science, vol. 3353, pp. 257\u2013269. Springer, Berlin (2004)"},{"key":"9167_CR15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second order logic of graphs I: Recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9167_CR16","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51, 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"9167_CR17","unstructured":"Demaine, E.D., Hajiaghayi, M.: Bidimensionality: New connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, January 2005, pp. 590\u2013601"},{"key":"9167_CR18","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52, 866\u2013893 (2005)","journal-title":"J. ACM"},{"key":"9167_CR19","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24, 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"9167_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor. Comput. Sci. 141, 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9167_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"9167_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-58140-5_10","volume-title":"Proceedings Symposium on Logical Foundations of Computer Science (LFCS)","author":"R. Downey","year":"1994","unstructured":"Downey, R., Fellows, M., Hallett, M., Kapron, B., Wareham, H.T.: The parameterized complexity of some problems in logic and linguistics. In: Proceedings Symposium on Logical Foundations of Computer Science (LFCS). Lecture Notes in Computer Science, vol. 813, pp. 89\u2013100. Springer, Berlin (1994)"},{"key":"9167_CR23","series-title":"AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/dimacs\/049\/04","volume-title":"Contemporary Trends in Discrete Mathematics, Proceedings of the DIMACS-DIMATIA Workshop on the Future of Discrete Mathematics","author":"R. Downey","year":"1999","unstructured":"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\u201399. AMS, New York (1999)"},{"key":"9167_CR24","first-page":"205","volume":"78","author":"R. Downey","year":"2003","unstructured":"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. Not. Theor. Comput. Sci. 78, 205\u2013218 (2003)","journal-title":"Electron. Not. Theor. Comput. Sci."},{"key":"9167_CR25","unstructured":"Estivill-Castro, V., Fellows, M., Langston, M., Rosamond, F.: Fixed-parameter tractability is P-time extremal structure theory I: The case of max leaf. In: Proceedings of ACiD 2005: Algorithms and Complexity in Durham, pp. 1\u201341 (2005)"},{"key":"9167_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-36383-1_3","volume-title":"Experimental Algorithmics","author":"M. Fellows","year":"2002","unstructured":"Fellows, M.: Parameterized complexity: the main ideas and connections to practical computing. In: Experimental Algorithmics. Lecture Notes in Computer Science, vol. 2547, pp. 51\u201377. Springer, Berlin (2002)"},{"key":"9167_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Proceedings WG 2003","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s and crown rules: Some new directions in FPT. In: Proceedings WG 2003. Lecture Notes in Computer Science, vol. 2880, pp. 1\u201312. Springer, Berlin (2003)"},{"key":"9167_CR28","doi-asserted-by":"crossref","unstructured":"Fellows, M., Langston, M.A.: An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In: Proceedings Thirtieth IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 520\u2013525 (1989)","DOI":"10.1109\/SFCS.1989.63528"},{"key":"9167_CR29","doi-asserted-by":"crossref","unstructured":"Fellows, M., Langston, M.A.: On search, decision and the efficiency of polynomial-time algorithms. In: Proc. Symp. on Theory of Computing (STOC), pp. 501\u2013512 (1989)","DOI":"10.1145\/73007.73055"},{"key":"9167_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-540-73556-4_38","volume-title":"Proceedings of COCOA 2007","author":"M. Fellows","year":"2007","unstructured":"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: Proceedings of COCOA 2007. Lecture Notes in Computer Science, vol. 4616, pp. 366\u2013377. Springer, Berlin (2007)"},{"key":"9167_CR31","doi-asserted-by":"crossref","unstructured":"Fellows M., Downey R., Langston M. (eds.), Two special issues of surveys of various aspects of parameterized complexity and algorithmics. Comput. J. 51(1, 3) (2008)","DOI":"10.1093\/comjnl\/bxm111"},{"key":"9167_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Proceedings of ISAAC 2008.","author":"M. Fellows","year":"2008","unstructured":"Fellows, M., Lokshtanov, D., Misra, N., Rosamond, F., Saurabh, S.: Graph layout problems parameterized by Vertex Cover. In: Proceedings of ISAAC 2008. Lecture Notes in Computer Science, vol. 5369, pp. 294\u2013305. Springer, Berlin (2008)"},{"key":"9167_CR33","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"9167_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-44503-X_2","volume-title":"Proc. ICDT","author":"J. Flum","year":"2001","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. In: Proc. ICDT. Lecture Notes in Computer Science, vol. 1973, pp. 22\u201332. Springer, Berlin (2001)"},{"key":"9167_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Proceedings of WG 2004","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Kratsch, D., Woeginger, G.: Exact (exponential) algorithms for the dominating set problem. In: Proceedings of WG 2004. Lecture Notes in Computer Science, vol. 3353, pp. 245\u2013256. Springer, Berlin (2004)"},{"key":"9167_CR36","first-page":"82","volume-title":"Proc. PODS 2001","author":"M. Grohe","year":"2001","unstructured":"Grohe, M.: The parameterized complexity of database queries. In: Proc. PODS 2001, pp. 82\u201392. ACM, Providence (2001)"},{"key":"9167_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/3-540-49257-7_6","volume-title":"Proceedings of the 7th International Conference on Database Theory","author":"M. Grohe","year":"1999","unstructured":"Grohe, M., Marino, J.: Definability and descriptive complexity on databases with bounded treewidth. In: Proceedings of the 7th International Conference on Database Theory. Lecture Notes in Computer Science, vol. 1540, pp. 70\u201382. Springer, Berlin (1999)"},{"key":"9167_CR38","doi-asserted-by":"crossref","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 31\u201345 (2007)","DOI":"10.1145\/1233481.1233493"},{"key":"9167_CR39","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"9167_CR40","first-page":"119","volume-title":"Proc. Symp. on Principles of Programming Languages (POPL)","author":"F. Henglein","year":"1991","unstructured":"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\u2013130. ACM, New York (1991)"},{"key":"9167_CR41","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"9167_CR42","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1145\/174652.174659","volume":"41","author":"A.J. Kfoury","year":"1994","unstructured":"Kfoury, A.J., Tiuryn, J., Urzyczyn, P.: An analysis of ML typability. J. ACM 41, 368\u2013398 (1994)","journal-title":"J. ACM"},{"key":"9167_CR43","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D.J. Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discrete Math. 4, 99\u2013106 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9167_CR44","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8, 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"9167_CR45","first-page":"415","volume":"26","author":"J. Nesetril","year":"1985","unstructured":"Nesetril, J., Poljak, S.: On the complexity of the subgraph problem. Commun. Math. Univ. Carol. 26, 415\u2013419 (1985)","journal-title":"Commun. Math. Univ. Carol."},{"key":"9167_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-540-28629-5_4","volume-title":"Mathematical Foundations of Computer Science MFCS 2004","author":"R. Niedermeier","year":"2004","unstructured":"Niedermeier, R.: Ubiquitous parameterization\u2014invitation to fixed-parameter algorithms. In: Mathematical Foundations of Computer Science MFCS 2004. Lecture Notes in Computer Science, vol.\u00a03153, pp. 84\u2013103. Springer, Berlin (2004)"},{"key":"9167_CR47","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, London (2006)"},{"key":"9167_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-540-45078-8_41","volume-title":"Proc. WADS\u201903","author":"E. Prieto","year":"2003","unstructured":"Prieto, E., Sloper, C.: Either\/Or: using vertex cover structure in designing FPT algorithms\u2014the case of k-internal spanning tree. In: Proc. WADS\u201903. Lecture Notes in Computer Science, vol. 2748, pp.\u00a0474\u2013483. Springer, Berlin (2003)"},{"key":"9167_CR49","unstructured":"Prieto-Rodriguez, E.: Systematic kernelization in FPT algorithm design. Ph.D. Thesis, School of EE&CS, University of Newcastle, Australia (2005)"},{"key":"9167_CR50","unstructured":"Raman, V.: Parameterized complexity. In: Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India, pp. 1\u201318 (1997)"},{"key":"9167_CR51","first-page":"153","volume-title":"Surveys in Combinatorics","author":"N. Robertson","year":"1985","unstructured":"Robertson, N., Seymour, P.: Graph minors: a survey. In: Anderson, J. (ed.) Surveys in Combinatorics, pp. 153\u2013171. Cambridge University Press, Cambridge (1985)"},{"key":"9167_CR52","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.: Graph minors XX. Wagner\u2019s conjecture. J. Comb. Theory. Ser. B 92, 325\u2013357 (2004)","journal-title":"J. Comb. Theory. Ser. B"},{"key":"9167_CR53","first-page":"601","volume-title":"Proc. MFCS 2008","author":"S. Szeider","year":"2008","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. In: Proc. MFCS 2008, pp. 601\u2013612. Springer, Berlin (2008)"},{"key":"9167_CR54","unstructured":"Szeider, S.: Not so easy problems for tree decomposable graphs. In: Proceedings of ICDM 2008. pp. 161\u2013171, Mysore (2008)"},{"key":"9167_CR55","series-title":"Lecture Notes Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-57155-8_284","volume-title":"Proceedings WADS\u201993\u2014The Third Workshop on Algorithms and Data Structures","author":"J.A. Telle","year":"1993","unstructured":"Telle, J.A., Proskurowski, A.: Practical algorithms on partial k-trees with an application to domination-like problems. In: Proceedings WADS\u201993\u2014The Third Workshop on Algorithms and Data Structures. Lecture Notes Computer Science, vol. 709, pp. 610\u2013621. Springer, Berlin (1993)"},{"key":"9167_CR56","unstructured":"Weihe, K.: Covering trains by stations, or the power of data reduction. In: Proc. ALEX\u201998, pp. 1\u20138 (1998)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9167-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9167-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9167-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T19:57:26Z","timestamp":1684871846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9167-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,29]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9167-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,29]]}}}