Document Open Access Logo

A Fixed-Parameter Algorithm for Extending Upward Planar Drawings

Authors Vera Chekan , Robert Ganian , Viktoriia Korchemna

PDF

File

Thumbnail PDF
PDF
LIPIcs.GD.2026.6.pdf
  • Filesize: 1.07 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Mathematics of computing → Graph algorithms
Keywords
  • upward planar drawings
  • extension problems
  • parameterized complexity

Metrics

Abstract

An upward planar drawing of a directed acyclic graph is a planar drawing where every edge is pointed upward from its tail to head. Upward planar drawings are among the most natural drawing styles of directed graphs and have been researched in a variety of different settings, recently including that of drawing extension. In the drawing extension setting, one asks: given a graph G and a (typically connected) subgraph H of G with a drawing Γ(H), can we complete Γ(H) to a drawing of G? 
Drawing extension problems have been studied for numerous drawing styles; the vast majority of these are NP-hard and a typical approach aimed at circumventing their intractability is to design parameterized algorithms where the parameter measures "how much" of G is still missing from the pre-drawn graph H. Most algorithms obtained within this framework require only a small number of edges to be missing from H in order to remain efficient. In this article, we present a fixed-parameter algorithm for extending upward planar drawings which overcomes this drawback by using the vertex+edge deletion distance as the parameter, thus achieving tractability even for instances with many missing edges. A key ingredient towards our result is a novel characterization of "canonical" sets of missing edges which cross a horizontal line segment in the drawing.

Cite As Get BibTex

