{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:38:02Z","timestamp":1725543482534},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_7","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"41-52","source":"Crossref","is-referenced-by-count":9,"title":["A Simpler Linear-Time Recognition of Circular-Arc Graphs"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahav","family":"Nussbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Conitzer, V., Derryberry, J., Sandholm, T.: Combinatorial auctions with structured item graphs. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp. 212\u2013218 (2004)","key":"7_CR2"},{"issue":"2","key":"7_CR3","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. Comput.\u00a025(2), 390\u2013403 (1996)","journal-title":"SIAM J. Comput."},{"unstructured":"Eschen, E.M.: Circular-arc graph recognition and related problems. PhD thesis, Department of Computer Science, Vanderbilt University (1997)","key":"7_CR4"},{"unstructured":"Eschen, E.M., Spinrad, J.P.: An O(n 2) algorithm for circular-arc graph recognition. In: SODA 1993: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 128\u2013137 (1993)","key":"7_CR5"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539793260726","volume":"24","author":"W.-L. Hsu","year":"1995","unstructured":"Hsu, W.-L.: O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput.\u00a024(3), 411\u2013439 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.M.: PC-trees and circular-ones arrangements. Theor. Comput. Sci.\u00a0296(1), 99\u2013116 (2003)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Efficient construction of unit circular-arc models. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 309\u2013315 (2006)","key":"7_CR8","DOI":"10.1145\/1109557.1109592"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-53832-1_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T.-H. Ma","year":"1991","unstructured":"Ma, T.-H., Spinrad, J.P.: Avoiding matrix multiplication. In: M\u00f6hring, R.H. (ed.) WG 1990. LNCS, vol.\u00a0484, pp. 61\u201371. Springer, Heidelberg (1991)"},{"issue":"2","key":"7_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"},{"issue":"1-3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0095-8956(88)90038-X","volume":"44","author":"J.P. Spinrad","year":"1988","unstructured":"Spinrad, J.P.: Circular-arc graphs with clique cover number two. Journal of Combinatorial Theory Series B\u00a044(3), 300\u2013306 (1988)","journal-title":"Journal of Combinatorial Theory Series B"},{"doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol.\u00a019. American Mathematical Society (2003)","key":"7_CR13","DOI":"10.1090\/fim\/019"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/BFb0036947","volume-title":"Automata, Languages and Programming","author":"J.P. Spinrad","year":"1983","unstructured":"Spinrad, J.P., Valdes, J.: Recognition and isomorphism of two dimensional partial orders. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 676\u2013686. Springer, Heidelberg (1983)"},{"doi-asserted-by":"crossref","unstructured":"Stefanakos, S., Erlebach, T.: Routing in all-optical ring networks revisited. In: Proceedings of the 9th IEEE Symposium on Computers and Communication, pp. 288\u2013293 (2004)","key":"7_CR15","DOI":"10.1109\/ISCC.2004.1358419"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A.C. Tucker","year":"1980","unstructured":"Tucker, A.C.: An efficient test for circular-arc graphs. SIAM J. Comput.\u00a09(1), 1\u201324 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:27Z","timestamp":1619507967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11785293_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}