Alexander Firbas
Projektass. Dipl.-Ing. / BSc
Role
-
PreDoc Researcher
Algorithms and Complexity, E192-01
Courses
2025W
- Algorithmic Geometry / 192.154 / VU
- Seminar in Theoretical Computer Science (Graph Algorithms and Computational Geometry) / 192.180 / SE
Publications
- The complexity of cluster vertex splitting and company / Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu, A., & Monika, M. (2025). The complexity of cluster vertex splitting and company. Discrete Applied Mathematics, 365, 190–207. https://doi.org/10.1016/j.dam.2025.01.012
- Pathways to Tractability for Geometric Thickness / Depian, T., Fink, S. D., Firbas, A., Ganian, R., & Nöllenburg, M. (2025). Pathways to Tractability for Geometric Thickness. In 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 (pp. 209–224). Springer. https://doi.org/10.1007/978-3-031-82670-2_16
-
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
/
Firbas, A., & Sorge, M. (2024). On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. In 35th International Symposium on Algorithms and Computation (ISAAC 2024) (pp. 1–15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2024.30
Project: Parameterized Graph Drawing (2023–2027) - The Complexity of Cluster Vertex Splitting and Company / Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu, A., & Wißmann, M. (2024). The Complexity of Cluster Vertex Splitting and Company. In SOFSEM 2024: Theory and Practice of Computer Science (pp. 226–239). http://hdl.handle.net/20.500.12708/201366
-
Establishing hereditary graph properties via vertex splitting
/
Firbas, A. (2023). Establishing hereditary graph properties via vertex splitting [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.103864
Download: PDF (1.96 MB)
Supervisions
-
Algorithms and Complexity for Edge-Set Switching in Graphs
/
Kern, C. (2025). Algorithms and Complexity for Edge-Set Switching in Graphs [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.129320
Download: PDF (1.99 MB)