{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:46Z","timestamp":1725544786411},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_66","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"727-736","source":"Crossref","is-referenced-by-count":7,"title":["The Branch-Width of Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Mazoit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.: Graphs minors. III. Planar tree-width. Journal of Combinatorial Theory Series B\u00a036, 49\u201364 (1984)","journal-title":"Planar tree-width. Journal of Combinatorial Theory Series B"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial k-arboretum of graphs with bounded treewidth. Theoretical computer science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical computer science"},{"key":"66_CR3","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.: Graphs minors. X. Obstruction to tree-decomposition. Journal of Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"2","key":"66_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P. Seymour","year":"1994","unstructured":"Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"66_CR5","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., Kratochv\u00edl, 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":"66_CR6","unstructured":"Mazoit, F.: D\u00e9composition algorithmique des graphes. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon (2004)"},{"key":"66_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11604686_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Mazoit, F., Todinca, I.: Computing branchwidth via efficient triangulations and blocks. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 374\u2013384. Springer, Heidelberg (2005)"},{"key":"66_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-27836-8_49","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 568\u2013580. Springer, Heidelberg (2004)"},{"key":"66_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 a path in a tree are exactly the chordal graphs. Journal of Combinatorial Theory\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory"},{"issue":"1-3","key":"66_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","volume":"79","author":"A. Parra","year":"1997","unstructured":"Parra, A., Scheffler, P.: Characterizations and algorithmic applications of chordal graph embeddings. Discrete Applied Mathematics\u00a079(1-3), 171\u2013188 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"66_CR11","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480191193789","volume":"7","author":"R. Sundaram","year":"1994","unstructured":"Sundaram, R., Sher Singh, K., Pandu Rangan, C.: Treewidth of circular-arc graphs. SIAM Journal Discrete Mathematics\u00a07, 647\u2013655 (1994)","journal-title":"SIAM Journal Discrete Mathematics"},{"key":"66_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R.M. McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica\u00a037, 93\u2013147 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:25:09Z","timestamp":1552361109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11682462_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}