{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:29:23Z","timestamp":1760441363117},"reference-count":22,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1093\/comjnl\/bxw064","type":"journal-article","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T01:33:49Z","timestamp":1473384829000},"page":"45-59","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Upward Planarity Testing of Single Source Embedded Digraphs"],"prefix":"10.1093","volume":"60","author":[{"given":"Aimal","family":"Rextin","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Healy","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"2017012305400537000_60.1.45.1","unstructured":"Di Battista, G. , Eades, P. , Tamassia, R. and Tollis, I.G. (1999) Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall."},{"key":"2017012305400537000_60.1.45.2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744565"},{"key":"2017012305400537000_60.1.45.3","doi-asserted-by":"crossref","unstructured":"Ahmed, A. et al . (2005) Geomi: Geometry for maximum insight. In Graph Drawing, 468\u2013479. Springer Berlin Heidelberg.","DOI":"10.1007\/11618058_42"},{"key":"2017012305400537000_60.1.45.4","doi-asserted-by":"crossref","unstructured":"Bekos, M. A. and Symvonis, A. (2005) Bler: A boundary labeller for technical drawings. In Graph Drawing, 503\u2013504. Springer Berlin Heidelberg.","DOI":"10.1007\/11618058_45"},{"key":"2017012305400537000_60.1.45.5","doi-asserted-by":"crossref","unstructured":"Tamassia, R. , Palazzi, B. and Papamanthou, C. (2008) Graph drawing for security visualization. In Graph Drawing, 2\u201313. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-00219-9_2"},{"key":"2017012305400537000_60.1.45.6","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.40"},{"key":"2017012305400537000_60.1.45.7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794277123"},{"key":"2017012305400537000_60.1.45.8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188716"},{"key":"2017012305400537000_60.1.45.9","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00127"},{"key":"2017012305400537000_60.1.45.10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/S0097539792235906","article-title":"Upward planar drawing of single-source acyclic digraphs","volume":"25","author":"Hutton","year":"1996","journal-title":"SIAM J. Comput."},{"key":"2017012305400537000_60.1.45.11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279626"},{"key":"2017012305400537000_60.1.45.12","first-page":"117","article-title":"Upward spirality and upward planarity testing","volume":"05","author":"Didimo","year":"2005","journal-title":"Graph Draw."},{"key":"2017012305400537000_60.1.45.13","doi-asserted-by":"crossref","unstructured":"Papakostas, A. (1994) Upward planarity testing of outerplanar DAGs. In Graph Drawing, 298\u2013306. Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-58950-3_385"},{"key":"2017012305400537000_60.1.45.14","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00241"},{"key":"2017012305400537000_60.1.45.15","doi-asserted-by":"crossref","unstructured":"Rextin, A. and Healy, P. (2008) A fully dynamic algorithm to test the upward planarity of single-source embedded digraphs. In Graph Drawing, 254\u2013265. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-00219-9_24"},{"key":"2017012305400537000_60.1.45.16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90123-5"},{"key":"2017012305400537000_60.1.45.17","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90008-2"},{"key":"2017012305400537000_60.1.45.18","doi-asserted-by":"crossref","unstructured":"Didimo, W. (2005) Computing upward planar drawings using switch-regularity heuristics. In SOFSEM 2005: Theory and Practice of Computer Science, 117\u2013126. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-30577-4_15"},{"key":"2017012305400537000_60.1.45.19","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0083-x"},{"key":"2017012305400537000_60.1.45.20","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0044"},{"key":"2017012305400537000_60.1.45.21","unstructured":"Hutton, M. (1990) Upward planar drawing of single source acyclic digraphs. Master's Thesis, University of Waterloo."},{"key":"2017012305400537000_60.1.45.22","doi-asserted-by":"crossref","unstructured":"Bender, M.A. , Cole, R. , Demaine, E.D. , Farach-Colton, M. and Zito, J. (2002) Two simplified algorithms for maintaining order in a list. In ESA 2002, 152\u2013164. Springer-Verlag, London, UK.","DOI":"10.1007\/3-540-45749-6_17"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/60\/1\/45\/10329266\/bxw064.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:44:02Z","timestamp":1568364242000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,8]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,23]]},"published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1093\/comjnl\/bxw064"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw064","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,8]]}}}