Publications: Liana Khazaliya
2025
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Sujoy Bhore and Robert Ganian and Liana Khazaliya and Fabrizio Montecchiani and Martin Nöllenburg
J. Comput. Geom., 2025.
Note: to appear
[details]
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Florent Foucaud and Esther Galby and Liana Khazaliya and Shaohua Li and Fionn Mc Inerney and Roohani Sharma and Prafullkumar Tale
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.
[pdf] [doi] [details]
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Robert Ganian and Liana Khazaliya and Fionn Mc Inerney and Mathis Rocton
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
[pdf] [details]
2024
Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
[doi] [details]
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Florent Foucaud and Esther Galby and Liana Khazaliya and Shaohua Li and Fionn Mc Inerney and Roohani Sharma and Prafullkumar Tale
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.
[pdf] [doi] [details]
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
Petr Hlinený and 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.
[pdf] [doi] [details]
2023
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin
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.
[doi] [details]
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Sujoy Bhore and Robert Ganian and Liana Khazaliya and Fabrizio Montecchiani and Martin Nöllenburg
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.
[pdf] [doi] [details]
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Bart M. P. Jansen and Liana Khazaliya and Philipp Kindermann and Giuseppe Liotta and Fabrizio Montecchiani and Kirill Simonov
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.
[pdf] [doi] [details]
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
Robert Ganian and Liana Khazaliya and Kirill Simonov
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.
[pdf] [doi] [details]
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
[details]
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav, Khazaliya, Liana
Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.
[doi] [details]
AC Admin
Website maintainer