{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:36Z","timestamp":1759063836741},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"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":9085,"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":[[1988,9]]},"DOI":"10.1016\/0166-218x(88)90032-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"35-46","source":"Crossref","is-referenced-by-count":99,"title":["Trapezoid graphs and their coloring"],"prefix":"10.1016","volume":"21","author":[{"given":"Ido","family":"Dagan","sequence":"first","affiliation":[]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[]},{"given":"Ron Yair","family":"Pinter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90032-7_BIB1","series-title":"Layout Design and Verification","first-page":"132","article-title":"Channel routing","author":"Burstein","year":"1986"},{"key":"10.1016\/0166-218X(88)90032-7_BIB2","article-title":"Extensions of permutation and interval graphs","author":"Corneil","year":"1987","journal-title":"Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0166-218X(88)90032-7_BIB3","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","article-title":"Permutation graphs and transitive graphs","volume":"19","author":"Even","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(88)90032-7_BIB4","series-title":"Interval Orders and Interval Graphs","author":"Fishburn","year":"1985"},{"key":"10.1016\/0166-218X(88)90032-7_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(88)90032-7_BIB6","article-title":"Algorithmic aspects of intersection graphs and representation hypergraphs","author":"Golumbic","year":"1986","journal-title":"Proceedings First International Japan Conference on Graph Theory and Applications"},{"key":"10.1016\/0166-218X(88)90032-7_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","article-title":"Tolerance graphs","volume":"9","author":"Golumbic","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(88)90032-7_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","article-title":"Comparability graphs and intersection graphs","volume":"43","author":"Golumbic","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(88)90032-7_BIB9","series-title":"Surveys in Combinatorics 1985","first-page":"97","article-title":"On greedy algorithms that succeed","author":"Hoffman","year":"1985"},{"key":"10.1016\/0166-218X(88)90032-7_BIB10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(88)90032-7_BIB11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/0212029","article-title":"Optimal placement for river routing","volume":"12","author":"Leiserson","year":"1983","journal-title":"SIAM J Comput."},{"key":"10.1016\/0166-218X(88)90032-7_BIB12","series-title":"Ph.D. Thesis","article-title":"The impact of layer assignment methods on layout algorithms for integrated circuits","author":"Pinter","year":"1982"},{"key":"10.1016\/0166-218X(88)90032-7_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-95432-0_9","article-title":"River routing: Methodology and analysis","author":"Pinter","year":"1983","journal-title":"Proceedings Third Caltech Conference on VLSI"},{"key":"10.1016\/0166-218X(88)90032-7_BIB14","series-title":"Graphs and Order","first-page":"267","article-title":"Parameters of partial orders and graphs: packing, covering and representation","author":"West","year":"1985"},{"key":"10.1016\/0166-218X(88)90032-7_BIB15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:25Z","timestamp":1555134865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0166218X88900327"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90032-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}