{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T06:29:52Z","timestamp":1726381792552},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T00:00:00Z","timestamp":1311984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00453-011-9554-x","type":"journal-article","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T16:02:18Z","timestamp":1311955338000},"page":"19-37","source":"Crossref","is-referenced-by-count":116,"title":["Algorithmic Meta-theorems for Restrictions of Treewidth"],"prefix":"10.1007","volume":"64","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,30]]},"reference":[{"issue":"2","key":"9554_CR1","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.\u00a0Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J.\u00a0Algorithms"},{"key":"9554_CR2","volume-title":"FOCS","author":"H. Bodlaender","year":"2009","unstructured":"Bodlaender, H., Fomin, F., Lokshtanov, D., Penninkx, S.S.E., Thilikos, D.: (Meta) kernelization. In: FOCS (2009)"},{"key":"9554_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"MFCS","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kralovic, R., Urzyczyn, P. (eds.) MFCS. Lecture Notes in Computer Science, vol.\u00a04162, pp.\u00a0238\u2013249. Springer, Berlin (2006)"},{"key":"9554_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/1007352.1007391","volume-title":"STOC","author":"J. Chen","year":"2004","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear FPT reductions and computational lower bounds. In: Babai, L. (ed.) STOC, pp.\u00a0212\u2013221. ACM, New York (2004)"},{"key":"9554_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0213007","volume":"13","author":"S.S. Cosmadakis","year":"1984","unstructured":"Cosmadakis, S.S., Papadimitriou, C.H.: The traveling salesman problem with many visits to few cities. SIAM J. Comput. 13, 99 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9554_CR6","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(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"9554_CR7","doi-asserted-by":"crossref","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. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"9554_CR8","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.\u00a0411\u2013420. IEEE Comput. Soc., Los Alamitos (2006)"},{"issue":"3","key":"9554_CR9","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.T.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"9554_CR10","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.\u00a01\u201341. King\u2019s College, London (2005)"},{"key":"9554_CR11","volume-title":"AGAPE Spring School on Fixed Parameter and Exact Algorithms","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R.: Open problems in parameterized complexity. In: AGAPE Spring School on Fixed Parameter and Exact Algorithms (2009)"},{"key":"9554_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-540-73001-9_28","volume-title":"CiE","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. Lecture Notes in Computer Science, vol.\u00a04497, pp.\u00a0268\u2013277. Springer, Berlin (2007)"},{"key":"9554_CR13","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":"ISAAC","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. Lecture Notes in Computer Science, vol. 5369, pp. 294\u2013305. Springer, Berlin (2008)"},{"issue":"4","key":"9554_CR14","doi-asserted-by":"crossref","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. 45(4), 822\u2013848 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9554_CR15","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.\u00a0825\u2013834. SIAM, Philadelphia (2009)"},{"issue":"5","key":"9554_CR16","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9554_CR17","first-page":"1184","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. J.\u00a0ACM 48(6), 1184\u20131206 (2001)","journal-title":"J.\u00a0ACM"},{"issue":"1\u20133","key":"9554_CR18","doi-asserted-by":"crossref","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. Log. 130(1\u20133), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Log."},{"key":"9554_CR19","unstructured":"Grohe, M.: Logic, graphs, and algorithms. Electron. Colloq. Comput. Complex. (ECCC) 14(091) (2007)"},{"issue":"3","key":"9554_CR20","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.-i., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008)","journal-title":"Comput. J."},{"key":"9554_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Berlin (1999)"},{"key":"9554_CR22","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 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9554_CR23","volume-title":"SODA","author":"S. Kreutzer","year":"2010","unstructured":"Kreutzer, S., Tazari, S.: On brambles, grid-like minors, and parameterized intractability of monadic second order logic. In: SODA (2010)"},{"key":"9554_CR24","doi-asserted-by":"crossref","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 538\u2013548 (1983)","DOI":"10.1287\/moor.8.4.538"},{"key":"9554_CR25","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I\u2013XXIII. J.\u00a0Comb. Theory, Ser. B (1983\u20132004)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9554-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9554-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9554-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T12:59:17Z","timestamp":1686229157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9554-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,30]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9554"],"URL":"http:\/\/dx.doi.org\/10.1007\/s00453-011-9554-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,30]]}}}
