Liana Khazaliya

According to our database, Liana Khazaliya authored at least 13 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds.

Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney

CoRR, February, 2026

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

Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov

SIAM J. Discret. Math., 2026

2025

Metric Dimension and Geodetic Set Parameterized by Vertex Cover.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

The Computational Complexity of Positive Non-Clashing Teaching in Graphs.

Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

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

Petr Hlinený, Liana Khazaliya

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

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

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

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

Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya

Dagstuhl Reports, 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

CoRR, 2023

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.

Robert Ganian, Liana Khazaliya, Kirill Simonov

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.

Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

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

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.

Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.

Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022