Publications: Alexander Firbas
2026
| [1] | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Not All Degree Constraints Are Created Equal when Computing Spanning Trees 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [3] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [4] | 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 |
| [5] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [6] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
2025
| [1] | The complexity of cluster vertex splitting and company Discrete Applied Mathematics, volume 365, pages 190–207, 2025. |
| [2] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [3] | 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, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [4] | Structural Parameterizations of Simultaneous Planarity 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. |
2024
| [1] | The Complexity of Cluster Vertex Splitting and Company Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau, Serge Gaspers, Ralf Klasing, eds.), volume 14519 of LNCS, pages 226–239, 2024, Springer. |
AC Admin
Website maintainer