{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:14:47Z","timestamp":1725563687326},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_47","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"549-560","source":"Crossref","is-referenced-by-count":8,"title":["Algorithmic Meta-theorems for Restrictions of Treewidth"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"47_CR1","doi-asserted-by":"publisher","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\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"issue":"1","key":"47_CR3","doi-asserted-by":"publisher","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.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"47_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"47_CR5","first-page":"411","volume-title":"LICS","author":"A. Dawar","year":"2006","unstructured":"Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS, pp. 411\u2013420. IEEE Computer Society, Los Alamitos (2006)"},{"key":"47_CR6","series-title":"Texts in Algorithmics","first-page":"1","volume-title":"ACiD","author":"V. Estivill-Castro","year":"2005","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-Time Extremal Structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) ACiD. Texts in Algorithmics, vol.\u00a04, pp. 1\u201341. King\u2019s College, London (2005)"},{"key":"47_CR7","unstructured":"Fellows, M.R.: Open problems in parameterized complexity. In: AGAPE spring school on fixed parameter and exact algorithms (2009)"},{"issue":"4","key":"47_CR8","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s00224-009-9167-9","volume":"45","author":"M.R. Fellows","year":"2009","unstructured":"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.\u00a045(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-73001-9_28","volume-title":"Computation and Logic in the Real World","author":"M.R. Fellows","year":"2007","unstructured":"Fellows, M.R., Rosamond, F.A.: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 268\u2013277. Springer, Heidelberg (2007)"},{"key":"47_CR11","first-page":"825","volume-title":"SODA","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: Mathieu, C. (ed.) SODA, pp. 825\u2013834. SIAM, Philadelphia (2009)"},{"issue":"6","key":"47_CR12","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/504794.504798","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. J. ACM\u00a048(6), 1184\u20131206 (2001)","journal-title":"J. ACM"},{"issue":"1-3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M. Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic\u00a0130(1-3), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"47_CR14","unstructured":"Grohe, M.: Logic, graphs, and algorithms. Electronic Colloquium on Computational Complexity (ECCC)\u00a014(091) (2007)"},{"issue":"3","key":"47_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., il Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J.\u00a051(3), 326\u2013362 (2008)","journal-title":"Comput. J."},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"D. Kleitman","year":"1991","unstructured":"Kleitman, D., West, D.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics\u00a04, 99 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Tazari, S.: On brambles, grid-like minors, and parameterized intractability of monadic second order logic. In: SODA (2010)","DOI":"10.1137\/1.9781611973075.30"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T19:23:41Z","timestamp":1548444221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-15775-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}
