{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:53Z","timestamp":1725890093981},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_74","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"309-315","source":"Crossref","is-referenced-by-count":0,"title":["GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Leonforte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista and W. Didimo. Computing Orthogonal Drawing with the Minimum Number of Bends. In Proc. Workshop Algorithms Data Struct., 1997 (to appear).","DOI":"10.1007\/3-540-63307-3_72"},{"key":"30_CR2","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. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR3","first-page":"415","volume":"36","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, G. Liotta, M. Strani and F. Vargiu. Diagram Server. Proceedings of Advances Visual Interfaces, 36:415\u2013417, 1992.","journal-title":"Proceedings of Advances Visual Interfaces"},{"issue":"5","key":"30_CR4","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956\u2013997, 1996.","journal-title":"SIAM J. Comput."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-58950-3_379","volume":"894","author":"M. Fr\u00f6hlich","year":"1994","unstructured":"M. Fr\u00f6hlich and M.Werner. Demonstration of the Interactive Graph-Visualization System da Vinci. Lecture Notes in Computer Science, 894:266\u2013269, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Submitted to SIAM Journal on Computing, 1995.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"30_CR7","unstructured":"A. Garg and R. Tamassia. GIOTT03D: A System for Visualizing Hierarchical Structures in 3D. In Symposium Graph Drawing, GD'96, LNCS, 1190, 1996"},{"key":"30_CR8","unstructured":"M. Himsolt. The Graphlet System. In Symposium Graph Drawing, GD'96, LNCS, 1190, 1996"},{"key":"30_CR9","doi-asserted-by":"publisher","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:135\u2013158, 1973.","journal-title":"SIAM J. Comput."},{"key":"30_CR10","unstructured":"D.E. Knut. The Stanford GraphBase: a platform for combinatorial algorithms. Stanford University, 1993."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96\u2013102, 1995.","journal-title":"Commun. ACM"},{"key":"30_CR12","unstructured":"T. Nishizeld and N. Chiba-Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988."},{"key":"30_CR13","unstructured":"A. Scott. A Survey of Graph Drawing Systems. Technical Report 95-06., Department of Computer Science University of Newcastle, Australia, 1995."},{"issue":"3","key":"30_CR14","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(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"key":"30_CR15","first-page":"1230","volume":"CAS-36","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. on Circuits and Systems CAS-36:1230\u20131234, 1987.","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"30_CR16","unstructured":"Tom Sawyer Software. Tom Sawyer Graph Layout Toolkit. Tom Sawyer Software Corporation, 1824B Fourth STreet, Berkley, CA94710, USA."}],"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_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:17:44Z","timestamp":1555715864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}