Liana Khazaliya — Algorithms & Complexity

01 / About

I am a postdoctoral researcher at Aalto University and the Helsinki Institute for Information Technology (HIIT), in the Department of Computer Science. I work with Sándor Kisfaludi-Bak.

My research interests lie in theoretical computer science: graph algorithms, parameterized complexity, and geometric aspects of computational problems. I completed my PhD at TU Wien, with a thesis on Tractability Barriers for Parameterized (Geo)Metric Graph Problems, advised by Robert Ganian.

02 / Publications

Full list on DBLP

ICLR 2026

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds

with S. Bhore and F. Mc Inerney

ICLR 2025

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

with R. Ganian, F. Mc Inerney, and M. Rocton

STACS 2025

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

with F. Foucaud, E. Galby, S. Li, F. Mc Inerney, R. Sharma, and P. Tale

Journal version: Journal of Computer and System Sciences (JCSS), Vol. 164 (2027)

ISAAC 2024

Graph Crossing Number is NP-hard for Constant Path-width

with P. Hliněný

ICALP 2024

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover

with F. Foucaud, E. Galby, S. Li, F. Mc Inerney, R. Sharma, and P. Tale

ISAAC 2023

The st-Planar Edge Completion Problem is Fixed-Parameter Tractable

with P. Kindermann, G. Liotta, F. Montecchiani, and K. Simonov

IPEC 2023

Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity

with R. Ganian and K. Simonov

GD 2023

Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth

with B. M. P. Jansen, P. Kindermann, G. Liotta, F. Montecchiani, and K. Simonov

Journal version: SIAM Journal on Discrete Mathematics (SIDMA) Vol. 40, Iss. 2 (2026)

SoCG 2023

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

with S. Bhore, R. Ganian, F. Montecchiani, and M. Nöllenburg

Journal version: Journal of Computational Geometry (JoCG 2025), Vol. 15 No. 2 (2024)

MFCS 2022

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

with E. Galby, F. Mc Inerney, R. Sharma, and P. Tale

Journal version: SIAM Journal on Discrete Mathematics (SIDMA), Vol. 37, Iss. 4 (2023)

See citations on Google Scholar

03 / Research & Education

2026—present

Aalto University & HIIT

Postdoctoral Researcher · Department of Computer Science

Espoo / Helsinki, Finland · Host: Sándor Kisfaludi-Bak

2022—2026

TU Wien

PhD · Algorithms and Complexity Group

Vienna, Austria · Advisor: Robert Ganian

2024—2025

National Institute of Informatics

Research Intern

Tokyo, Japan · Host: Shuichi Hirahara

2020—2022

Saint Petersburg State University

MSc · Advanced Mathematics

Saint Petersburg, Russia · Thesis supervisor: Ivan Bliznets

2021

Max Planck Institute for Informatics

Intern Student

Saarbrücken, Germany · Remote · Dániel Marx’s research group

2016—2020

Belarusian State University

BSc · Mathematics

Minsk, Belarus · Thesis supervisors: Ivan Bliznets, Boris Doubrov

04 / Academic Service

Teaching

Structural Graph Decompositions (TU Wien, 2025)

Algorithms (Saint Petersburg State University, 2021–2022)

Reviewing

Conferences: WALCOM 2027, CCCG 2026, SWAT 2026, WG 2026, SODA 2025, WALCOM 2025, ESA 2024, SoCG 2024, STACS 2024, GD 2023, IPEC 2022, SOFSEM 2022

Journals: ACM Transactions on Algorithms, SIAM Journal on Discrete Mathematics, Journal of Artificial Intelligence

05 / Miscellaneous

Sertified in Rope Access Services;
Strava fan, average cycling enjoyer.

LianaKhazaliya