Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. - Sujoy Bhore; Robert Ganian; Liana Khazaliya; Fabrizio Montecchiani; Martin Nöllenburg (SoCG, 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 (GD (2), 2023)

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. - Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (ISAAC, 2023)

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. - Robert Ganian; Liana Khazaliya; Kirill Simonov (IPEC, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 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)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. - Esther Galby; Liana Khazaliya; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (SIAM J. Discret. Math., 2023)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). - Petr Hlinený; Liana Khazaliya (ISAAC, 2024)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs. - Robert Ganian; Liana Khazaliya; Fionn Mc Inerney; Mathis Rocton (ICLR, 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)