Liana Khazaliya

Univ.Ass.in

HF0413

+43 1 58801 192132

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

Liana Khazaliya

J. Comput. Geom., 2025.
Note: to appear

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Liana Khazaliya

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Kim Thang Nguyen), pages 33:1-33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Liana Khazaliya

The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

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

Liana Khazaliya

35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 40:1-40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable

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

J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.

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

Liana Khazaliya

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 66:1-66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity

Liana Khazaliya

18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

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

Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Liana Khazaliya

39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers and Joachim Gudmundsson), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

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

SIAM J. Discrete Math., 2023.
Note: to appear

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

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

Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.

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

Liana Khazaliya

Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos and Markus Chimani), volume 14466 of Lecture Notes in Computer Science, pages 203-217, 2023, Springer.