Vera Chekan, Robert Ganian, and Viktoriia Korchemna. A Fixed-Parameter Algorithm for Extending Upward Planar Drawings. In 34th International Symposium on Graph Drawing and Network Visualization (GD 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 396, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.GD.2026.6

Author Details

Vera Chekan
  • Humboldt-Universität zu Berlin, Germany
Robert Ganian
  • Algorithms and Complexity Group, TU Wien, Austria
Viktoriia Korchemna
  • University of California, Santa Barbara, CA, USA

Funding

  • Ganian, Robert: Austrian Science Fund (FWF, project 10.55776/Y1329) and Vienna Science and Technology Fund (WWTF, project 10.47379/ICT22029).
  • Korchemna, Viktoriia: Austrian Science Fund (FWF, projects 10.55776/Y1329 and 10.55776/ J4880) and US National Science Foundation (NSF Grant CCF-2505099).

References

  1. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, and Ignaz Rutter. Testing planarity of partially embedded graphs. ACM Trans. Algorithms, 11(4):32:1-32:42, 2015. URL: https://doi.org/10.1145/2629341.
  2. Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, and Roberto Tamassia. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput., 27(1):132-169, 1998. URL: https://doi.org/10.1137/S0097539794279626.
  3. Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin Nöllenburg. Extending orthogonal planar graph drawings is fixed-parameter tractable. J. Comput. Geom., 15(2):3-39, 2023. URL: https://doi.org/10.20382/JOCG.V15I2A1.
  4. Steven Chaplick, Radoslav Fulek, and Pavel Klavík. Extending partial representations of circle graphs. J. Graph Theory, 91(4):365-394, 2019. URL: https://doi.org/10.1002/JGT.22436.
  5. Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Parameterized algorithms for upward planarity. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry, SoCG 2022, volume 224 of LIPIcs, pages 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.SOCG.2022.26.
  6. Vera Chekan, Robert Ganian, and Viktoriia Korchemna. A fixed-parameter algorithm for extending upward planar drawings, 2026. URL: https://arxiv.org/abs/2607.23549.
  7. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  8. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. Computational geometry: algorithms and applications, 3rd Edition. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-77974-2.
  9. Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg. The Parameterized Complexity Of Extending Stack Layouts. In Stefan Felsner and Karsten Klein, editors, 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, volume 320 of Leibniz International Proceedings in Informatics (LIPIcs), pages 12:1-12:17, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.GD.2024.12.
  10. Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg. The peculiarities of extending queue layouts. In Henning Fernau and Philipp Kindermann, editors, Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers, volume 16124 of Lecture Notes in Computer Science, pages 177-191. Springer, 2025. URL: https://doi.org/10.1007/978-3-032-11835-6_13.
  11. Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, and Martin Nöllenburg. Pathways to tractability for geometric thickness (best paper award). In Rastislav Královic and Vera Kurková, editors, 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, volume 15538 of Lecture Notes in Computer Science, pages 209-224. Springer, 2025. URL: https://doi.org/10.1007/978-3-031-82670-2_16.
  12. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013. URL: https://doi.org/10.1007/978-1-4471-5559-1.
  13. Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg. Extending nearly complete 1-planar drawings in polynomial time. In Javier Esparza and Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, volume 170 of LIPIcs, pages 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.31.
  14. Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg. Extending partial 1-planar drawings. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, volume 168 of LIPIcs, pages 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.43.
  15. David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, and Stephen K. Wismath. On the planar split thickness of graphs. Algorithmica, 80(3):977-994, 2018. URL: https://doi.org/10.1007/S00453-017-0328-Y.
  16. Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, and Birgit Vogtenhuber. Crossing-optimal extension of simple drawings. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, volume 198 of LIPIcs, pages 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.72.
  17. Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, and Meirav Zehavi. Parameterized complexity in graph drawing (Dagstuhl seminar 21293). Dagstuhl Reports, 11(6):82-123, 2021. URL: https://doi.org/10.4230/DagRep.11.6.82.
  18. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput., 31(2):601-625, 2001. URL: https://doi.org/10.1137/S0097539794277123.
  19. Thekla Hamm and Petr Hlinený. Parameterised partially-predrawn crossing number. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry, SoCG 2022, volume 224 of LIPIcs, pages 46:1-46:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.SOCG.2022.46.
  20. Michael D. Hutton and Anna Lubiw. Upward planar drawing of single source acyclic digraphs. In Alok Aggarwal, editor, Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, SODA 1991, pages 203-211. ACM/SIAM, 1991. URL: http://dl.acm.org/citation.cfm?id=127787.127828.
  21. Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov. Upward and rectilinear planarity are w[1]-hard parameterized by treewidth. SIAM J. Discret. Math., 40(2):706-742, 2026. URL: https://doi.org/10.1137/24M1679240.
  22. Vít Jelínek, Jan Kratochvíl, and Ignaz Rutter. A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. Theory Appl., 46(4):466-492, 2013. URL: https://doi.org/10.1016/j.comgeo.2012.07.005.
  23. Paul Jungeblut, Laura Merker, and Torsten Ueckerdt. A sublinear bound on the page number of upward planar graphs. SIAM J. Discret. Math., 37(4):2312-2331, 2023. URL: https://doi.org/10.1137/22M1522450.
  24. Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, and Bartosz Walczak. Extending partial representations of function graphs and permutation graphs. In Leah Epstein and Paolo Ferragina, editors, 20th Annual European Symposium on Algorithms, ESA 2012, volume 7501 of Lecture Notes in Computer Science, pages 671-682. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-33090-2_58.
  25. Boris Klemz and Marie Diana Sieper. Constrained level planarity is FPT with respect to the vertex cover number. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, volume 297 of LIPIcs, pages 99:1-99:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.99.
  26. Giordano Da Lozzo, Giuseppe Di Battista, and Fabrizio Frati. Extending upward planar graph drawings. Comput. Geom., 91:101668, 2020. URL: https://doi.org/10.1016/J.COMGEO.2020.101668.
  27. Tamara Mchedlidze. Reprint of: Upward planar embedding of an n-vertex oriented path on O(n²) points. Comput. Geom., 47(3):493-498, 2014. URL: https://doi.org/10.1016/j.comgeo.2013.11.007.
  28. Takao Nishizeki and Md. Saidur Rahman. Planar Graph Drawing, volume 12 of Lecture Notes Series on Computing. World Scientific, 2004. URL: https://doi.org/10.1142/5648.
  29. Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, and Jules Wulms. Planarizing graphs and their drawings by vertex splitting. J. Comput. Geom., 16(1):333-372, 2025. URL: https://doi.org/10.20382/JOCG.V16I1A10.
  30. Maurizio Patrignani. On extending a partial straight-line drawing. Int. J. Found. Comput. Sci., 17(5):1061-1070, 2006. URL: https://doi.org/10.1142/S0129054106004261.
  31. Roberto Tamassia, editor. Handbook on Graph Drawing and Visualization. Chapman and Hall/CRC, 2013. URL: https://www.crcpress.com/Handbook-of-Graph-Drawing-and-Visualization/Tamassia/9781584884125.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact