{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:05Z","timestamp":1725552185041},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_36","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"397-408","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Pizzonia","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Alberts, D., Gutwenger, C., Mutzel, P., N\u00e4her, S.: AGD-Library: A library of algorithms for graph drawing. In: Proc. Workshop on Algorithm Engineering, pp. 112\u2013123 (1997)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, p. 297. Springer, Heidelberg (1999)"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-63307-3_72","volume-title":"Algorithms and Data Structures","author":"P. Bertolazzi","year":"1997","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 331\u2013344. Springer, Heidelberg (1997)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEETC: IEEE Transactions on Computers\u00a049 (2000)","DOI":"10.1109\/12.868028"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica\u00a05(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-49381-6_11","volume-title":"Algorithms and Computation","author":"U. Brandes","year":"1998","unstructured":"Brandes, U., Wagner, D.: Dynamic grid embedding with few bends and changes. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, p. 89. Springer, Heidelberg (1998)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63938-1_66","volume-title":"Graph Drawing","author":"U. Brandes","year":"1997","unstructured":"Brandes, U., Wagner, D.: A Bayesian paradigm for dynamic graph layout. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 236\u2013247. Springer, Heidelberg (1997)"},{"key":"36_CR8","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl.\u00a07, 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"36_CR10","unstructured":"Di Battista, G., et al: Graph Drawing Toolkit. University of Rome III, Italy, http:\/\/www.dia.uniroma3.it\/~gdt\/"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-49381-6_10","volume-title":"Algorithms and Computation","author":"W. Didimo","year":"1998","unstructured":"Didimo, W., Liotta, G.: Computing orthogonal drawings in a variable embedding setting. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 79\u201388. Springer, Heidelberg (1998)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-24595-7_24","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: Graph embedding with minimum depth and maximum external face. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 259\u2013272. Springer, Heidelberg (2004)"},{"issue":"4","key":"36_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica\u00a016(1), 33\u201359 (1996)","journal-title":"Algorithmica"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-63938-1_62","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Pitfalls of using PQ-Trees in automatic graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 193\u2013204. Springer, Heidelberg (1997)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"G.W. Klau","year":"1999","unstructured":"Klau, G.W., Mutzel, P.: Optimal compaction of orthogonal grid drawings. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, p. 304. Springer, Heidelberg (1999)"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-63938-1_79","volume-title":"Graph Drawing","author":"H. Lauer","year":"1997","unstructured":"Lauer, H., Ettrich, M., Soukup, K.: GraVis - system demonstration. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 344\u2013349. Springer, Heidelberg (1997)"},{"issue":"1","key":"36_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M. Patrignani","year":"2001","unstructured":"Patrignani, M.: On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications\u00a019(1), 47\u201367 (2001)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR21","unstructured":"Pizzonia, M.: Engineering of Graph Drawing Algorithms for Applications. PhD thesis, Dipartimento di Informatica e Sistemistica, University degli Studi \u201cLa Sapienza\u201d di Roma (2001)"},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-45253-2_33","volume-title":"Algorithms - ESA 2000","author":"M. Pizzonia","year":"2000","unstructured":"Pizzonia, M., Tamassia, R.: Minimum depth graph embedding. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 356\u2013367. Springer, Heidelberg (2000)"},{"key":"36_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 435\u2013446. Springer, Heidelberg (1996)"},{"issue":"3","key":"36_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:14Z","timestamp":1605643454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11618058_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}