Liana Khazaliya joined Aalto University as a postdoctoral researcher in October 2026, working in the research group of Sándor Kisfaludi-Bak. She completed her PhD at TU Wien in September 2026 under the supervision of Robert Ganian.
Her research interests lie in theoretical computer science, particularly parameterized complexity and graph algorithms. Her work focuses on understanding the computational complexity of combinatorial problems and developing efficient algorithms by exploiting their structural properties.
Her previous research has addressed problems in computational learning theory, graph drawing, and graph identification. In particular, she has studied the parameterized complexity of combinatorial optimization problems, including crossing minimization, as well as graph-theoretic problems such as Metric Dimension and Geodetic Set. More recently, she has investigated the computational complexity of machine teaching models, focusing on establishing bounds on teaching dimensions for graph-based concept classes.
Selected publications:
- S. Bhore, L. Khazaliya, and F. Mc Inerney. Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds. ICLR 2026.
- R. Ganian, L. Khazaliya, F. Mc Inerney, and M. Rocton. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. ICLR 2025.
- F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP 2024.
- S. Bhore, R. Ganian, L. Khazaliya, F. Montecchiani, and M. Nöllenburg. Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023.