Liana Khazaliya

PhD student, Logic and Computation, Technische Universität Wien

Joined

September 2024

Names

Liana Khazaliya (Preferred)

Emails

****@ac.tuwien.ac.at (Confirmed)

****@gmail.com (Confirmed)

Personal Links

Career & Education History

PhD student

Logic and Computation, Technische Universität Wien (tuwien.ac.at)

2022 – Present

MS student

St. Petersburg State University (spbu.ru)

2020 – 2022

Advisors, Relations & Conflicts

PhD Advisor

Robert Ganian

2022 – Present

Expertise

No areas of expertise listed

Publications

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
- ICLR 2026 Poster
- Readers: Everyone
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
- STACS 2025
- Readers: Everyone
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
- ICLR 2025 Poster
- Readers: Everyone
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
- ICALP 2024
- Readers: Everyone
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
Petr Hlinený, Liana Khazaliya
- ISAAC 2024
- Readers: Everyone
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
- SIAM J. Discret. Math. 2023
- Readers: Everyone
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
- SoCG 2023
- Readers: Everyone
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
- GD (2) 2023
- Readers: Everyone
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
- ISAAC 2023
- Readers: Everyone
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
Robert Ganian, Liana Khazaliya, Kirill Simonov
- IPEC 2023
- Readers: Everyone

View all 11 publications