{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:42Z","timestamp":1770906282154,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":7229,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0166-218x(93)90027-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"173-178","source":"Crossref","is-referenced-by-count":10,"title":["A linear time and space algorithm to recognize interval orders"],"prefix":"10.1016","volume":"46","author":[{"given":"Philippe","family":"Baldy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Morvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90027-L_BIB1","series-title":"Interval Orders and Interval Graphs","author":"Fishburn","year":"1985"},{"key":"10.1016\/0166-218X(93)90027-L_BIB2","series-title":"Memorandum No 1046","article-title":"A linear time algorithm for recognizing interval orders","author":"Garbe","year":"1992"},{"key":"10.1016\/0166-218X(93)90027-L_BIB3","series-title":"Algorithms and Order","first-page":"105","article-title":"Computationally tractable classes of ordered sets","author":"M\u00f6hring","year":"1989"},{"key":"10.1016\/0166-218X(93)90027-L_BIB4","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390027L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390027L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:06Z","timestamp":1555136766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390027L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["0166218X9390027L"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90027-l","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}