{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:16Z","timestamp":1725544036383},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_6","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"58-69","source":"Crossref","is-referenced-by-count":0,"title":["Switch-Regular Upward Planar Embeddings of Trees"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Aimal","family":"Rextin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"6_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":"6_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":"6_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 Journal on Computing\u00a027, 132\u2013169 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR4","unstructured":"Binucci, C., Giacomo, E.D., Didimo, W., Rextin, A.: Switch-regular upward planarity testing of directed trees. Technical Report RT-001-09, DIEI, Univ. Perugia (2009), \n                    \n                      http:\/\/www.diei.unipg.it\/rt\/rt_frames.htm"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"S.S. Bridgeman","year":"2000","unstructured":"Bridgeman, S.S., Battista, G.D., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom.\u00a016(1), 53\u201393 (2000)","journal-title":"Comput. Geom."},{"key":"6_CR6","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)"},{"issue":"3-4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom.\u00a011(3-4), 187\u2013208 (1998)","journal-title":"Comput. Geom."},{"key":"6_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":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-37623-2_6","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Liotta, G.: Upward planarity checking: \u201cfaces are more than polygon\u201d. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 72\u201386. Springer, Heidelberg (1999)"},{"issue":"2","key":"6_CR10","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":"6_CR11","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)"},{"issue":"2","key":"6_CR12","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 Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1142\/S0129054106004285","volume":"17","author":"P. Healy","year":"2006","unstructured":"Healy, P., Lynch, K.: Fixed-parameter tractable algorithms for testing upward planarity. International Journal of Foundations of Computer Science\u00a017(5), 1095\u20131114 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"6_CR14","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 Journal on Computing\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR15","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.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 298\u2013306. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T06:01:47Z","timestamp":1552370507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}