{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:27Z","timestamp":1746331347140,"version":"3.40.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_2","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"16-22","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmic Meta Theorems for Sparse Graph Classes"],"prefix":"10.1007","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_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. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11874683_11","volume-title":"Computer Science Logic","author":"G. Bagan","year":"2006","unstructured":"Bagan, G.: MSO queries on tree decomposable structures are computable with linear delay. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 167\u2013181. Springer, Heidelberg (2006)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 194\u2013242. Elsevier Science Publishers (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"12","key":"2_CR4","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1016\/j.dam.2008.08.021","volume":"157","author":"B. Courcelle","year":"2009","unstructured":"Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Applied Mathematics\u00a0157(12), 2675\u20132700 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory of Computing Systems\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"issue":"1-2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B. Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: On the fixed-parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics\u00a0108(1-2), 23\u201352 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science\u00a0109, 49\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science, pp. 270\u2013279 (2007)","DOI":"10.1109\/LICS.2007.31"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: Proceedings of the 21st IEEE Symposium on Logic in Computer Science, pp. 411\u2013420 (2006)","DOI":"10.1109\/LICS.2006.13"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Durand, A., Schweikardt, N., Segoufin, L.: Enumerating first-order queries over databases of low degree. In: Proceedings of the 33rd ACM Symposium on Principles of Database Systems (2014)","DOI":"10.1145\/2594538.2594539"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Durand, A., Grandjean, E.: First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logic 8(4) (2007)","DOI":"10.1145\/1276920.1276923"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 133\u2013142 (2010)","DOI":"10.1109\/FOCS.2010.20"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 143\u2013152 (2010)","DOI":"10.1109\/FOCS.2010.21"},{"key":"2_CR15","series-title":"LIPIcs","first-page":"66","volume-title":"Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science","author":"M. Elberfeld","year":"2012","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Algorithmic meta theorems for circuit classes of constant and logarithmic depth. In: D\u00fcrr, C., Wilke, T. (eds.) Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a014, pp. 66\u201377. Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik (2012)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Kawarabayashi, K.I.: Embedding and canonizing graphs of bounded genus in logspace. In: Proceedings of the 46th ACM Symposium on Theory of Computing (2014)","DOI":"10.1145\/2591796.2591865"},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. Journal of the ACM\u00a049(6), 716\u2013752 (2002)","journal-title":"Journal of the ACM"},{"issue":"1","key":"2_CR18","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(1), 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR19","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00224-003-1111-9","volume":"37","author":"M. Frick","year":"2004","unstructured":"Frick, M.: Generalized model-checking over locally tree-decomposable classes. Theory of Computing Systems\u00a037(1), 157\u2013191 (2004)","journal-title":"Theory of Computing Systems"},{"key":"2_CR21","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. Journal of the ACM\u00a048, 1184\u20131206 (2001)","journal-title":"Journal of the ACM"},{"key":"2_CR22","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. Annals of Pure and Applied Logic\u00a0130, 3\u201331 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR23","series-title":"LIPIcs","first-page":"326","volume-title":"Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science","author":"R. Ganian","year":"2012","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Langer, A., Obdrlek, J., Rossmanith, P., Sikdar, S.: Lower bounds on the complexity of MSO1 model-checking. In: D\u00fcrr, C., Wilke, T. (eds.) Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a014, pp. 326\u2013337. Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik (2012)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-39212-2_24","volume-title":"Automata, Languages, and Programming","author":"R. Ganian","year":"2013","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Kr\u00e1l\u2019, D., Obdr\u017e\u00e1lek, J., Schwartz, J., Teska, J.: FO model checking of interval graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 250\u2013262. Springer, Heidelberg (2013)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-44693-1_2","volume-title":"STACS 2001","author":"M. Grohe","year":"2001","unstructured":"Grohe, M.: Generalized model-checking problems for first-order logic. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 12\u201326. Springer, Heidelberg (2001)"},{"key":"2_CR26","unstructured":"Grohe, M.: Logic, graphs, and algorithms. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata \u2013 History and Perspectives. Texts in Logic and Games, vol.\u00a02, pp. 357\u2013422. Amsterdam University Press (2007)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Reed, B.: A simple algorithm for the graph minor decomposition \u2013 logic meets structural graph theory. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 414\u2013431 (2013)","DOI":"10.1137\/1.9781611973105.30"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kreutzer, S.: Methods for algorithmic meta theorems. In: Grohe, M., Makowsky, J. (eds.) Model Theoretic Methods in Finite Combinatorics. Contemporary Mathematics, vol.\u00a0558, pp. 181\u2013206. American Mathematical Society (2011)","DOI":"10.1090\/conm\/558\/11051"},{"key":"2_CR29","series-title":"LIPIcs","first-page":"21","volume-title":"Proceedings of the 32nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","author":"M. Grohe","year":"2013","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Characterisations of nowhere denese graphs. In: Seth, A., Vishnoi, N. (eds.) Proceedings of the 32nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol.\u00a024, pp. 21\u201340. Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik (2013)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. In: Proceedings of the 46th ACM Symposium on Theory of Computing (2014)","DOI":"10.1145\/2591796.2591851"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Kazana, W., Segoufin, L.: First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science\u00a07(2) (2011)","DOI":"10.2168\/LMCS-7(2:20)2011"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Kazana, W., Segoufin, L.: Enumeration of first-order queries on classes of structures with bounded expansion. In: Proceedings of the 32nd ACM Symposium on Principles of Database Systems, pp. 297\u2013308 (2013)","DOI":"10.1145\/2463664.2463667"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Kreutzer, S.: Algorithmic meta-theorems. In: Esparza, J., Michaux, C., Steinhorn, C. (eds.) Finite and Algorithmic Model Theory. London Mathematical Society Lecture Note Series, ch. 5, pp. 177\u2013270. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511974960.006"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Tazari, S.: Lower bounds for the complexity of monadic second-order logic. In: Proceedings of the 25th IEEE Symposium on Logic in Computer Science, pp. 189\u2013198 (2010)","DOI":"10.1109\/LICS.2010.39"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Tazari, S.: On brambles, grid-like minors, and parameterized intractability of monadic second-order logic. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 354\u2013364 (2010)","DOI":"10.1137\/1.9781611973075.30"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-04027-6_26","volume-title":"Computer Science Logic","author":"S. Kreutzer","year":"2009","unstructured":"Kreutzer, S.: On the parameterised intractability of monadic second-order logic. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 348\u2013363. Springer, Heidelberg (2009)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an mso-solver. In: Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, pp. 55\u201363 (2012)","DOI":"10.1137\/1.9781611972924.5"},{"issue":"4","key":"2_CR38","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ejc.2011.01.006","volume":"32","author":"J. Ne\u0161et\u0159il","year":"2011","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: On nowhere dense graphs. European Journal of Combinatorics\u00a032(4), 600\u2013617 (2011)","journal-title":"European Journal of Combinatorics"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR41","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S0960129500070079","volume":"6","author":"D. Seese","year":"1996","unstructured":"Seese, D.: Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science\u00a06, 505\u2013526 (1996)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:49:00Z","timestamp":1746251340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}