Publications: Liana Khazaliya
2025
| [1] | Metric Dimension and Geodetic Set Parameterized by Vertex Cover 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen, eds.), pages 33:1–33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | The Computational Complexity of Positive Non-Clashing Teaching in Graphs The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
2024
| [1] | Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. |
| [2] | Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width) 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
2023
| [1] | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters SIAM J. Discrete Math., 2023. Note: to appear |
| [2] | New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. |
| [3] | Consistency Checking Problems: A Gateway to Parameterized Sample Complexity 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [4] | Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [5] | Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [6] | Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth 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, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer. |
AC Admin
Website maintainer