{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:49Z","timestamp":1725502069164},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_20","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"195-206","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Upward Planar Subgraphs of Embedded Planar Digraphs"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Giordano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P. Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"issue":"12","key":"20_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"6","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a06(12), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027, 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-30140-0_16","volume-title":"Algorithms \u2013 ESA 2004","author":"H. Chan","year":"2004","unstructured":"Chan, H.: A parameterized algorithm for upward planarity testing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 157\u2013168. Springer, Heidelberg (2004)"},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","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, NJ (1999)"},{"key":"20_CR6","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. Computational Geometry: Theory and Applications\u00a07, 303\u2013326 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"2","key":"20_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7155\/jgaa.00127","volume":"10","author":"W. Didimo","year":"2006","unstructured":"Didimo, W.: Upward planar drawings and switch-regularity heuristics. Journal of Graph Algorithms and Applications\u00a010(2), 259\u2013285 (2006)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11618058_12","volume-title":"Graph Drawing","author":"W. Didimo","year":"2006","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 117\u2013128. Springer, Heidelberg (2006)"},{"key":"20_CR9","volume-title":"Comput. and Intract.","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Comput. and Intract. Freeman and Co, San Francisco (1979)"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Healy, P., Lynch, K.: Fixed-parameter tractable algorithms for testing upward planarity. International Journal of Foundations of Computer Science\u00a017(5) (2006)","DOI":"10.1142\/S0129054106004285"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M.D. Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planarity testing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-58950-3_385","volume-title":"Graph Drawing","author":"A. Papakostas","year":"1995","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar dags. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 298\u2013306. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:49Z","timestamp":1619507749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_20","relation":{},"subject":[]}}