{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:21:05Z","timestamp":1760440865840},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_4","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:05Z","timestamp":1269882725000},"page":"35-46","source":"Crossref","is-referenced-by-count":10,"title":["Optimal Area Algorithm for Planar Polyline Drawings"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Le Sa\u00ebc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"C. Batini","year":"1988","unstructured":"C. Batini,, G. di Battista, and R. Tamassia. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man, and Cybernetics, 18(1):61\u201379, 1988.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the visualisation of graphs. Prentice Hall, 1999.","key":"4_CR2"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. In Theoret. Comput. Sci, volume 61, pages 175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. In Inform. Process. Lett., volume 41, pages 1\u20137, 1992.","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"N. Bonichon, B. Le Sa\u00ebc, and M. Mosbah. Orthogonal drawings based on the stratification of planar graphs. Technical Report RR-1246-00, LaBRI, 2000.","key":"4_CR5","DOI":"10.1016\/S1571-0653(05)80118-0"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","volume-title":"International Colloquium on Automata, Languages and Programming 2002 (ICALP\u201902)","author":"N. Bonichon","year":"2002","unstructured":"N. Bonichon, B. Le Sa\u00ebc, and M. Mosbah. Wagner\u2019s theorem on realizers. In International Colloquium on Automata, Languages and Programming 2002 (ICALP\u201902), LNCS, to appear."},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-46648-7_12","volume-title":"Drawing planar graphs with circular arcs","author":"C. C. Cheng","year":"1999","unstructured":"C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Drawing planar graphs with circular arcs. In Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes in Computer Science, pages 117\u2013126. Springer-Verlag, 1999."},{"unstructured":"Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu. Orderly spanning trees with applications to graph encoding and graph drawing. In Proc. 12th Symp. Discrete Algorithms, pages 506\u2013515. ACM and SIAM, 2001.","key":"4_CR8"},{"unstructured":"N. Chiba, T. Yamanouchi, and T. Nishizeki. Linear algorithms for convex drawings of planar graphs. Progress in Graph Theory, pages 153\u2013173, 1984.","key":"4_CR9"},{"doi-asserted-by":"crossref","unstructured":"Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, and Hsueh-I Lu. Compact encodings of planar graphs via canonical ordering and multiple parentheses. In Proc. 25th International Colloquium on Automata, Languages, and Programming (ICALP\u201998), volume 1443, pages 118\u2013129, 1998.","key":"4_CR10","DOI":"10.1007\/BFb0055046"},{"key":"4_CR11","series-title":"Lect Notes Comput Sci","first-page":"254","volume-title":"Drawing high degree graphs with low bend numbers","author":"U. F\u00f6\u03b2meier","year":"1996","unstructured":"U. F\u00f6\u03b2meier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes in Computer Science, pages 254\u2013266. Springer-Verlag, 1996."},{"doi-asserted-by":"crossref","unstructured":"H. De Fraysseix, J. Pach, and J. Pollack. Small sets supporting fary embeddings of planar graphs. In 20th Annual ACM Symp. on Theory of Computing, pages 426\u2013433, 1988.","key":"4_CR12","DOI":"10.1145\/62212.62254"},{"key":"4_CR13","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 J. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Planar polyline drawings with good angular resolution","author":"C. Gutwenger","year":"1998","unstructured":"C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In S. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes in Computer Science, pages 167\u2013182. Springer-Verlag, 1998."},{"doi-asserted-by":"crossref","unstructured":"G. Kant. Hexagonal grid drawings. In In Proc 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci, 1992.","key":"4_CR15","DOI":"10.1007\/3-540-56402-0_53"},{"key":"4_CR16","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":"4_CR17","series-title":"Research Report","volume-title":"Quasi-orthogonal drawing of planar graphs","author":"G. W. Klau","year":"1998","unstructured":"Gunnar W. Klau and Petra Mutzel. Quasi-orthogonal drawing of planar graphs. Research Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany, May 1998."},{"doi-asserted-by":"crossref","unstructured":"M. Chrobak and S. Nakano. Minimum-width grid drawings of plane graphs. In Graph Drawing (Proc. GD\u2019 94), pages 104\u2013110, 1995.","key":"4_CR18","DOI":"10.1007\/3-540-58950-3_361"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"P. Rosenstiehl and R.E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1:343\u2013353, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"W. Schnyder. Planar graphs and poset dimension. Order, 5:323\u2013343, 1989.","journal-title":"Order"},{"unstructured":"W. Schnyder. Embedding planar graphs on the grid. Proc. 1st ACM-SIAM Symp. Discrete Algorithms, pages 138\u2013148, 1990.","key":"4_CR21"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36379-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T14:49:22Z","timestamp":1558968562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}