{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:37Z","timestamp":1725524617419},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_24","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"254-265","source":"Crossref","is-referenced-by-count":4,"title":["A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs"],"prefix":"10.1007","author":[{"given":"Aimal","family":"Rextin","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Healy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 152\u2013164. Springer, Heidelberg (2002)"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P. Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Battista, G.D., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Battista, G.D., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Battista, G.D., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"24_CR5","unstructured":"Demetrescu, C., Finocchi, I., Italiano, G.: Handbook of Graph Theory. In: Yellen, J., Gross, J.L. (eds.) Dynamic Graph Algorithms. CRC Press Series, in Discrete Mathematics and Its Applications, vol.\u00a010.2 (2003) ISBN 1-58488-090-2"},{"key":"24_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Didimo, W.: Computing upward planar drawings using switch-regularity heuristics. In: SOFSEM, pp. 117\u2013126 (2005)","DOI":"10.1007\/978-3-540-30577-4_15"},{"key":"24_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)"},{"issue":"2","key":"24_CR9","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."},{"issue":"2","key":"24_CR10","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 planar drawing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar DAGs. In: Proceedings Graph Drawing. pp. 298\u2013306 (1994)","DOI":"10.1007\/3-540-58950-3_385"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jagm.1996.0044","volume":"21","author":"R. Tamassia","year":"1996","unstructured":"Tamassia, R.: On-line planar graph embedding. J. Algorithms\u00a021(2), 201\u2013239 (1996)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:35Z","timestamp":1558109195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}