{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:07Z","timestamp":1725643567765},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_40","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"427-432","source":"Crossref","is-referenced-by-count":2,"title":["Upward Planarity Testing of Embedded Mixed Graphs"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2009)","edition":"2"},{"issue":"12","key":"40_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"},{"issue":"3","key":"40_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.comgeo.2008.02.001","volume":"41","author":"C. Binucci","year":"2008","unstructured":"Binucci, C., Didimo, W., Giordano, F.: Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom.\u00a041(3), 230\u2013246 (2008)","journal-title":"Comput. Geom."},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","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"},{"issue":"4","key":"40_CR5","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. Discrete Math.\u00a023(4), 1842\u20131899 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7155\/jgaa.00068","volume":"7","author":"W. Didimo","year":"2003","unstructured":"Didimo, W., Pizzonia, M.: Upward embeddings and orientations of undirected planar graphs. Journal of Graph Algorithms and Applications\u00a07(2), 221\u2013241 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"40_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00067","volume":"7","author":"M. Eiglsperger","year":"2003","unstructured":"Eiglsperger, M., Eppinger, F., Kaufmann, M.: An approach for mixed upward planarization. Journal of Graph Algorithms and Applications\u00a07(2), 203\u2013220 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order\u00a012, 109\u2013133 (1995)","journal-title":"Order"},{"issue":"2","key":"40_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 Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:35:21Z","timestamp":1555893321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}