{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:15Z","timestamp":1725664755267},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_143","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:19Z","timestamp":1330292239000},"page":"333-344","source":"Crossref","is-referenced-by-count":9,"title":["Optimal orthogonal drawings of triconnected plane graphs"],"prefix":"10.1007","author":[{"given":"Therese C.","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"unstructured":"T. Biedl, Optimal Orthogonal Drawings of Connected Plane Graphs, Rutcor Research Report 11\u201396.3","key":"29_CR1"},{"unstructured":"T. Biedl, Optimal Orthogonal Drawings of Triconnected Plane Graphs, Rutcor Research Report 8\u201396.3","key":"29_CR2"},{"doi-asserted-by":"crossref","unstructured":"T. Biedl, New Lower Bounds for Orthogonal Graph Drawing, Proc. Graph Drawing '95 (GD'95), Lecture Notes in Comp. Science 1027, pp. 28\u201339. Also: Rutcor Research Report 19\u201395.3","key":"29_CR3","DOI":"10.1007\/BFb0021788"},{"doi-asserted-by":"crossref","unstructured":"T. Biedl, and G. Kant, A better heuristic for orthogonal graph drawings, Proc. of the 2nd European Symp. on Algorithms (ESA 94), Lecture Notes in Comp. Science 855, Springer-Verlag (1994), pp. 124\u2013135. Also: Rutcor Research Report 12\u201395.3","key":"29_CR4","DOI":"10.1007\/BFb0049394"},{"unstructured":"M. Formann, and F. Wagner, The VLSI layout problem in various embedding models, Graph-Theoretic Concepts in Comp. Science (16th WG'90), Springer-Verlag (1992), pp. 130\u2013139.","key":"29_CR5"},{"unstructured":"A. Garg, and R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proc. Graph Drawing ' 94 (GD'94), Lect. Notes in Comp. Science 894, Springer-Verlag (1994), pp. 286\u2013297.","key":"29_CR6"},{"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 1992, pp. 101\u2013110. Revised version to appear in Algorithmica, special issue on Graph Drawing.","key":"29_CR7","DOI":"10.1109\/SFCS.1992.267814"},{"key":"29_CR8","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. Advances in Computer Research, Vol. 2: VLSI Theory, F.P. Preparata (Ed.), JAI Press, Reading, MA, 1992, pp. 129\u2013146."},{"key":"29_CR9","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. Comp. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comp"},{"unstructured":"R. Tamassia, and I.G. Tollis, Efficient embedding of planar graphs in linear time, Proc. IEEE Int. Symp. on Circuits and Systems (1987), pp. 495\u2013498.","key":"29_CR10"},{"issue":"9","key":"29_CR11","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia, and I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circ. Syst. 36 (9), 1989, pp. 1230\u20131234.","journal-title":"IEEE Trans. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_143.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:03Z","timestamp":1605647163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_143","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}