{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:32:59Z","timestamp":1760441579551,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_25","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"339-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extending Upward Planar Graph Drawings"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"54:1","DOI":"10.1145\/3239561","volume":"14","author":"P Angelini","year":"2018","unstructured":"Angelini, P., et al.: Windrose planarity: embedding graphs with direction-constrained edges. ACM Trans. Algorithms 14(4), 54:1\u201354:24 (2018)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/s00453-016-0128-9","volume":"77","author":"P Angelini","year":"2017","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing for embedded planar graphs. Algorithmica 77(4), 1022\u20131059 (2017)","journal-title":"Algorithmica"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-319-50106-2_37","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Beyond level planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 482\u2013495. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_37"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.019","volume":"571","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Roselli, V.: The importance of being proper: (in clustered-level planarity and T-level planarity). Theor. Comput. Sci. 571, 1\u20139 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2629341","volume":"11","author":"P Angelini","year":"2015","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"25_CR6","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 32(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"issue":"6","key":"25_CR7","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 12(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR8","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. 27(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR9","first-page":"133","volume":"59","author":"C Binucci","year":"2016","unstructured":"Binucci, C., Didimo, W.: Computing quasi-upward planar drawings of mixed graphs. Comput. J. 59(1), 133\u2013150 (2016)","journal-title":"Comput. J."},{"key":"25_CR10","unstructured":"Binucci, C., Lozzo, G.D., Giacomo, E.D., Didimo, W., Mchedlidze, T., Patrignani, M.: Upward book embeddings of st-graphs. In: Barequet, G., Wang, Y. (eds.) 35th Symposium on Computational Geometry (SoCG 2019), LIPIcs (2019)"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.comgeo.2013.08.003","volume":"47","author":"F Brandenburg","year":"2014","unstructured":"Brandenburg, F.: Upward planar drawings on the standing and the rolling cylinders. Comput. Geom. 47(1), 25\u201341 (2014)","journal-title":"Comput. Geom."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) SODA 2017, pp. 2000\u20132011. SIAM (2017)","DOI":"10.1137\/1.9781611974782.130"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-319-73915-1_36","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., et al.: Planar L-drawings of directed graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 465\u2013478. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_36"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-12340-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Dorbec, P., Kratochv\u00edl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139\u2013151. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_12"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-03841-4_12","volume-title":"Graph Drawing","author":"S Chaplick","year":"2013","unstructured":"Chaplick, S., Fulek, R., Klav\u00edk, P.: Extending partial representations of circle graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 131\u2013142. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_12"},{"issue":"8","key":"25_CR16","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1007\/s00453-017-0322-4","volume":"80","author":"S Chaplick","year":"2018","unstructured":"Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. Algorithmica 80(8), 2286\u20132323 (2018)","journal-title":"Algorithmica"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F.: Extending upward planar graph drawings. CoRR, abs\/1902.06575 (2019)","DOI":"10.1007\/978-3-030-24766-9_25"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-04414-5_7","volume-title":"Graph Drawing and Network Visualization","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 92\u2013105. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_7"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"25_CR20","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom. 7, 381\u2013401 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"25_CR22","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. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"25_CR23","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4), 466\u2013492 (2013)","journal-title":"Comput. Geom."},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-33090-2_58","volume-title":"Algorithms \u2013 ESA 2012","author":"P Klav\u00edk","year":"2012","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Krawczyk, T., Walczak, B.: Extending partial representations of function graphs and permutation graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 671\u2013682. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_58"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s00453-016-0133-z","volume":"77","author":"P Klav\u00edk","year":"2017","unstructured":"Klav\u00edk, P., et al.: Extending partial representations of proper and unit interval graphs. Algorithmica 77(4), 1071\u20131104 (2017)","journal-title":"Algorithmica"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85\u2013101 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"25_CR27","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00453-016-0186-z","volume":"78","author":"P Klav\u00edk","year":"2017","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T., Vyskocil, T.: Extending partial representations of interval graphs. Algorithmica 78(3), 945\u2013967 (2017)","journal-title":"Algorithmica"},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-319-73915-1_34","volume-title":"Graph Drawing and Network Visualization","author":"B Klemz","year":"2018","unstructured":"Klemz, B., Rote, G.: Ordered level planarity, geodesic planarity and bi-monotonicity. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 440\u2013453. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_34"},{"issue":"5","key":"25_CR29","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Int. J. Found. Comput. Sci. 17(5), 1061\u20131070 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"25_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1093\/comjnl\/bxw064","volume":"60","author":"A Rextin","year":"2017","unstructured":"Rextin, A., Healy, P.: Dynamic upward planarity testing of single source embedded digraphs. Comput. J. 60(1), 45\u201359 (2017)","journal-title":"Comput. J."},{"issue":"3","key":"25_CR31","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:54:23Z","timestamp":1710266063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}