{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:26:40Z","timestamp":1766377600318},"reference-count":51,"publisher":"Oxford University Press (OUP)","funder":[{"name":"MIUR project AMANDA \u2018Algorithmics for MAssive and Networked DAta\u2019","award":["2012C4E3KT_001"],"award-info":[{"award-number":["2012C4E3KT_001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxv082","type":"journal-article","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T23:57:28Z","timestamp":1444435048000},"page":"bxv082","source":"Crossref","is-referenced-by-count":3,"title":["Computing Quasi-Upward Planar Drawings of Mixed Graphs"],"prefix":"10.1093","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,10,8]]},"reference":[{"key":"2016010708374342000_bxv082v1.1","doi-asserted-by":"crossref","unstructured":"Binucci C. and Didimo W. (2014) Quasi-upward Planar Drawings of Mixed graphs with Few Bends: Heuristics and Exact Methods. WALCOM, LNCS 8344, pp. 291\u2013302. Springer.","DOI":"10.1007\/978-3-319-04657-0_28"},{"key":"2016010708374342000_bxv082v1.2","unstructured":"Di Battista G. , Eades P. , Tamassia R. and Tollis I.G. (1999) Graph Drawing. Prentice Hall, Upper Saddle River, NJ."},{"key":"2016010708374342000_bxv082v1.3","doi-asserted-by":"crossref","unstructured":"Didimo W. and Liotta G. (2007) Mining Graph Data. In Cook, D.J. and Holder, L.B. (eds), Graph Visualization and Data Mining, pp. 35\u201364. Wiley.","DOI":"10.1002\/9780470073049.ch3"},{"key":"2016010708374342000_bxv082v1.4","doi-asserted-by":"crossref","unstructured":"J\u00fcnger M. and Mutzel P. (eds) (2003) Graph Drawing Software. Springer.","DOI":"10.1007\/978-3-642-18638-7"},{"key":"2016010708374342000_bxv082v1.5","doi-asserted-by":"crossref","unstructured":"Kaufmann M. and Wagner D. (eds) (2001) Drawing Graphs. Springer.","DOI":"10.1007\/3-540-44969-8"},{"key":"2016010708374342000_bxv082v1.6","doi-asserted-by":"crossref","unstructured":"Sugiyama K. (2002) Graph Drawing and Applications for Software and Knowledge Engineers. World Scientific.","DOI":"10.1142\/4902"},{"key":"2016010708374342000_bxv082v1.7","doi-asserted-by":"crossref","unstructured":"Tamassia R. (ed.) (2013) Handbook of Graph Drawing and Visualization. CRC Press.","DOI":"10.1201\/b15385"},{"key":"2016010708374342000_bxv082v1.8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794277123"},{"key":"2016010708374342000_bxv082v1.9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279626"},{"key":"2016010708374342000_bxv082v1.10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/S0097539792235906","article-title":"Upward planarity testing of single-source acyclic digraphs","volume":"25","author":"Hutton","year":"1996","journal-title":"SIAM J. Comput."},{"key":"2016010708374342000_bxv082v1.11","doi-asserted-by":"crossref","unstructured":"Papakostas A. (1995) Upward Planarity Testing of Outerplanar Dags. GD 1994, LNCS 894, pp. 298\u2013306. Springer.","DOI":"10.1007\/3-540-58950-3_385"},{"key":"2016010708374342000_bxv082v1.12","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/070696854","article-title":"Upward spirality and upward planarity testing","volume":"23","author":"Didimo","year":"2009","journal-title":"SIAM J. Discrete Math."},{"key":"2016010708374342000_bxv082v1.13","unstructured":"Samee M.A.H. and Rahman M.S. (2007) Upward Planar Drawings of Series-parallel Digraphs with Maximum Degree Three. WALCOM 2012, pp. 28\u201345. Bangladesh Academy of Sciences (BAS)."},{"key":"2016010708374342000_bxv082v1.14","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/BF01188716","article-title":"Upward drawings of triconnected digraphs","volume":"6","author":"Bertolazzi","year":"1994","journal-title":"Algorithmica"},{"key":"2016010708374342000_bxv082v1.15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.02.004"},{"key":"2016010708374342000_bxv082v1.16","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. GD 2008, LNCS 5417, pp. 254\u2013265. Springer.","DOI":"10.1007\/978-3-642-00219-9_24"},{"key":"2016010708374342000_bxv082v1.17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0083-x"},{"key":"2016010708374342000_bxv082v1.18","doi-asserted-by":"crossref","unstructured":"Chan H. (2004) A Parameterized Algorithm for Upward Planarity testing. ESA 2004, LNCS 3221, pp. 157\u201368. Springer.","DOI":"10.1007\/978-3-540-30140-0_16"},{"key":"2016010708374342000_bxv082v1.19","doi-asserted-by":"crossref","unstructured":"Chimani M. and Zeranski R. (2012) Upward Planarity Testing Via SAT. GD 2012, LNCS 7704, pp. 248\u2013259. Springer.","DOI":"10.1007\/978-3-642-36763-2_22"},{"key":"2016010708374342000_bxv082v1.20","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004285"},{"key":"2016010708374342000_bxv082v1.21","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00135"},{"key":"2016010708374342000_bxv082v1.22","doi-asserted-by":"crossref","unstructured":"Chimani M. and Zeranski R. (2013) Upward Planarity Testing: A Computational Study. GD 2013, LNCS 8242, pp. 13\u201324. Springer.","DOI":"10.1007\/978-3-319-03841-4_2"},{"key":"2016010708374342000_bxv082v1.23","doi-asserted-by":"crossref","unstructured":"Auer C. , Bachmaier C. , Brandenburg F.-J. and Glei\u00dfner A. (2012) Classification of Planar Upward Embedding. GD 2011, LNCS 7034, pp. 415\u2013426. Springer.","DOI":"10.1007\/978-3-642-25878-7_39"},{"key":"2016010708374342000_bxv082v1.24","doi-asserted-by":"crossref","unstructured":"Auer C. , Bachmaier C. , Brandenburg F.-J. , Glei\u00dfner A. and Hanauer K. (2012) The Duals of Upward Planar Graphs on Cylinders. WG 2012, LNCS 7551, pp. 103\u2013113. Springer.","DOI":"10.1007\/978-3-642-34611-8_13"},{"key":"2016010708374342000_bxv082v1.25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.08.003"},{"key":"2016010708374342000_bxv082v1.26","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00324"},{"key":"2016010708374342000_bxv082v1.27","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.07.002"},{"key":"2016010708374342000_bxv082v1.28","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.11.007"},{"key":"2016010708374342000_bxv082v1.29","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00241"},{"key":"2016010708374342000_bxv082v1.30","doi-asserted-by":"crossref","first-page":"2.2:2.1","DOI":"10.1145\/1671970.1671975","article-title":"Layer-free upward crossing minimization","volume":"15","author":"Chimani","year":"2010","journal-title":"ACM J. Exp. Algorithmics"},{"key":"2016010708374342000_bxv082v1.31","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00220"},{"key":"2016010708374342000_bxv082v1.32","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00067"},{"key":"2016010708374342000_bxv082v1.33","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.02.001"},{"key":"2016010708374342000_bxv082v1.34","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9373-z"},{"key":"2016010708374342000_bxv082v1.35","doi-asserted-by":"crossref","unstructured":"Binucci C. and Didimo W. (2012) Upward Planarity Testing of Embedded Mixed Graphs. GD 2011, LNCS 7034, pp. 427\u2013432. Springer.","DOI":"10.1007\/978-3-642-25878-7_40"},{"key":"2016010708374342000_bxv082v1.36","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J. and Gutin G. (2009) Digraphs: Theory, Algorithms and Applications (2nd edn). Springer.","DOI":"10.1007\/978-1-84800-998-1"},{"key":"2016010708374342000_bxv082v1.37","doi-asserted-by":"publisher","DOI":"10.2307\/2321858"},{"key":"2016010708374342000_bxv082v1.38","first-page":"78","article-title":"Forced orientation of graphs","volume":"32","author":"Farzad","year":"2006","journal-title":"Bull. Iran. Math. Soc."},{"key":"2016010708374342000_bxv082v1.39","doi-asserted-by":"crossref","unstructured":"Mchedlidze T. and Symvonis A. (2010) Unilateral Orientation of Mixed Graphs. SOFSEM 2010, LNCS 5901, pp. 588\u2013599. Springer.","DOI":"10.1007\/978-3-642-11266-9_49"},{"key":"2016010708374342000_bxv082v1.40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2014.01.002"},{"key":"2016010708374342000_bxv082v1.41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.015"},{"key":"2016010708374342000_bxv082v1.42","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00322"},{"key":"2016010708374342000_bxv082v1.43","doi-asserted-by":"crossref","unstructured":"Karp R.M. (1972) Reducibility Among Combinatorial Problems. Symposium on the Complexity of Computer Computations the IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2016010708374342000_bxv082v1.44","unstructured":"Garey M.R. and Johnson D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co."},{"key":"2016010708374342000_bxv082v1.45","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","article-title":"A minimax theorem for directed graphs","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. Lond. Math. Soc."},{"key":"2016010708374342000_bxv082v1.46","doi-asserted-by":"crossref","unstructured":"Stamm H. (1990) On Feedback Problems in Planar Digraphs, WG 1990, LNCS 484, pp. 79\u201389. Springer.","DOI":"10.1007\/3-540-53832-1_33"},{"key":"2016010708374342000_bxv082v1.47","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90079-O"},{"key":"2016010708374342000_bxv082v1.48","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00068"},{"key":"2016010708374342000_bxv082v1.49","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00127"},{"key":"2016010708374342000_bxv082v1.50","unstructured":"Di Battista G. and Didimo W. (2013) Gdtoolkit. In Tamassia, R. (ed.), Handbook of Graph Drawing and Visualization, pp. 571\u2013597. CRC Press."},{"key":"2016010708374342000_bxv082v1.51","doi-asserted-by":"crossref","unstructured":"Frati F. , Kaufmann M. , Pach J. , T\u00f3th C.D. and Wood D.R. (2013) On the Upward planarity of Mixed Plane Graphs. GD 2013, LNCS 8242, pp. 1\u201312. Springer.","DOI":"10.1007\/978-3-319-03841-4_1"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/1\/133\/7902753\/bxv082.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T23:25:38Z","timestamp":1653261938000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,8]]},"references-count":51,"alternative-id":["10.1093\/comjnl\/bxv082"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv082","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,8]]}}}