{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:43:45Z","timestamp":1758635025266},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0925-7721(98)00016-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"29-54","source":"Crossref","is-referenced-by-count":38,"title":["Minimum-width grid drawings of plane graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(98)00016-9_BIB1","article-title":"Nice drawings of graphs and of trees are computationally hard","author":"Brandenburg","year":"1998"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00264230","article-title":"Drawing planar graphs nicely","volume":"22","author":"Chiba","year":"1985","journal-title":"Acta Informatica"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB3","series-title":"Progress in Graph Theory","first-page":"153","article-title":"Linear algorithms for convex drawings of planar graphs","author":"Chiba","year":"1984"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB4","doi-asserted-by":"crossref","DOI":"10.1142\/S0218195997000144","article-title":"Convex grid drawings of 3-connected planar graphs","author":"Chrobak","year":"1993"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","article-title":"A linear-time algorithm for drawing a planar graph on a grid","volume":"54","author":"Chrobak","year":"1995","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","article-title":"A note on optimal area algorithms for upward drawings of binary trees","volume":"2","author":"Crescenzi","year":"1992","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB7","series-title":"Proc. 20th Annual Symposium on Theory of Computing","first-page":"426","article-title":"Small sets supporting straight-line embeddings of planar graphs","author":"de Fraysseix","year":"1988"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB8","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"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Automatic graph drawing: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","article-title":"Area requirements and symmetry display of planar upward drawings","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(98)00016-9_BIB11","first-page":"147","article-title":"Planar embeddings of planar graphs","volume":"2","author":"Dolev","year":"1984","journal-title":"Adv. Comput. Res."},{"key":"10.1016\/S0925-7721(98)00016-9_BIB12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0218195993000099","article-title":"Two tree drawing conventions","volume":"3","author":"Eades","year":"1993","journal-title":"Internat. J. of Computational Geometry & Applications"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB13","first-page":"229","article-title":"On straight lines representation of plane graphs","volume":"11","author":"F\u00e1ry","year":"1948","journal-title":"Acta. Sci. Math. Szeged"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB14","series-title":"Proc. 9th Annual ACM Symposium on Computational Geometry","first-page":"359","article-title":"Area-efficient upward tree drawings","author":"Garg","year":"1993"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB15","series-title":"Proc. Graph Drawing '95","article-title":"Grid embedding of 4-connected plane graphs","author":"He","year":"1995"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB16","article-title":"A note on planar graph drawing algorithms","author":"Jones","year":"1991"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB17","series-title":"Proc. 33rd Symposium on Foundations of Computer Science","first-page":"101","article-title":"Drawing planar graphs using the lmc-ordering","author":"Kant","year":"1992"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB18","article-title":"Algorithms for drawing planar graphs","author":"Kant","year":"1993"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB19","series-title":"Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"138","article-title":"Embedding planar graphs in the grid","author":"Schnyder","year":"1990"},{"issue":"5","key":"10.1016\/S0925-7721(98)00016-9_BIB20","article-title":"Convex drawings of planar graphs","volume":"13","author":"Schnyder","year":"1992","journal-title":"Abstracts Amer. Math. Soc."},{"key":"10.1016\/S0925-7721(98)00016-9_BIB21","first-page":"464","article-title":"Convex maps","volume":"2","author":"Stein","year":"1951"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB22","first-page":"743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963"},{"key":"10.1016\/S0925-7721(98)00016-9_BIB23","first-page":"26","article-title":"Bemerkungen zum vierfarbenproblem, Jahresber","volume":"46","author":"Wagner","year":"1936","journal-title":"Deutschen Mathematiker-Vereinigung"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772198000169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772198000169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:26:00Z","timestamp":1555197960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772198000169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0925772198000169"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(98)00016-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}