{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:24Z","timestamp":1759063704592},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_9","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"88-99","source":"Crossref","is-referenced-by-count":2,"title":["Fixed-Parameter Tractability and Characterizations of Small Special Treewidth"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Vincent J. C.","family":"Kreuzen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/jgt.3190070305","volume":"7","author":"D. Archdeacon","year":"1983","unstructured":"Archdeacon, D.: A Kuratowski theorem for the projective plane. Journal of Graph Theory\u00a07, 325\u2013334 (1983)","journal-title":"Journal of Graph Theory"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(90)90292-P","volume":"80","author":"S. Arnborg","year":"1990","unstructured":"Arnborg, S., Proskurowski, A., Corneil, D.G.: Forbidden minors characterization of partial 3-trees. Discrete Mathematics\u00a080, 1\u201319 (1990)","journal-title":"Discrete Mathematics"},{"key":"9_CR3","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 treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(96)00057-1","volume":"71","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., de Fluiter, B.: On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics\u00a071, 55\u201377 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A O(c\n                        \n                  k\n                \n                        n) 5-approximation algorithm for treewidth. CoRR, abs\/1304.6321 (2013), Extended abstract to appear in FOCS 2013","DOI":"10.1109\/FOCS.2013.60"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/jagm.1993.1035","volume":"15","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., Kloks, T.: A simple linear time algorithm for triangulating three-colored graphs. Journal of Algorithms\u00a015, 160\u2013172 (1993)","journal-title":"Journal of Algorithms"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms\u00a021, 358\u2013402 (1996)","journal-title":"Journal of Algorithms"},{"key":"9_CR8","unstructured":"Courcelle, B.: Special tree-width and the verification of monadic second-order graph properties. In: FSTTCS. LIPIcs, vol.\u00a08, pp. 13\u201329. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.dam.2010.12.017","volume":"160","author":"B. Courcelle","year":"2012","unstructured":"Courcelle, B.: On the model-checking of monadic second-order formulas with edge set quantifications. Discrete Applied Mathematics\u00a0160, 866\u2013887 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR10","unstructured":"de Fluiter, B.: Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University (1997)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory, 4th edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(94)90021-3","volume":"54","author":"N.G. Kinnersley","year":"1994","unstructured":"Kinnersley, N.G., Langston, M.A.: Obstruction set isolation for the gate matrix layout problem. Discrete Applied Mathematics\u00a054, 169\u2013213 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B\u00a035, 39\u201361 (1983)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. Journal of Combinatorial Theory, Series B\u00a092, 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"14","author":"K. Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine Eigenshaft der ebenen Complexe. Math. Ann.\u00a014, 570\u2013590 (1937)","journal-title":"Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T05:55:39Z","timestamp":1558677339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}