Liana Khazaliya

22 papers A* 3A 1B 4Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds.
CoRR
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
2025 A conf
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
STACS
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2025 A* conf
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
ICLR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2025 J jnl
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
CoRR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2024 B conf
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width).
ISAAC
Petr Hlinený, Liana Khazaliya
2024 J jnl
Crossing Number is NP-hard for Constant Path-width (and Tree-width).
CoRR
Petr Hlinený, Liana Khazaliya
2024 J jnl
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024 A* conf
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
ICALP
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 B conf
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
IPEC
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 J jnl
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity.
CoRR
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023 A* conf
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.
SoCG
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable.
CoRR
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending orthogonal planar graph drawings is fixed-parameter tractable.
J. Comput. Geom.
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math.
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 J jnl
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).
Dagstuhl Reports
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
2023 B conf
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
ISAAC
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable.
CoRR
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 — conf
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
GD (2)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth.
CoRR
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2022 B conf
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
MFCS
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
CoRR
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale