{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:44:22Z","timestamp":1701135862259},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,19]],"date-time":"2009-12-19T00:00:00Z","timestamp":1261180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s00453-009-9380-6","type":"journal-article","created":{"date-parts":[[2009,12,18]],"date-time":"2009-12-18T12:53:12Z","timestamp":1261140792000},"page":"890-937","source":"Crossref","is-referenced-by-count":7,"title":["Finding a Minimum-depth Embedding of a Planar Graph in O(n 4) Time"],"prefix":"10.1007","volume":"60","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,19]]},"reference":[{"key":"9380_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"9380_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17, 53\u201376 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9380_CR3","doi-asserted-by":"crossref","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 5(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"issue":"5","key":"9380_CR4","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"9380_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.7155\/jgaa.00114","volume":"9","author":"E. Di Giacomo","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Computing radial drawings on the minimum number of circles. J. Graph Algorithms Appl. 9, 365\u2013389 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"9380_CR6","first-page":"147","volume":"2","author":"D. Dolev","year":"1984","unstructured":"Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Adv. Comput. Res. 2, 147\u2013161 (1984)","journal-title":"Adv. Comput. Res."},{"key":"9380_CR7","series-title":"LNCS","first-page":"359","volume-title":"ESA\u201907","author":"F. Kammer","year":"2007","unstructured":"Kammer, F.: Determining the smallest k such that g is k-outerplanar. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA\u201907. LNCS, vol. 4698, pp. 359\u2013370. Springer, Berlin (2007)"},{"key":"9380_CR8","series-title":"LNCS","first-page":"397","volume-title":"Graph Drawing \u201905","author":"M. Pizzonia","year":"2005","unstructured":"Pizzonia, M.: Minimum depth graph embeddings and quality of the drawings: An experimental analysis. In: Healy, P., Nikolov, N.S. (eds.) Graph Drawing \u201905. LNCS, vol. 3843, pp. 397\u2013408. Springer, Berlin (2005)"},{"key":"9380_CR9","series-title":"LNCS","first-page":"356","volume-title":"ESA \u201900","author":"M. Pizzonia","year":"2000","unstructured":"Pizzonia, M., Tamassia, R.: Minimum depth graph embedding. In: Paterson, M. (ed.) ESA \u201900. LNCS, vol. 1879, pp. 356\u2013367. Springer, Berlin (2000)"},{"issue":"1","key":"9380_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser.\u00a0B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory, Ser.\u00a0B"},{"issue":"3","key":"9380_CR11","first-page":"362","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest path with positive integer weights in linear time. J.\u00a0ACM 46(3), 362\u2013394 (1999)","journal-title":"J.\u00a0ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9380-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9380-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9380-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:05Z","timestamp":1559123105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9380-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,19]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9380-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,19]]}}}