{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T17:08:02Z","timestamp":1791997682636,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540656913","type":"print"},{"value":"9783540491163","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_16","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"173-183","source":"Crossref","is-referenced-by-count":6,"title":["New Branchwidth Territories"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"16_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Proceedings ICALP\u201997","author":"H. Bodlaender","year":"1997","unstructured":"Bodlaender, H. and D. M. Thilikos, Constructive linear time algorithms for branch-width, Proceedings ICALP\u201997, Springer-Verlag, LNCS 1256, (1997), pp. 627\u2013637."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K. and G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms, J. of Computer and System Sciences\n                           13, (1976), pp. 335\u2013379.","journal-title":"J. of Computer and System Sciences"},{"key":"16_CR3","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco 1979."},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth-Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T., Treewidth-Computations and Approximations, Springer-Verlag, LNCS 842, 1994."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N. and P.D. Seymour, Graph minors X: Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B\n                           52, (1991), pp. 153\u2013190.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D. and R. Thomas, Call routing and the ratcatcher, Combinatorica\n                           14, (1994), pp. 217\u2013241.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T23:19:50Z","timestamp":1550791190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}