{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:25Z","timestamp":1725761125043},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_2","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"13-24","source":"Crossref","is-referenced-by-count":6,"title":["Upward Planarity Testing: A Computational Study"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[]},{"given":"Robert","family":"Zeranski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"2_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., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-36763-2_22","volume-title":"Graph Drawing","author":"M. Chimani","year":"2013","unstructured":"Chimani, M., Zeranski, R.: Upward planarity testing via SAT. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 248\u2013259. Springer, Heidelberg (2013)"},{"issue":"6","key":"2_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0218195900000358","volume":"10","author":"G. Di Battista","year":"2000","unstructured":"Di Battista, G., Garg, A., Liotta, G., Parise, A., Tamassia, R., Tassinari, E., Vargiu, F., Vismara, L.: Drawing directed acyclic graphs: An experimental study. Int. J. of Computational Geometry and Appl.\u00a010(6), 623\u2013648 (2000)","journal-title":"Int. J. of Computational Geometry and Appl."},{"issue":"6","key":"2_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Di Battista","year":"1990","unstructured":"Di Battista, G., Liu, W.P., Rival, I.: Bipartite graphs, upward drawings, and planarity. Information Processing Letters\u00a036(6), 317\u2013322 (1990)","journal-title":"Information Processing Letters"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. on Computing\u00a025, 956\u2013997 (1996)","journal-title":"SIAM J. on Computing"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/070696854","volume":"23","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Giordano, F., Liotta, G.: Upward spirality and upward planarity testing. SIAM J. on Discrete Mathematics\u00a023(4), 1842\u20131899 (2009)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani\u2013Tutte, monotone drawings, and level-planarity. Thirty Essays on Geom. Graph Th., 263\u2013287 (2013)","DOI":"10.1007\/978-1-4614-0110-0_14"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2002","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. on Computing\u00a031(2), 601\u2013625 (2002)","journal-title":"SIAM J. on Computing"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-30577-4_23","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"P. Healy","year":"2005","unstructured":"Healy, P., Lynch, K.: Fixed-parameter tractable algorithms for testing upward planarity. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 199\u2013208. Springer, Heidelberg (2005)"},{"key":"2_CR11","unstructured":"Hutton, M.D., Lubiw, A.: Upward planar drawing of single source acyclic digraphs. In: Proc. SODA 1991, pp. 203\u2013211 (1991)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J. Pach","year":"2004","unstructured":"Pach, J., Toth, G.: Monotone drawings of planar graphs. J. of Graph Theory\u00a046(1), 39\u201347 (2004)","journal-title":"J. of Graph Theory"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(97)00002-3","volume":"7","author":"E. Welzl","year":"1997","unstructured":"Welzl, E., Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry\u00a07, 303\u2013325 (1997)","journal-title":"Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:53:53Z","timestamp":1558749233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}