{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:36:59Z","timestamp":1725514619428},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693109"},{"type":"electronic","value":"9783540693116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69311-6_18","type":"book-chapter","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T11:17:46Z","timestamp":1212751066000},"page":"159-170","source":"Crossref","is-referenced-by-count":0,"title":["Efficient First-Order Model-Checking Using Short Labels"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamadou Moustapha","family":"Kant\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Tree-width. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Gavoille, C., Kant\u00e9, M.M., Twigg, A.: Optimal Labeling for Connectivity Checking in Planar Networks with Obstacles. (manuscript, 2008); An extended abstract will appear in Electronic Notes in Discrete Mathematics. In: Proceedings of the first Conference Topological and Geometric Graph Theory, Paris (2008)","DOI":"10.1016\/j.endm.2008.06.030"},{"issue":"1-3","key":"18_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 Applied Mathematics\u00a0101(1-3), 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-70918-3_4","volume-title":"STACS 2007","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Twigg, A.: Compact Forbidden-Set Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 37\u201348. Springer, Heidelberg (2007)"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(02)00421-3","volume":"131","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B., Vanicat, R.: Query Efficient Implementation of Graphs of Bounded Clique-Width. Discrete Applied Mathematics\u00a0131(1), 129\u2013150 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/LICS.2007.31","volume-title":"22 nd IEEE Symposium on Logic in Computer Science (LICS)","author":"A. Dawar","year":"2007","unstructured":"Dawar, A., Grohe, M., Kreutzer, S.: Locally Excluding a Minor. In: 22 nd IEEE Symposium on Logic in Computer Science (LICS), pp. 270\u2013279. IEEE Computer Society, Los Alamitos (2007)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Durand, A., Grandjean, E.: First-Order Queries on Structures of Bounded Degree are Computable with Constant Delay. ACM Trans. Comput. Log\u00a08(4) (2007)","DOI":"10.1145\/1276920.1276923"},{"issue":"1","key":"18_CR8","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 Comput. Syst.\u00a037(1), 157\u2013191 (2004)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"18_CR9","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(1), 1184\u20131206 (2001)","journal-title":"J. ACM"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Gaifman, H.: On Local and Non-Local Properties. In: Proceedings of the Herbrand Symposium Logic Colloquium 1981, pp. 105\u2013135 (1982)","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"18_CR11","unstructured":"Grohe, M.: Logic, Graphs and Algorithms. In: Flum, Gr\u00e4del, Wilke (eds.) Logic, Automata, History and Perspectives, pp. 357\u2013422. Amsterdam University Press (2007)"},{"issue":"2-3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and Localized Distributed Data Structures. Distributed Computing\u00a016(2-3), 111\u2013120 (2003)","journal-title":"Distributed Computing"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-75520-3_16","volume-title":"Algorithms \u2013 ESA 2007","author":"P. Hlin\u011bn\u00fd","year":"2007","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding Branch-Decompositions and Rank-Decompositions. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 163\u2013174. Springer, Heidelberg (2007)"},{"key":"18_CR14","unstructured":"Lozin, V.: Clique-Width of Unit Interval Graphs. arXiv:0709.1935 (manuscript, 2007)"},{"key":"18_CR15","first-page":"391","volume-title":"38 th Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Linear Time Low Tree-Width Partitions and Algorithmic Consequences. In: Kleinberg, J.M. (ed.) 38 th Annual ACM Symposium on Theory of Computing (STOC), pp. 391\u2013400. ACM, New York (2006)"},{"issue":"1","key":"18_CR16","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.: Graph Minors V: Excluding a Planar Graph. J. Combin. Theory Ser. B\u00a041(1), 92\u2013114 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"6","key":"18_CR17","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(6), 505\u2013526 (1996)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69311-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:18Z","timestamp":1605761838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69311-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693109","9783540693116"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69311-6_18","relation":{},"subject":[]}}