{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:24Z","timestamp":1725537204986},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_26","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"348-363","source":"Crossref","is-referenced-by-count":3,"title":["On the Parameterised Intractability of Monadic Second-Order Logic"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kreutzer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"194","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a02, pp. 194\u2013242. Elsevier, Amsterdam (1990)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Logic in Computer Science (LICS), pp. 270\u2013279 (2007)","DOI":"10.1109\/LICS.2007.31"},{"key":"26_CR3","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"26_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1994)"},{"key":"26_CR5","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0097539799360768","volume":"31","author":"J. Flum","year":"2001","unstructured":"Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing\u00a031, 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"1148","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. Journal of the ACM\u00a048, 1148\u20131206 (2001)","journal-title":"Journal of the ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: ACM Symposium on Theory of Computing (STOC), pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"key":"26_CR9","unstructured":"Grohe, M.: Logic, graphs, and algorithms. In: Wilke, T., Flum, J., Gr\u00e4del, E. (eds.) Logic and Automata \u2013 History and Perspectives. Amsterdam University Press (2007)"},{"key":"26_CR10","unstructured":"Kreutzer, S.: Algorithmic meta-theorems (to appear), http:\/\/arxiv.org\/abs\/0902.3616"},{"key":"26_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"26_CR12","unstructured":"Reed, B., Wood, D.: Polynomial treewidth forces a large grid-like minor. arXiv:0809.0724v3 [math.CO] (2008) (unpublished)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B (1994)","DOI":"10.1006\/jctb.1994.1073"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors V. Excluding a planar graph. Journal of Combinatorial Theory, Series B\u00a041(1), 92\u2013114 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Vardi, M.: On the complexity of relational query languages. In: Proc. of the 14th Symposium on Theory of Computing (STOC), pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:19:22Z","timestamp":1558538362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}