{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:39:24Z","timestamp":1742989164031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_14","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"203-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Upward and\u00a0Orthogonal Planarity are W[1]-Hard Parameterized by\u00a0Treewidth"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8204-1268","authenticated-orcid":false,"given":"Bart M. P.","family":"Jansen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3012-7240","authenticated-orcid":false,"given":"Liana","family":"Khazaliya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9436-7310","authenticated-orcid":false,"given":"Kirill","family":"Simonov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1137\/060670146","volume":"23","author":"O Amini","year":"2009","unstructured":"Amini, O., Huc, F., P\u00e9rennes, S.: On the path-width of planar graphs. SIAM J. Discret. Math. 23(3), 1311\u20131316 (2009). https:\/\/doi.org\/10.1137\/060670146","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"GD Battista","year":"1998","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs, 1st edn. Prentice Hall PTR, Upper Saddle River (1998)","edition":"1"},{"issue":"6","key":"14_CR3","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). https:\/\/doi.org\/10.1007\/BF01188716","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR4","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). https:\/\/doi.org\/10.1137\/S0097539794279626","journal-title":"SIAM J. Comput."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-662-53174-7_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Biedl","year":"2016","unstructured":"Biedl, T.: Triangulating planar graphs while keeping the pathwidth small. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 425\u2013439. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_30"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Fink, S.D., Rutter, I.: Synchronized planarity with applications to constrained planarity problems. In: Mutzel, P., Pagh, R., Herman, G. (eds.) 29th Annual European Symposium on Algorithms, ESA 2021, 6\u20138 September 2021, Lisbon, Portugal (Virtual Conference). LIPIcs, vol. 204, pp. 19:1\u201319:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.19","DOI":"10.4230\/LIPIcs.ESA.2021.19"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16:1\u201316:46 (2016). https:\/\/doi.org\/10.1145\/2738054","DOI":"10.1145\/2738054"},{"issue":"1\u20132","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00228-4","journal-title":"Theor. Comput. Sci."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-031-15914-5_7","volume-title":"Graph-Theoretic Concepts in Computer Science - WG 2022","author":"HL Bodlaender","year":"2022","unstructured":"Bodlaender, H.L., Cornelissen, G., van der Wegen, M.: Problems hard for treewidth but easy for stable gonality. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 84\u201397. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_7"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Groenland, C., Nederlof, J., Swennenhuis, C.M.F.: Parameterized problems complete for nondeterministic FPT time and logarithmic space. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7\u201310 February 2022, pp. 193\u2013204. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00027","DOI":"10.1109\/FOCS52979.2021.00027"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-35802-0_39","volume-title":"Graph Drawing and Network Visualization","author":"G Br\u00fcckner","year":"2019","unstructured":"Br\u00fcckner, G., Himmel, M., Rutter, I.: An SPQR-tree-like embedding representation for upward planarity. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 517\u2013531. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_39"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-30140-0_16","volume-title":"Algorithms \u2013 ESA 2004","author":"H Chan","year":"2004","unstructured":"Chan, H.: A parameterized algorithm for upward planarity testing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 157\u2013168. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_16"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C.N., Simonov, K.: Parameterized algorithms for upward planarity. In: Goaoc, X., Kerber, M. (eds.) 38th International Symposium on Computational Geometry, SoCG 2022, 7\u201310 June 2022, Berlin, Germany. LIPIcs, vol. 224, pp. 26:1\u201326:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.26","DOI":"10.4230\/LIPIcs.SoCG.2022.26"},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764\u20131811 (1998). https:\/\/doi.org\/10.1137\/S0097539794262847","journal-title":"SIAM J. Comput."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.jcss.2021.11.004","volume":"125","author":"E Di Giacomo","year":"2022","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125, 129\u2013148 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2021.11.004","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR17","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. Discret. Math. 23(4), 1842\u20131899 (2009). https:\/\/doi.org\/10.1137\/070696854","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-031-22203-0_12","volume-title":"Graph Drawing and Network Visualization - GD 2022","author":"W Didimo","year":"2022","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Ortali, G.: Rectilinear planarity of partial 2-trees. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 157\u2013172. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_12"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Ortali, G., Patrignani, M.: Optimal orthogonal drawings of planar 3-graphs in linear time. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5\u20138 January 2020, pp. 806\u2013825. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.49","DOI":"10.1137\/1.9781611975994.49"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2018.08.003","volume":"99","author":"W Didimo","year":"2019","unstructured":"Didimo, W., Liotta, G., Patrignani, M.: Hv-planarity: algorithms and complexity. J. Comput. Syst. Sci. 99, 72\u201390 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2018.08.003","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2021.101854","volume":"103","author":"F Frati","year":"2022","unstructured":"Frati, F.: Planar rectilinear drawings of outerplanar graphs in linear time. Comput. Geom. 103, 101854 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101854","journal-title":"Comput. Geom."},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Fulek, R., T\u00f3th, C.D.: Atomic embeddability, clustered planarity, and thickenability. J. ACM 69(2), 13:1\u201313:34 (2022). https:\/\/doi.org\/10.1145\/3502264","DOI":"10.1145\/3502264"},{"issue":"2","key":"14_CR23","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). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0010-x","journal-title":"Algorithmica"},{"issue":"4","key":"14_CR25","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974). https:\/\/doi.org\/10.1145\/321850.321852","journal-title":"J. ACM"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"MD Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planning of single-source acyclic digraphs. SIAM J. Comput. 25(2), 291\u2013311 (1996). https:\/\/doi.org\/10.1137\/S0097539792235906","journal-title":"SIAM J. Comput."},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models (The Book Grow Out of a Dagstuhl Seminar, April 1999). Lecture Notes in Computer Science, vol. 2025. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8","DOI":"10.1007\/3-540-44969-8"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013). https:\/\/doi.org\/10.1002\/jgt.21630","journal-title":"J. Graph Theory"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.jcss.2023.02.007","volume":"135","author":"G Liotta","year":"2023","unstructured":"Liotta, G., Rutter, I., Tappini, A.: Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135, 125\u2013144 (2023). https:\/\/doi.org\/10.1016\/j.jcss.2023.02.007","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing, LNSC, vol. 12. World Scientific, Singapore (2004). https:\/\/doi.org\/10.1142\/5648","DOI":"10.1142\/5648"},{"key":"14_CR31","unstructured":"Patrignani, M.: Planarity testing and embedding. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 1\u201342. Chapman and Hall\/CRC, Boca Raton (2013). https:\/\/cs.brown.edu\/people\/rtamassi\/gdhandbook\/chapters\/planarity.pdf"},{"issue":"3","key":"14_CR32","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). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Tamassia, R. (ed.): Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013). https:\/\/www.crcpress.com\/Handbook-of-Graph-Drawing-and-Visualization\/Tamassia\/9781584884125","DOI":"10.1201\/b15385"},{"key":"14_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106083","volume":"169","author":"JC Urschel","year":"2021","unstructured":"Urschel, J.C., Wellens, J.: Testing gap k-planarity is np-complete. Inf. Process. Lett. 169, 106083 (2021). https:\/\/doi.org\/10.1016\/j.ipl.2020.106083","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:04:00Z","timestamp":1704715440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}