{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:27:52Z","timestamp":1747805272041},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_26","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"328-342","source":"Crossref","is-referenced-by-count":16,"title":["Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"T. Calamoneri and A. Sterbini. Drawing 2-, 3-, and 4-colorable graphs in o(n 2) volume. In S. North, editor, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 53\u201362. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_37"},{"key":"26_CR2","unstructured":"T.M. Chan. A near-linear area bound for drawing binary trees. In Proc. 10th Annu. ACM-SIAM Sympos. on Discrete Algorithms., pages 161\u2013168, 1999."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl., 7(3):211\u2013223, 1997.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319\u2013328, 1996.","DOI":"10.1145\/237218.237401"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"11","author":"M. Chrobak","year":"1998","unstructured":"Marek Chrobak and Shin ichi Nakano. Minimum-width grid drawings of plane graphs. Comput. Geom. Theory Appl., 11:29\u201354, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. F. Cohen","year":"1997","unstructured":"R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17:199\u2013208, 1997.","journal-title":"Algorithmica"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Proc. 20th ACMSymp os. Theory Comput., pages 426\u2013433, 1988.","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"26_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Reinhard Diestel. Graph theory. Graduate Texts in Mathematics. 173. Springer, 2000. Transl. from the German. 2nd ed.","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D. R. Wood. On the Parameterized Complexity of Layered Graph Drawing. ESA, 1\u201312, 2001.","DOI":"10.1007\/3-540-45848-4_1"},{"key":"26_CR12","unstructured":"Stefan Felsner. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order-accepted to appear."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A. Garg","year":"1996","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl., 6:333\u2013356, 1996.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annu. European Sympos. Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 12\u201326. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61680-2_43"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Michael Juenger and Sebastian Leipert. Level planar embedding in linear time. In J. Kratochvil, editor, Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes Comput. Sci., pages 72\u201381. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46648-7_7"},{"key":"26_CR16","unstructured":"G. Kant. A new method for planar graph drawings on a grid. In Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci., pages 101\u2013110, 1992."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4\u201332, 1996.","journal-title":"Algorithmica"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"J\u00e1nos Pach, Torsten Thiele, and G\u00e9za T\u00f3th. Three-dimensional grid drawings of graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 47\u201351. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_49"},{"key":"26_CR19","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990."},{"key":"26_CR20","unstructured":"W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138\u2013148, 1990."},{"issue":"5","key":"26_CR21","first-page":"502","volume":"13","author":"W. Schnyder","year":"1992","unstructured":"W. Schnyder and W. T. Trotter. Convex embeddings of 3-connected plane graphs. Abstracts of the AMS, 13(5):502, 1992.","journal-title":"Abstracts of the AMS"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:28:26Z","timestamp":1556738906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}