{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:14Z","timestamp":1725795134897},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_2","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"13-24","source":"Crossref","is-referenced-by-count":0,"title":["Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Cao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Cao, Y.: Linear recognition of almost (unit) interval graphs (2014) (manuscript)","DOI":"10.1137\/1.9781611974331.ch77"},{"key":"2_CR2","unstructured":"Grippo, L., Safe, M.: On circular-arc graphs having a model with no three arcs covering the circle. arXiv:1402.2641 (2014)"},{"key":"2_CR3","first-page":"87","volume":"14","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput.\u00a014, 87\u2013108 (2007)","journal-title":"Nord. J. Comput."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0097539703437855","volume":"36","author":"D. Kratsch","year":"2006","unstructured":"Kratsch, D., McConnell, R., Mehlhorn, K., Spinrad, J.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput.\u00a036, 326\u2013353 (2006)","journal-title":"SIAM J. Comput."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fund. Math.\u00a051, 45\u201364 (1962)","journal-title":"Fund. Math."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.dam.2012.11.005","volume":"161","author":"M. Lin","year":"2013","unstructured":"Lin, M., Soulignac, F., Szwarcfiter, J.: Normal Helly circular-arc graphs and its subclasses. Discrete Appl. Math.\u00a0161, 1037\u20131059 (2013)","journal-title":"Discrete Appl. Math."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-45043-3_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Lindzey","year":"2013","unstructured":"Lindzey, N., McConnell, R.M.: On finding Tucker submatrices and Lekkerkerker-Boland subgraphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 345\u2013357. Springer, Heidelberg (2013)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R. McConnell","year":"2003","unstructured":"McConnell, R.: Linear-time recognition of circular-arc graphs. Algorithmica\u00a037, 93\u2013147 (2003)","journal-title":"Algorithmica"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"R. McConnell","year":"2011","unstructured":"McConnell, R., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Computer Science Review\u00a05, 119\u2013161 (2011)","journal-title":"Computer Science Review"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0012-365X(02)00578-2","volume":"263","author":"T. McKee","year":"2003","unstructured":"McKee, T.: Restricted circular-arc graphs and clique cycles. Discrete Math.\u00a0263, 221\u2013231 (2003)","journal-title":"Discrete Math."},{"key":"2_CR11","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 566\u2013579. Addendum in the same journal 14, 254\u2013255 (1985)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:29:51Z","timestamp":1558913391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}