{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:33:17Z","timestamp":1648729997445},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)80025-5","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T20:06:49Z","timestamp":1306872409000},"page":"73-91","source":"Crossref","is-referenced-by-count":1,"title":["Parallel interval order recognition and construction of interval representations"],"prefix":"10.1016","volume":"143","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Gastaldo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Morvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)80025-5_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(93)90027-L","article-title":"A linear time and space algorithm to recognize interval orders","volume":"46","author":"Baldy","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(95)80025-5_BIB2","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"key":"10.1016\/0304-3975(95)80025-5_BIB3","series-title":"Ordered Sets","first-page":"759","article-title":"Some social sciences applications of ordered sets","author":"Bogart","year":"1982"},{"issue":"4","key":"10.1016\/0304-3975(95)80025-5_BIB4","doi-asserted-by":"crossref","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB5","first-page":"193","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1016\/0304-3975(95)80025-5_BIB6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.18.2.207","article-title":"Intransitive indifference in preference theory: a survey","volume":"18","author":"Fishburn","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0304-3975(95)80025-5_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(85)90042-1","article-title":"Interval graphs and interval orders","volume":"55","author":"Fishburn","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)80025-5_BIB8","author":"Fishburn","year":"1985"},{"key":"10.1016\/0304-3975(95)80025-5_BIB9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(81)90069-7","article-title":"A linear time recognition algorithm for interval dags","volume":"12","author":"Gabow","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)80025-5_BIB10","author":"Garbe","year":"1992"},{"key":"10.1016\/0304-3975(95)80025-5_BIB11","author":"Golumbic","year":"1985"},{"key":"10.1016\/0304-3975(95)80025-5_BIB12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","article-title":"N-free poses as generalizations of series-parallel posets","volume":"12","author":"Habib","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(95)80025-5_BIB13","first-page":"60","article-title":"Sorting in constant number of row and column phases on a mesh","author":"Marberg","year":"1987"},{"key":"10.1016\/0304-3975(95)80025-5_BIB14","first-page":"105","article-title":"Computationally tractable classes of ordered sets","author":"M\u00f6hring","year":"1989"},{"issue":"2","key":"10.1016\/0304-3975(95)80025-5_BIB15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval ordered tasks","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB17","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Canad. J. math."},{"key":"10.1016\/0304-3975(95)80025-5_BIB18","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","article-title":"Optimal and sublogarithmic time randomized parallel sorting algorithms","volume":"18","author":"Rajasekaran","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB19","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB20","series-title":"10th Coll. on Automata, Language and Programming","first-page":"676","article-title":"Recognition and isomorphism of two dimensional partial orders","volume":"Vol. 154","author":"Spinrad","year":"1983"},{"key":"10.1016\/0304-3975(95)80025-5_BIB21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(82)90080-1","article-title":"A labeling algorithm to recognize a line digraph and output its root graph","volume":"15","author":"Syslo","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)80025-5_BIB22","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)80025-5_BIB23","first-page":"441","article-title":"A contribution to the theory of relative position","volume":"17","author":"Weiner","year":"1914","journal-title":"Proc. Camb. philos. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T11:56:20Z","timestamp":1543751780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595800255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397595800255"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)80025-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}