{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:05Z","timestamp":1770972425054,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0304-3975(95)00257-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"175-193","source":"Crossref","is-referenced-by-count":128,"title":["Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems"],"prefix":"10.1016","volume":"172","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(95)00257-X_BIB1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230170306","article-title":"A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph","volume":"17","author":"Bhasker","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01762117","article-title":"A linear algorithm to find a rectanular dual of a planar triangulated graph","volume":"3","author":"Bhaskar","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB3","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","article-title":"Arbority and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(95)00257-X_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(95)00257-X_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"10","author":"de Fraysseix","year":"1990","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S0304-3975(95)00257-X_BIB6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0218020","article-title":"Optimal parallel 5-coloring of planar graphs","volume":"18","author":"Hagerup","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(95)00257-X_BIB7","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1137\/0222072","article-title":"On finding the rectangular duals of planar triangulated graphs","volume":"22","author":"He","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(95)00257-X_BIB8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/BF01189069","article-title":"An efficient parallel algorithm for finding rectangular dual duals of planar triangular graphs","volume":"13","author":"He","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB9","series-title":"Proc. Graph Drawing (GD'95)","first-page":"287","article-title":"Grid embedding of 4-connected plane graphs","volume":"Vol. 1027","author":"He","year":"1995"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB10","series-title":"Proc. 19th Ann. IEEE Design Automation Conf.","first-page":"253","article-title":"The planar package planner for system designers","author":"Heller","year":"1982"},{"issue":"4","key":"10.1016\/S0304-3975(95)00257-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. ACM"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB12","series-title":"Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science","first-page":"101","article-title":"Drawing planar graphs using the lmc-ordering","author":"Kant","year":"1992"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB13","series-title":"Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Science (WG'93)","first-page":"411","article-title":"A more compact visibility representation","volume":"Vol. 790","author":"Kant","year":"1993"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","article-title":"Rectangular dual of planar graphs","volume":"15","author":"Ko\u017ami\u0144ski","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB15","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF01840399","article-title":"A theory of rectangular dual graphs","volume":"5","author":"Lai","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB16","series-title":"Proc. 19th Ann. IEEE Design Automation Conf.","first-page":"263","article-title":"On finding most optimal rectangular package plans","author":"Mailing","year":"1982"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comp. Geometry"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","article-title":"Planar graphs and poset dimension","volume":"5","author":"Schnyder","year":"1989","journal-title":"Orders"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB19","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discr. Alg.","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"key":"10.1016\/S0304-3975(95)00257-X_BIB20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comp. Geometry"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759500257X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759500257X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:56:47Z","timestamp":1555419407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759500257X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S030439759500257X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(95)00257-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}