{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:30Z","timestamp":1725549930411},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_35","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"379-390","source":"Crossref","is-referenced-by-count":6,"title":["New Tools and Simpler Algorithms for Branchwidth"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Paul","sequence":"first","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 627\u2013637. Springer, Heidelberg (1997)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jagm.1999.1011","volume":"32","author":"H.L. Bodlaender","year":"1999","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms\u00a032, 167\u2013194 (1999)","journal-title":"Journal of Algorithms"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing of the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR4","first-page":"233","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.D.: Tour merging via branch-decompositions. Journal on Computing\u00a015, 233\u2013248 (2003)","journal-title":"Journal on Computing"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/3-540-45061-0_65","volume-title":"Automata, Languages and Programming","author":"E. Demaine","year":"2003","unstructured":"Demaine, E., Fomin, F., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 829\u2013844. Springer, Heidelberg (2003)"},{"key":"35_CR6","unstructured":"Fomin, F., Thilikos, D.: Dominating sets in planar graphs: Branch-width and exponential speedup. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 168\u2013177 (2003)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24749-4_6","volume-title":"STACS 2004","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Thilikos, D.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 56\u201367. Springer, Heidelberg (2004)"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-27836-8_50","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Thilikos, D.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 581\u2013592. Springer, Heidelberg (2004)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory Series B\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"35_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Acad. Press, New York (1980)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-49116-3_16","volume-title":"STACS 99","author":"T. Kloks","year":"1999","unstructured":"Kloks, T., Kratochvil, J., M\u00fcller, H.: New branchwidth territories. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 173\u2013183. Springer, Heidelberg (1999)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2004.01.015","volume":"145","author":"T. Kloks","year":"2005","unstructured":"Kloks, T., Kratochvil, J., M\u00fcller, H.: Computing the branchwidth of interval graphs. Discrete Applied Mathematics\u00a0145, 145\u2013266 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR13","unstructured":"Mazoit, F.: A general scheme for deciding the branchwidth. Technical Report RR2004-34, LIP - \u00c9cole Normale Sup\u00e9rieure de Lyon (2004), \n                  \n                    http:\/\/www.ens-lyon.fr\/LIP\/Pub\/Rapports\/RR\/RR2004\/RR2004-34.pdf"},{"key":"35_CR14","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., Seymour, P.D.: Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal on Combinatorial Theory Series B"},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:29Z","timestamp":1619507609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11561071_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}