Publications: Simon Dominik Fink

2026

[1]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[2]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[3]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[4]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]

2025

[1]	Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex] [pdf] [doi]
[2]	PACE Solver Description: Bad Dominating Set Maker Alexander Dobler, Simon Dominik Fink, Mathis Rocton 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[4]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[5]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[6]	Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]

The Parameterized Complexity of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

[2]

The Parameterized Complexity Of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2015

[1]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. [bibtex] [pdf] [doi]

2013

[1]	Drawing Metro Maps using Bézier Curves Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[2]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]