{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:35Z","timestamp":1759638515613},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"},{"type":"electronic","value":"9783540748397"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74839-7_25","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"258-269","source":"Crossref","is-referenced-by-count":15,"title":["Pathwidth of Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"Karol","family":"Suchan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"25_CR1","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-2), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0196-6774(02)00001-9","volume":"43","author":"H. Bodlaender","year":"2002","unstructured":"Bodlaender, H., Fomin, F.: Approximating the pathwidth of outerplanar graphs. Journal of Algorithms\u00a043(2), 190\u2013200 (2002)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms\u00a021(2), 358\u2013402 (1996)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ic.2004.03.005","volume":"192","author":"J.A. Ellis","year":"2004","unstructured":"Ellis, J.A., Markov, M.: Computing the vertex separation of unicyclic graphs. Information and Computation\u00a0192(2), 123\u2013161 (2004)","journal-title":"Information and Computation"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The Vertex Separation and Search Number of a Graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.jda.2005.06.004","volume":"4","author":"F. Fomin","year":"2006","unstructured":"Fomin, F., Thilikos, D.: A 3-approximation for the pathwidth of Halin graphs. Journal of Discrete Algorithms\u00a04(4), 499\u2013510 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"25_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-70918-3_21","volume-title":"STACS 2007","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Suchan, K., Todinca, I., Villanger, Y.: Characterizing minimal interval completions: towards better understanding of profile and pathwidth. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 236\u2013247. Springer, Heidelberg (2007)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0129054196000099","volume":"7","author":"T. Kloks","year":"1996","unstructured":"Kloks, T.: Treewidth of circle graphs. Int. J. Found. Comput. Sci.\u00a07(2), 111\u2013120 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jagm.1998.0936","volume":"28","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., Wong, C.K.: Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms\u00a028(2), 272\u2013289 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"25_CR11","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(2), 93\u2013147 (2003)","journal-title":"Algorithmica"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Meggido","year":"1988","unstructured":"Meggido, N., Hakimi, S.L., Garey, M.R., Johson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. Journal of the ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"25_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"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00225-0","volume":"47","author":"K. Skodinis","year":"2003","unstructured":"Skodinis, K.: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. J. Algorithms\u00a047(1), 40\u201359 (2003)","journal-title":"J. Algorithms"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","volume":"33","author":"E. Szpilrajn-Marczewski","year":"1945","unstructured":"Szpilrajn-Marczewski, E.: Sur deux propri\u00e9t\u00e9s des classes d\u2019ensembles. Fundamenta Mathematicae\u00a033, 303\u2013307 (1945)","journal-title":"Fundamenta Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:06:02Z","timestamp":1558263962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748380","9783540748397"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}