{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:12Z","timestamp":1725561192050},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_24","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:46:01Z","timestamp":1280393161000},"page":"259-272","source":"Crossref","is-referenced-by-count":4,"title":["Graph Embedding with Minimum Depth and Maximum External Face"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"C. Batini","year":"1986","unstructured":"Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng.\u00a0SE-12(4), 538\u2013546 (1986)","journal-title":"IEEE Trans. Soft. Eng."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. The Journal of Systems and Software\u00a04, 163\u2013173 (1984)","journal-title":"The Journal of Systems and Software"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entityrelationship diagrams. Journal of Systems and Software\u00a04, 163\u2013173 (1984)","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"24_CR4","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 computational complexity of embedding planar graphs to minimize certain distance measures. Algorithmica\u00a05(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Computer and System Sciences\u00a030, 54\u201376 (1985)","journal-title":"J. Computer and System Sciences"},{"key":"24_CR6","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintanance of triconnected components with SPQR-trees. Algorithmica\u00a015, 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"24_CR9","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)"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2002","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Computing\u00a031(2), 601\u2013625 (2002)","journal-title":"SIAM J. Computing"},{"key":"24_CR11","unstructured":"Graph drawing toolkit: An object-oriented library for handling and drawing graphs, \n                    \n                      http:\/\/www.dia.uniroma3.it\/gdt"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"24_CR13","unstructured":"Liotta, G., Vargiu, F., Di Battista, G.: Orthogonal drawings with the minimum number of bends. In: Proceedings of the 6th Canadian Conference on Computational Geometry, pp. 281\u2013286. University of Saskatchewan (1994)"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01940648","volume":"16","author":"K. Mehlhorn","year":"1996","unstructured":"Mehlhorn, K., Mutzel, P.: On the embedding phase of the Hopcoft and Tarjan planarity testing algorithm. Algorithmica\u00a016(2), 233\u2013242 (1996)","journal-title":"Algorithmica"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-45655-4_52","volume-title":"Computing and Combinatorics","author":"P. Mutzel","year":"2002","unstructured":"Mutzel, P., Weiskircher, R.: Bend minimization in orthogonal drawings using integer programming. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 484\u2013493. Springer, Heidelberg (2002)"},{"key":"24_CR16","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)"},{"issue":"3","key":"24_CR17","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."},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern.\u00a0SMC-18(1), 61\u201379 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"24_CR20","unstructured":"Weiskircher, R.: New Applications of SPQR-Trees in Graph Drawing. PhD thesis, Universit\u00e4t des Saarlandes (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:22:38Z","timestamp":1552836158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}