{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T02:19:56Z","timestamp":1775355596318,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00014-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"33-55","source":"Crossref","is-referenced-by-count":16,"title":["Bipartite permutation graphs with application to the minimum buffer size problem"],"prefix":"10.1016","volume":"74","author":[{"given":"Ten-Hwang","family":"Lai","sequence":"first","affiliation":[]},{"given":"Shu-Shang","family":"Wei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00014-5_BIB1","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\/S0166-218X(96)00014-5_BIB2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/69.87978","article-title":"Optimal secondary storage access sequence for performing relational join","volume":"1","author":"Fotouhi","year":"1989","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0166-218X(96)00014-5_BIB3","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(96)00014-5_BIB4","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1995.1014","article-title":"Algorithms for page retrieval and Hamiltonian paths on forward-convex line graphs","volume":"18","author":"Lai","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(96)00014-5_BIB5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/32.21722","article-title":"Heuristics for join processing using nonclustered indexes","volume":"15","author":"Omiecinski","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0166-218X(96)00014-5_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/3148.3325","article-title":"Use of graph-theoretic models for optimal relational database accesses to perform join","volume":"10","author":"Pramanik","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0166-218X(96)00014-5_BIB7","article-title":"Two dimensional partial orders","author":"Spinrad","year":"1982"},{"key":"10.1016\/S0166-218X(96)00014-5_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00014-5_BIB9","article-title":"Permutation graph structure and algorithms","author":"Stewart","year":"1985"},{"issue":"B","key":"10.1016\/S0166-218X(96)00014-5_BIB10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","article-title":"A structure theorem for the consecutive 1's property","volume":"12","author":"Tucker","year":"1972","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(96)00014-5_BIB11","article-title":"Design and analysis of algorithms for processing queries in database systems","author":"Wei","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:22Z","timestamp":1556666782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X96000145"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00014-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}