{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:37Z","timestamp":1725761137125},"publisher-location":"Cham","reference-count":17,"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_1","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["On the Upward Planarity of Mixed Plane Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"1_CR1","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"},{"issue":"6","key":"1_CR2","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":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., 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":"1_CR4","series-title":"Lecture Notes in Computer Science","first-page":"427","volume-title":"GD 2011","author":"C. Binucci","year":"2011","unstructured":"Binucci, C., Didimo, W.: Upward planarity testing of embedded mixed graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 427\u2013432. Springer, Heidelberg (2011)"},{"issue":"9","key":"1_CR5","doi-asserted-by":"publisher","first-page":"716","DOI":"10.2307\/2321858","volume":"87","author":"F. Boesch","year":"1980","unstructured":"Boesch, F., Tindell, R.: Robbins\u2019s theorem for mixed multigraphs. Amer. Math. Monthly\u00a087(9), 716\u2013719 (1980)","journal-title":"Amer. Math. Monthly"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1002\/net.3230150409","volume":"15","author":"F. Chung","year":"1985","unstructured":"Chung, F., Garey, M., Tarjan, R.: Strongly connected orientations of mixed multigraphs. Networks\u00a015(4), 477\u2013484 (1985)","journal-title":"Networks"},{"issue":"4","key":"1_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. Discrete Math.\u00a023(4), 1842\u20131899 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00067","volume":"7","author":"M. Eiglsperger","year":"2003","unstructured":"Eiglsperger, M., Kaufmann, M., Eppinger, F.: An approach for mixed upward planarization. J. Graph Algorithms Appl.\u00a07(2), 203\u2013220 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"1_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."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Klein, K., Kupke, J., Leipert, S., Mutzel, P.: A new approach for visualizing uml class diagrams. In: Diehl, S., Stasko, J., Spencer, S. (eds.) SOFTVIS, pp. 179\u2013188. ACM (2003)","DOI":"10.1145\/774833.774859"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01194253","volume":"45","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Kuplinsky, J., de Werra, D.: Mixed graph colorings. Math. Meth. Oper. Res.\u00a045(1), 145\u2013160 (1997)","journal-title":"Math. Meth. Oper. Res."},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1142\/S0129054106004285","volume":"17","author":"P. Healy","year":"2006","unstructured":"Healy, P., Lynch, K.: Two fixed-parameter tractable algorithms for testing upward planarity. Int. J. Found. Comput. Sci.\u00a017(5), 1095\u20131114 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"1_CR13","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 planarity testing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J. Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J.\u00a0Graph Theory\u00a046(1), 39\u201347 (2004)","journal-title":"J.\u00a0Graph Theory"},{"key":"1_CR15","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":"1_CR16","unstructured":"Patrignani, M.: Finding bimodal and acyclic orientations of mixed planar graphs is NP-complete. Tech. Rep. RT-DIA-188-2011, Dept. Comp. Sci. Autom., Roma Tre Univ. (2011)"},{"key":"1_CR17","first-page":"20","volume":"6","author":"J.N. Sotskov","year":"1976","unstructured":"Sotskov, J.N., Tanaev, V.S.: Chromatic polynomial of a mixed graph. Vestsi Akademii Navuk BSSR. Ser. Fiz. Mat. Navuk\u00a06, 20\u201323 (1976)","journal-title":"Vestsi Akademii Navuk BSSR. Ser. Fiz. Mat. Navuk"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:58:22Z","timestamp":1558735102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}