{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:23:06Z","timestamp":1759666986056},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00435-8","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T12:35:20Z","timestamp":1045053320000},"page":"99-116","source":"Crossref","is-referenced-by-count":61,"title":["PC trees and circular-ones arrangements"],"prefix":"10.1016","volume":"296","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross M.","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00435-8_BIB1","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","article-title":"On the topology of the genetic fine structure","volume":"45","author":"Benzer","year":"1959","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB5","series-title":"The Theory of Two-Structures","author":"Ehrenfeucht","year":"1999"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","article-title":"Theory of 2-structures, Part 1","volume":"70","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","article-title":"Theory of 2-structures, Part 2","volume":"70","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitive orientierbare Graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-44679-6_23","article-title":"PC-trees vs. PQ-trees","volume":"2108","author":"Hsu","year":"2001","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.2001.1205","article-title":"A simple test for the consecutive ones property","volume":"42","author":"Hsu","year":"2002","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0022-0000(88)90006-2","article-title":"An efficient parallel algorithm for planarity","volume":"18","author":"Klein","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","article-title":"An incremental linear-time algorithm for recognizing interval graphs","volume":"18","author":"Korte","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB14","series-title":"Theory of Graphs","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB15","doi-asserted-by":"crossref","unstructured":"R.M. McConnell, Linear-time recognition of circular-arc graphs, Proc. 42nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS01), Vol. 42, 2001, pp. 386\u2013394.","DOI":"10.1109\/SFCS.2001.959913"},{"key":"10.1016\/S0304-3975(02)00435-8_BIB16","unstructured":"R.M. McConnell, J.P. Spinrad, Construction of probe interval models, Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 866\u2013875."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","article-title":"Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions","volume":"4","author":"M\u00f6hring","year":"1985","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB18","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(02)00435-8_BIB19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","article-title":"A new planarity test","volume":"223","author":"Shih","year":"1999","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004358?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004358?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T05:53:25Z","timestamp":1553925205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004358"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00435-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}