{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:10:05Z","timestamp":1777540205217,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540369257","type":"print"},{"value":"9783540369264","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_10","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"73-82","source":"Crossref","is-referenced-by-count":13,"title":["Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"Min Chih","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X. Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Computing\u00a025, 390\u2013403 (1996)","journal-title":"SIAM J. Computing"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc graphs. Networks\u00a04, 357\u2013369 (1974)","journal-title":"Networks"},{"key":"10_CR3","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) (2nd edn., 2004)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science\u00a0234, 59\u201384 (2000)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11785293_7","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Nussbaum, Y.: A Simpler Linear-Time Recognition of Circular-Arc Graphs. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 41\u201352. Springer, Heidelberg (2006)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Efficient Construction of Unit Circular-Arc Models. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 309\u2013315 (2006)","DOI":"10.1145\/1109557.1109592"},{"issue":"2","key":"10_CR7","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"Spinrad, J.: Efficient Graph Representations. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1090\/S0002-9904-1970-12628-3","volume":"76","author":"A. Tucker","year":"1970","unstructured":"Tucker, A.: Characterizing circular-arc graphs. Bull. American Mathematical Society\u00a076, 1257\u20131260 (1970)","journal-title":"Bull. American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:31Z","timestamp":1619508391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11809678_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}