{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:03Z","timestamp":1725497163468},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_24","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"248-257","source":"Crossref","is-referenced-by-count":5,"title":["Proper Helly Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"Min Chih","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco J.","family":"Soulignac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V., Spinrad, J.: Graph Classes: A Survey. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"24_CR2","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 Journal on Computing\u00a025, 390\u2013403 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR3","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. Golumbic","year":"1980","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"key":"24_CR4","unstructured":"Joeris, B., Lin, M.C., McConnell, R.M., Spinrad, J., Szwarcfiter, J.L.: Linear time recognition of Helly circular-arc models and graphs (manuscript, 2007) (Presented at COCOON 2006 and SIAM DM 2006 Confs.)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11917496_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H. Kaplan","year":"2006","unstructured":"Kaplan, H., Nussbaum, Y.: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 289\u2013300. Springer, Heidelberg (2006)"},{"key":"24_CR6","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":"24_CR7","doi-asserted-by":"crossref","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Efficient construction of unit circular-arc models. In: SODA 2006. Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 309\u2013315 (2006)","DOI":"10.1145\/1109557.1109592"},{"key":"24_CR8","unstructured":"Lin, M.C., McConnell, R.M., Soulignac, F.J., Szwarcfiter, J.L.: On cliques of Helly circular-arc graphs (in preparation)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. In: FOCS 2001. Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 386\u2013394 (2001)","DOI":"10.1109\/SFCS.2001.959913"},{"issue":"2","key":"24_CR10","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":"24_CR11","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive ones property. In: SODA 2004. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 716\u2013770 (2004)"},{"key":"24_CR12","volume-title":"Efficient Graph Representations","author":"J. Spinrad","year":"2003","unstructured":"Spinrad, J.: Efficient Graph Representations. American Mathematical Society, Providence, Rhode Island (2003)"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"38","author":"A. Tucker","year":"1971","unstructured":"Tucker, A.: Matrix characterizations of circular-arc graphs. Pacific Journal of Mathematics\u00a038, 535\u2013545 (1971)","journal-title":"Pacific Journal of Mathematics"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A. Tucker","year":"1974","unstructured":"Tucker, A.: Structure theorems for some circular-arc graphs. Discrete Mathematics\u00a07, 167\u2013195 (1974)","journal-title":"Discrete Mathematics"}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:33Z","timestamp":1619520153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_24","relation":{},"subject":[]}}