Simon Dominik Fink

Simon Dominik Fink

ORCID: 0000-0002-2754-1195

Biography

Simon Dominik Fink was a Project Assistant at the Algorithms and Complexity Group at TU Wien.

Recent Publications

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Thomas Depian, Simon Dominik 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
bib Project Project
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Sieper, Marie Diana
Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen and Michael Lampis), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
bib Project
The Parameterized Complexity Of Extending Stack Layouts
Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg
Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026.
bib Project DOI
The Peculiarities of Extending Queue Layouts
Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg
Graph-Theoretic Concepts in Computer Science (WG'25) (Fernau, Henning and Kindermann, Philipp), volume 16124 of LNCS, pages 177-191, 2026, Springer.
bib DOI
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
Thomas Depian, Simon Dominik Fink, Robert Ganian, Vaishali Surianarayanan
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
PDF bib Project Project Project DOI