{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:04:13Z","timestamp":1725494653564},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410041"},{"type":"electronic","value":"9783540452539"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45253-2_33","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:06:25Z","timestamp":1194969985000},"page":"356-367","source":"Crossref","is-referenced-by-count":6,"title":["Minimum Depth Graph Embedding"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Pizzonia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"33_CR1","unstructured":"D. Alberts, C. Gutwenger, P. Mutzel, and S. N\u00e4her. AGD-Library: A library of algorithms for graph drawing. In Proc. Workshop on Algorithm Engineering, pages 112\u2013123, 1997."},{"issue":"4","key":"33_CR2","doi-asserted-by":"crossref","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":"33_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":"33_CR4","doi-asserted-by":"crossref","unstructured":"G. D. Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed size. In Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes Comput. Sci. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46648-7_31"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In Workshop Algorithms Data Struct. (WADS\u201997), volume 1272 of Lecture Notes Comput. Sci., pages 331\u2013344. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63307-3_72"},{"issue":"1","key":"33_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM Journal on Computing, 17(1):53\u201376, Feb. 1988.","journal-title":"SIAM Journal on Computing"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.3230190107","volume":"19","author":"D. Bienstock","year":"1989","unstructured":"D. Bienstock and C. L. Monma. Optimal enclosing regions in planar graphs. Networks, 19:79\u201394, 1989.","journal-title":"Networks"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"D. Bienstock and C. L. Monma. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93\u2013109, 1990.","journal-title":"Algorithmica"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 236\u2013247. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-63938-1_66"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. Lecture Notes in Computer Science, 1533, 1998.","DOI":"10.1007\/3-540-49381-6_11"},{"key":"33_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","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":"33_CR12","unstructured":"G. Di Battista et al. Graph Drawing Toolkit. University of Rome III, Italy. http:\/\/-www.dia.uniroma3.it\/~gdt\/"},{"key":"33_CR13","doi-asserted-by":"crossref","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."},{"issue":"6","key":"33_CR14","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764\u20131811, 1998.","journal-title":"SIAM J. Comput."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"W. Didimo and G. Liotta. Computing orthogonal drawings in a variable embedding setting. In Algorithms and Computation (Proc. ISAAC\u2019 98), volume 1533 of Lecture Notes Comput. Sci., pages 79\u201388. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-49381-6_10"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 254\u2013266. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021809"},{"key":"33_CR17","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Computing. to appear."},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In Graph Drawing (Proc. GD\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 286\u2013297. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_384"},{"issue":"4","key":"33_CR19","first-page":"549","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. A CM, 21(4):549\u2013568, 1974.","journal-title":"J. A CM"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, S. Leipert, and P. Mutzel. Pitfalls of using PQ-Trees in automatic graph drawing. In Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 193\u2013204. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_62"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33\u201359, 1996","journal-title":"Algorithmica"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In IPCO: 7th Integer Programming and Combinatorial Optimization Conference, volume 1610 of Lecture Notes Comput. Sci. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48777-8_23"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"H. Lauer, M. Ettrich, and K. Soukup. GraVis-system demonstration. In Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 344\u2013349. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_79"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. In IPCO: 7th Integer Programming and Combinatorial Optimization Conference, volume 1610 of Lecture Notes Comput. Sci. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48777-8_27"},{"issue":"3","key":"33_CR25","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":"33_CR26","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."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45253-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:51:32Z","timestamp":1556952692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45253-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410041","9783540452539"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45253-2_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}