Liana Khazaliya

Orcid: 0009-0002-3012-7240

According to our database1, Liana Khazaliya authored at least 10 papers between 2023 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Crossing Number is NP-hard for Constant Path-width (and Tree-width).
CoRR, 2024

Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
CoRR, 2024

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math., December, 2023

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).
Dagstuhl Reports, 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR, 2023

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.
Proceedings of the 39th International Symposium on Computational Geometry, 2023


  Loading...