{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:54:06Z","timestamp":1778295246558,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540584346","type":"print"},{"value":"9783540487944","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0049394","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:42:35Z","timestamp":1141670555000},"page":"24-35","source":"Crossref","is-referenced-by-count":40,"title":["A better heuristic for orthogonal graph drawings"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goos","family":"Kant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"4_CR1","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Algorithms for Automatic Graph Drawing: An Annotated Bibliography, to appear in Comp. Geom.: Theory and Applications, Preliminary version also available via anonymous ftp from wilma.cs.brown.edu (128.148.33.66), files \/pub\/gdbiblio.tex.Z and \/pub\/gdbiblio.ps.Z."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, In: Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151\u2013162.","DOI":"10.1007\/3-540-57155-8_244"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. of Computer and System Sciences 30 (1985), pp. 54\u201376.","journal-title":"J. of Computer and System Sciences"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P.F. Dietz, and D.D. Sleator, Two algorithms for maintaining order in a list, in: Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 365\u2013372.","DOI":"10.1145\/28395.28434"},{"key":"4_CR5","volume-title":"Rectilinear Planar Drawings with Few Bends in Each Edge","author":"S. Even","year":"1993","unstructured":"S. Even, and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Manuscript, Faculty of Comp. Science, the Technion, Haifa (Israel), 1993."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even, and R.E. Tarjan, Computing an st-numbering, Th. Comp. Science 2 (1976), pp. 436\u2013441.","journal-title":"Th. Comp. Science"},{"key":"4_CR7","first-page":"130","volume-title":"Graph-Theoretic Concepts in Computer Science (16th Workshop WG'90)","author":"M. Formann","year":"1992","unstructured":"M. Formann, and F. Wagner, The VLSI layout problem in various embedding models, Graph-Theoretic Concepts in Computer Science (16th Workshop WG'90), Springer-Verlag, Berlin\/Heidelberg, 1992, pp. 130\u2013139."},{"key":"4_CR8","volume-title":"Tech. Report CS-94-10","author":"A. Garg","year":"1994","unstructured":"A. Garg, and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Tech. Report CS-94-10, Dept. of Comp. Science, Brown University, Providence, 1994."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft, and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), pp. 135\u2013158.","journal-title":"SIAM J. Comput."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"G. Kant, Drawing planar graphs using the lmc-ordering, Extended Abstract in: Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101\u2013110. Extended and revised version in: G. Kant, Algorithms for Drawing Planar Graphs, PhD thesis, Dept. of Computer Science, Utrecht University, 1993.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"4_CR11","first-page":"129","volume-title":"Advances in Computer Research, Vol. 2: VLSI Theory","author":"M.R. Kramer","year":"1992","unstructured":"M.R. Kramer, and J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits. In: F.P. Preparata (Ed.), Advances in Computer Research, Vol. 2: VLSI Theory, JAI Press, Reading, MA, 1992, pp. 129\u2013146."},{"key":"4_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Th. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Teubner\/Wiley & Sons, Stuttgart\/Chichester, 1990."},{"key":"4_CR13","unstructured":"A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, Theory of Graphs, Int. Symp. Rome (1966), pp. 215\u2013232."},{"key":"4_CR14","doi-asserted-by":"crossref","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, Discr. and Comp. Geometry 1 (1986), pp. 343\u2013353.","journal-title":"Discr. and Comp. Geometry"},{"key":"4_CR15","unstructured":"M. Sch\u00e4ffter, Drawing graphs on rectangular grids, Discr. Appl. Math. (to appear)."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. Storer","year":"1984","unstructured":"J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181\u2013212.","journal-title":"Networks"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"4_CR18","unstructured":"R. Tamassia, and I.G. Tollis, Efficient embedding of planar graphs in linear time, Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495\u2013498, 1987."},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"R. Tamassia, I.G. Tollis, and J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inf. Proc. Letters 39 (1991), pp. 35\u201340.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T01:58:20Z","timestamp":1586743100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0049394","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}