Alexander Firbas

Alexander Firbas serves as a Researcher at the Institute of Logic and Computation within Vienna University of Technology's Faculty of Informatics, specializing in theoretical computer science with emphasis on graph algorithms and computational complexity.

His academic background includes a Diploma Engineer (Dipl.-Ing.) and Bachelor of Science (BSc), with his 2023 Diploma Thesis establishing foundational work on vertex splitting for hereditary graph properties. Current doctoral research extends into parameterized complexity and geometric graph representations.

Firbas investigates structural graph properties through computational lenses, focusing on tractability boundaries for problems involving vertex splitting, cluster modifications, and geometric thickness. His methodology integrates fine-grained complexity analysis with algorithmic design for NP-hard graph problems.

Recent publications demonstrate consistent exploration of graph modification paradigms, evolving from hereditary property establishment (2023) to cluster vertex splitting (2024) and geometric thickness tractability (2025), reflecting deepening specialization in parameterized approaches to graph-theoretic challenges.

He contributes to the multi-year 'Parameterized Graph Drawing' project (2023–2027) while teaching Algorithmic Geometry and Graph Algorithms seminars. His advising activities include supervising master's theses within the Algorithms and Complexity research framework.

As an active member of the Algorithms and Complexity research group, Firbas collaborates on theoretical projects examining computational boundaries in graph theory, with ongoing work targeting degree-constrained spanning trees and geometric embedding problems.