{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:03:17Z","timestamp":1726516997244},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10060,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/s0019-9958(86)80033-x","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T16:43:56Z","timestamp":1115397836000},"page":"170-184","source":"Crossref","is-referenced-by-count":80,"title":["Sorting jordan sequences in linear time using level-linked search trees"],"prefix":"10.1016","volume":"68","author":[{"given":"Kurt","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Rosenstiehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1974","series-title":"The design and analysis of computer algorithms","author":"Aho","key":"10.1016\/S0019-9958(86)80033-X_bib1"},{"key":"10.1016\/S0019-9958(86)80033-X_bib2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(86)80033-X_bib3","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 P-Q tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80033-X_bib4","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of a data structure for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(86)80033-X_bib5","first-page":"195","article-title":"Problem P35","volume":"21","author":"Edelsbrunner","year":"1983","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80033-X_bib6","first-page":"75","article-title":"A depth-first search characterization of planarity","volume":"13","author":"de Fraysseix","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0019-9958(86)80033-X_bib7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","article-title":"How good is the information theory bound in sorting?","volume":"1","author":"Fredman","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80033-X_bib8","first-page":"120","article-title":"Intersecting a line and a simple polygon","volume":"22","author":"Hoffmann","year":"1984","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80033-X_bib9","series-title":"Proc. Assoc. Comput. Mach. Sympos. on Comput. Geom.","first-page":"196","article-title":"Sorting Jordan sequences in linear time","author":"Hoffmann","year":"1985"},{"key":"10.1016\/S0019-9958(86)80033-X_bib10","first-page":"85","article-title":"Planarity testing in V log V steps: Extended abstract","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0019-9958(86)80033-X_bib11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(86)80033-X_bib12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddleston","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(86)80033-X_bib13","unstructured":"Iri, M., private communication."},{"key":"10.1016\/S0019-9958(86)80033-X_bib14","series-title":"Theory of Graphs: Internat. Sympos.","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/S0019-9958(86)80033-X_bib15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(81)90101-0","article-title":"Hysterical B-trees","volume":"12","author":"Maier","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0019-9958(86)80033-X_bib16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","article-title":"Nearly optimal binary search trees","volume":"5","author":"Mehlhorn","year":"1975","journal-title":"Acta Inform."},{"year":"1984","series-title":"Data Structures and Efficient Algorithms, Vol. 1: Sorting and Searching","author":"Mehlhorn","key":"10.1016\/S0019-9958(86)80033-X_bib17"},{"key":"10.1016\/S0019-9958(86)80033-X_bib18","series-title":"Graph Theory and Combinatorics","first-page":"259","article-title":"Planar permutations defined by two intersecting Jordan curves","author":"Rosenstiehl","year":"1984"},{"key":"10.1016\/S0019-9958(86)80033-X_bib19","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(86)80033-X_bib20","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588680033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999588680033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T12:54:36Z","timestamp":1548507276000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999588680033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["S001999588680033X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80033-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"type":"print","value":"0019-9958"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}