Publications: Simon Dominik Fink

⬅️ Zurück zum Profil


2026

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen and Michael Lampis), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
The Parameterized Complexity Of Extending Stack Layouts
Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026.
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science (WG'25) (Fernau, Henning and Kindermann, Philipp), volume 16124 of LNCS, pages 177–191, 2026, Springer.

2025

Pathways to Tractability for Geometric Thickness
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 209–224, 2025, Springer.
Pathways to Tractability for Geometric Thickness (Best Paper Award)
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 and Vera Kurková), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer.
Structural Parameterizations of Simultaneous Planarity
36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen and Wing-Kai Hon and Meng-Tsung Tsai), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau and Philipp Kindermann), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer.
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Partial Level Planarity Parameterized by the Size of the Missing Graph
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 50:1–50:10, 2025.
PACE Solver Description: Bad Dominating Set Maker
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal and Erik Jan van Leeuwen), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2024

The Parameterized Complexity of Extending Stack Layouts
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
The Parameterized Complexity Of Extending Stack Layouts
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner and Karsten Klein), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2015

Many-to-One Boundary Labeling with Backbones
J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015.

2013

Many-to-One Boundary Labeling with Backbones
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg.
Drawing Metro Maps using Bézier Curves
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg.
AC Admin
AC Admin

Website maintainer