{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:39:39Z","timestamp":1720201179403},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"vor","delay-in-days":1487,"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":[[2012,7]]},"DOI":"10.1016\/j.tcs.2012.04.036","type":"journal-article","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T14:51:38Z","timestamp":1335624698000},"page":"40-51","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Ordered coloring of grids and related graphs"],"prefix":"10.1016","volume":"444","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Cheilaris","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.04.036_br000005","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","article-title":"Ordered colourings","volume":"142","author":"Katchalski","year":"1995","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.tcs.2012.04.036_br000010","unstructured":"C.E. Leiserson, Area-efficient graph layouts (for VLSI), in: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 270\u2013281."},{"key":"10.1016\/j.tcs.2012.04.036_br000015","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/j.tcs.2012.04.036_br000020","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","article-title":"Optimal node ranking of trees","volume":"28","author":"Iyer","year":"1988","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.tcs.2012.04.036_br000025","unstructured":"A. Pothen, The complexity of optimal elimination trees, Technical Report CS-88-16, Department of Computer Science, Pennsylvania State University, 1988."},{"key":"10.1016\/j.tcs.2012.04.036_br000030","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(89)90025-5","article-title":"Local optimization on graphs","volume":"23","author":"Llewellyn","year":"1989","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.tcs.2012.04.036_br000035","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Approximating treewidth, pathwidth, frontsize, and shortest elimination tree","volume":"18","author":"Bodlaender","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.tcs.2012.04.036_br000040","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/S0895480195282550","article-title":"Rankings of graphs","volume":"11","author":"Bodlaender","year":"1998","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.tcs.2012.04.036_br000045","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S009753979427087X","article-title":"Listing all minimal separators of a graph","volume":"27","author":"Kloks","year":"1998","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.04.036_br000050","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"2004"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751200401X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751200401X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T15:20:42Z","timestamp":1542986442000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751200401X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":10,"alternative-id":["S030439751200401X"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2012.04.036","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}
