2024W

• Seminar in Algorithms Graphs and Geometry / 186.862 / SE

2025S

• Algorithms and Data Structures / 186.866 / VU

• 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)