{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:43:21Z","timestamp":1742402601949},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_31","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"297-310","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"31_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. K. Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993."},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"C. Batini","year":"1986","unstructured":"C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng., SE-12(4): 538\u2013546, 1986.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"C. Batini, M. Talamo, and R. Tamassia. Computer aided layout of entity-relationship diagrams. Journal of Systems and Software, 4:163\u2013173, 1984.","journal-title":"Journal of Systems and Software"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Proc. 5th Workshop Algorithms Data Struct., volume 1272 of Lecture Notes Comput. Sci., pages 331\u2013344. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63307-3_72"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. manuscript, 1998.","DOI":"10.1007\/3-540-63307-3_72"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Quasi-upward planarity. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 15\u201329. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_2"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl., 9:159\u2013180, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(97)00207-X","volume":"65","author":"T. C. Biedl","year":"1998","unstructured":"T. C. Biedl. Relating bends and size in orthogonal graph drawings. Inform. Process. Lett., 65:111\u2013115, 1998.","journal-title":"Inform. Process. Lett."},{"key":"31_CR9","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013325, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR11","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"U. F\u00f6meier, C. Hess, and M. Kaufmann. On improving orthogonal drawings: The 4M-algorithm. In S. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 125\u2013137. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-37623-2_10"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"U. F\u00f6meier 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 Comput. Sci., pages 254\u2013266. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021809"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"U. F\u00f6meier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 134\u2013145. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_57"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, 1990.","DOI":"10.1007\/978-3-322-92106-2"},{"key":"31_CR16","unstructured":"T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988."},{"issue":"1-2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"A. Papakostas and I. G. Tollis. Algorithms for area-efficient orthogonal drawings. Comput. Geom. Theory Appl., 9(1-2):83\u2013110, 1998. Special Issue on Geometric Representations of Graphs, G. Di Battista and R. Tamassia, editors.","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"J. M. Six, K. G. Kakoulis, and I. G. Tollis. Refinement of orthogonal graph drawings. In S. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 302\u2013315. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-37623-2_23"},{"issue":"3","key":"31_CR19","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."},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"31_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2):135\u2013140, 1981.","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:13:34Z","timestamp":1585934014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_31"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}