{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T07:51:09Z","timestamp":1772005869628,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)00076-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"69-91","source":"Crossref","is-referenced-by-count":22,"title":["A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid"],"prefix":"10.1016","volume":"81","author":[{"family":"Yanpei Liu","sequence":"first","affiliation":[]},{"given":"Aurora","family":"Morgana","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00076-0_bib1","series-title":"Proc. IEEE 26th Ann. Symp. Foundations of Computer Science","first-page":"186","article-title":"Multi-layer grid embedding","author":"Aggarwal","year":"1985"},{"key":"10.1016\/S0166-218X(97)00076-0_bib2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01759038","article-title":"Multi-layer grid embedding for VLSI","volume":"6","author":"Aggarwal","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(97)00076-0_bib3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","article-title":"The complexity of minimizing wire lengths in VLSI layout","volume":"25","author":"Bhatt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00076-0_bib4","series-title":"Planar Graphs: Theory and Algorithms","author":"Chiba","year":"1988"},{"key":"10.1016\/S0166-218X(97)00076-0_bib5","unstructured":"X. Cui, Y. Liu, Efficient algorithms for rectilinear extensions of standard graphs, Acta Math. Appl. Sinica, to appear."},{"key":"10.1016\/S0166-218X(97)00076-0_bib6","first-page":"147","article-title":"Planar embedding of planar graphs","volume":"vol. 2","author":"Dolev","year":"1984"},{"key":"10.1016\/S0166-218X(97)00076-0_bib7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02253293","article-title":"st-numbering the vertices of biconnected graphs","volume":"30","author":"Ebert","year":"1983","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(97)00076-0_bib8","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/S0166-218X(97)00076-0_bib9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing anst-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00076-0_bib10","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. Comput. Mach."},{"key":"10.1016\/S0166-218X(97)00076-0_bib11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1090\/conm\/089\/09","article-title":"Directed graphs and the compaction of IC designs","volume":"89","author":"Jackson","year":"1989","journal-title":"Contemp. Math."},{"key":"10.1016\/S0166-218X(97)00076-0_bib12","series-title":"Theory of Graphs, Internat. Symp.","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1966"},{"key":"10.1016\/S0166-218X(97)00076-0_bib13","article-title":"On the linearity of testing planarity of a graph","author":"Liu","year":"1984"},{"key":"10.1016\/S0166-218X(97)00076-0_bib14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02006222","article-title":"A new approach to the linearity of testing planarity of graphs","volume":"4","author":"Liu","year":"1988","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0166-218X(97)00076-0_bib15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02006104","article-title":"General theoretical results on rectilinear embeddability of graphs","volume":"7","author":"Liu","year":"1991","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0166-218X(97)00076-0_bib16","author":"Liu","year":"1993"},{"key":"10.1016\/S0166-218X(97)00076-0_bib17","series-title":"Embeddability in Graphs","author":"Liu","year":"1995"},{"key":"10.1016\/S0166-218X(97)00076-0_bib18","series-title":"The Four Colour Problem","author":"Ore","year":"1967"},{"key":"10.1016\/S0166-218X(97)00076-0_bib19","article-title":"Linear and planar arrangement of graphs","author":"Shiloach","year":"1976"},{"key":"10.1016\/S0166-218X(97)00076-0_bib20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00076-0_bib21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(85)90052-6","article-title":"Orientations with single source and sink","volume":"10","author":"Szwarcfiter","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00076-0_bib22","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00076-0_bib23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representation of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0166-218X(97)00076-0_bib24","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embedding in linear time","volume":"36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0166-218X(97)00076-0_bib25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00076-0_bib26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality Considerations in VLSI","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000760?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:27:03Z","timestamp":1556666823000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97000760"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00076-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}