Alexander Firbas

According to our database, Alexander Firbas authored at least 6 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

The Parameterized Complexity of Geometric 1-Planarity.

Alexander Firbas

CoRR, February, 2026

2025

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees.

Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilágyi

CoRR, March, 2025

Pathways to Tractability for Geometric Thickness.

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Structural Parameterizations of Simultaneous Planarity.

Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

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

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting.

Alexander Firbas, Manuel Sorge

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024