Liana Khazaliya
Univ.Ass.in

Liana Khazaliya

Biography

Since August 2022, I am a PhD student at TU Wien
supervised by Robert Ganian, and co-supervised by Martin Nöllenburg.

Projects

Parameterized Analysis in Artificial Intelligence

Funding organization: The Austrian Science Funds, FWF

Recent Publications

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

2025

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

2025

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)

2024

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover

2024

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity

2023

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

2023

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)

2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

2023