{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:17Z","timestamp":1725738557941},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_24","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"250-262","source":"Crossref","is-referenced-by-count":7,"title":["FO Model Checking of Interval Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[]},{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Obdr\u017e\u00e1lek","sequence":"additional","affiliation":[]},{"given":"Jarett","family":"Schwartz","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Teska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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. Inform. and Comput.\u00a085, 12\u201375 (1990)","journal-title":"Inform. and Comput."},{"key":"24_CR2","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, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270\u2013279. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.31"},{"key":"24_CR5","unstructured":"Dawar, A., Kreutzer, S.: Parameterized complexity of first-order logic. ECCC TR09-131 (2009)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: FOCS 2010, pp. 133\u2013142. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.20"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fund. Math.\u00a049, 129\u2013141 (1961)","journal-title":"Fund. Math."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M. Fellows","year":"2009","unstructured":"Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci.\u00a0410, 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR10","first-page":"35","volume":"1","author":"R. Fra\u00efss\u00e9","year":"1954","unstructured":"Fra\u00efss\u00e9, R.: Sur quelques classifications des syst\u00e8mes de relations. Universit\u00e9 d\u2019Alger, Publications Scientifiques, S\u00e9rie A\u00a01, 35\u2013182 (1954)","journal-title":"Universit\u00e9 d\u2019Alger, Publications Scientifiques, S\u00e9rie A"},{"key":"24_CR11","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, 1184\u20131206 (2001)","journal-title":"J. ACM"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M. Golumbic","year":"2000","unstructured":"Golumbic, M., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci.\u00a011, 423\u2013443 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kreutzer, S.: Methods for algorithmic meta theorems. In: Model Theoretic Methods in Finite Combinatorics Contemporary Mathematics, pp. 181\u2013206. AMS (2011)","DOI":"10.1090\/conm\/558\/11051"},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.disopt.2011.06.001","volume":"8","author":"J. Kneis","year":"2011","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Courcelle\u2019s theorem \u2014 a game-theoretic approach. Discrete Optimization\u00a08(4), 568\u2013594 (2011)","journal-title":"Discrete Optimization"},{"key":"24_CR15","unstructured":"Kreutzer, S.: Algorithmic meta-theorems. ECCC TR09-147 (2009)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an mso-solver. In: ALENEX 2012, pp. 55\u201363. SIAM \/ Omnipress (2012)","DOI":"10.1137\/1.9781611972924.5"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-92182-0_76","volume-title":"Algorithms and Computation","author":"V. Lozin","year":"2008","unstructured":"Lozin, V.: From tree-width to clique-width: Excluding a unit interval graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 871\u2013882. Springer, Heidelberg (2008)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Grad and classes with bounded expansion I. Decompositions. European J. Combin.\u00a029, 760\u2013776 (2008)","journal-title":"Decompositions. European J. Combin."},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/j.ejc.2006.07.014","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Grad and classes with bounded expansion II. Algorithmic aspects. European J. Combin.\u00a029, 777\u2013791 (2008)","journal-title":"Algorithmic aspects. European J. Combin."},{"key":"24_CR20","first-page":"1012","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. European J. Combin.\u00a029, 1012\u20131024 (2008)","journal-title":"Restricted graph homomorphism dualities. European J. Combin."},{"key":"24_CR21","unstructured":"Rabin, M.O.: A simple method for undecidability proofs and some applications. In: Logic, Methodology and Philosophy of Sciences, vol.\u00a01, pp. 58\u201368. North-Holland (1964)"},{"key":"24_CR22","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. Math. Structures Comput. Sci.\u00a06, 505\u2013526 (1996)","journal-title":"Math. Structures Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:07:54Z","timestamp":1557911274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}