Publications: Alexander Firbas

⬅️ Zurück zum Profil

2026

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya and Danupon Nanongkai and Michael Benedikt and Gabriele Puppis), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF DOI bib
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin, 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
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
bib
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Firbas, Alexander, Ganian, Robert, Meunier, Sylvain, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib

2025

Pathways to Tractability for Geometric Thickness
Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 209–224, 2025, Springer.
DOI bib
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 and Vera Kurková), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer.
PDF DOI bib
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 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.
PDF DOI bib
The complexity of cluster vertex splitting and company
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
Discrete Applied Mathematics, volume 365, pages 190–207, 2025.
DOI bib

2024

The Complexity of Cluster Vertex Splitting and Company
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau and Serge Gaspers and Ralf Klasing), volume 14519 of LNCS, pages 226–239, 2024, Springer.
DOI bib
AC Admin
AC Admin

Website maintainer