{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:56Z","timestamp":1725890096670},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_84","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"391-402","source":"Crossref","is-referenced-by-count":22,"title":["The three-phase method: A unified approach to orthogonal graph drawing"],"prefix":"10.1007","author":[{"given":"Therese C.","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Brendan P.","family":"Madden","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"40_CR1","volume-title":"Orthogonal Graph Visualization: The Three-Phase Method With Applications","author":"T. Biedl","year":"1997","unstructured":"T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method With Applications. PhD thesis, RUTCOR, Rutgers University, May 1997."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In 2nd European Symposium on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 124\u2013135. Springer Verlag, 1994.","DOI":"10.1007\/BFb0049394"},{"key":"40_CR3","unstructured":"T. Biedl and M. Kaufmann. Static and incremental high-degree orthogonal drawings. In 5th European Symposium on Algorithms, Lecture Notes in Computer Science. Springer Verlag, 1997. To appear."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"F. Brandenburg, editor. Symposium on Graph Drawing 95, volume 1027 of Lecture Notes in Computer Science. Springer Verlag, 1996.","DOI":"10.1007\/BFb0021783"},{"issue":"5","key":"40_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications, 4(5):235\u2013282, 1994.","journal-title":"Comp. Geometry: Theory and Applications"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In North [12], pages 155\u2013168.","DOI":"10.1007\/3-540-62495-3_45"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Brandenburg [4], pages 254\u2013266.","DOI":"10.1007\/BFb0021809"},{"key":"40_CR8","doi-asserted-by":"crossref","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":"40_CR9","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":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner\/Wiley & Sons, Stuttgart\/Chicester, 1990."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"K. Miriyala, S. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In 6th Intl. IEEE Workshop Computer-Aided Software Eng., 1993.","DOI":"10.1109\/CASE.1993.634832"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Languages and Computing, pages 183\u2013210, June 1995.","DOI":"10.1006\/jvlc.1995.1010"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"S. North, editor. Symposium on Graph Drawing 96, volume 1190 of Lecture Notes in Computer Science. Springer Verlag, 1997.","DOI":"10.1007\/3-540-62495-3"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"A. Papakostas, J. M. Six, and I. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In North [12], pages 371\u2013386.","DOI":"10.1007\/3-540-62495-3_61"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I. Tollis. Issues in interactive orthogonal graph drawing. In Brandenburg [4], pages 419\u2013430.","DOI":"10.1007\/BFb0021825"},{"key":"40_CR15","unstructured":"A. Papakostas and I. Tollis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science. Springer Verlag, 1997. To appear."},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I. Tollis. A pairing technique for area-efficient orthogonal drawings. In North [12], pages 355\u2013370.","DOI":"10.1007\/3-540-62495-3_60"},{"key":"40_CR17","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 orientation of planar graphs. Discrete Computational Geometry, 1:343\u2013353, 1986.","journal-title":"Discrete Computational Geometry"},{"issue":"3","key":"40_CR18","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 Journal of Computing, 16(3):421\u2013444, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Systems, Man and Cybernetics, 18(1), 1988.","DOI":"10.1109\/21.87055"},{"key":"40_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry, 1:321\u2013341, 1986.","journal-title":"Discrete Computational Geometry"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"R. Tamassia and I. Tollis, editors. DIMACS International Workshop, Graph Drawing 94, volume 894 of Lecture Notes in Computer Science. Springer Verlag, 1995.","DOI":"10.1007\/3-540-58950-3"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T21:03:26Z","timestamp":1587071006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}