Liana Khazaliya
Address:
Liana Khazaliya
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria
Room: | HF0413 |
Phone: | +43(1)58801–192132 |
Email: | lkhazaliya@ac.tuwien.ac.at |
Web: | http://www.ac.tuwien.ac.at/people/lkhazaliya/ |
Since August 2022, I am a PhD student at TU Wien
supervised by Robert Ganian, and co-supervised by Martin Nöllenburg.
Publications
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable
with Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov. ISAAC 2023
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity
with Robert Ganian, Kirill Simonov. IPEC 2023
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth
with Bart M.P. Jansen, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov. GD 2023
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
with Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg. SoCG 2023
[To appear] Journal of Computational Geometry, JoCG, 2023
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
with Esther Galby, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. MFCS 2022
SIAM Journal on Discrete Mathematics (SIDMA), Vol. 37, Iss. 4 (2023)
Preprints
Tight (Double) Exponential Bounds for NP-complete Problems: Treewidth and Vertex Cover Parameterizations
with Florent Foucaud, Esther Galby, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale
Talks
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth
- GD 2023 [slides]
- Seminar on Foundations of Computing, Masaryk University [slides]
- Research Seminar of the Algorithm Engineering group, Hasso-Plattner-Institut [slides]
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
- contributed talk at IGAFIT Highlights of Algorithms (HALG) [poster]
- contributed talk at 10th SCGT [slides]
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Reviewing
Conferences: SoCG 2024, STACS 2024, GD 2023, SOFSEM 2022, IPEC 2022
Journals: SIAM Journal on Discrete Mathematics, Journal of Artificial Intelligence, Journal of Computer and System Sciences
Education
- PhD student, Algorithms and Complexity Group
TU Wien, from August 2022
Guild Leader: Robert Ganian - M.Sc., Department of Mathematics and Computer Science
Saint Petersburg University, from 2020 to 2022 - B.Sc., Department of Mechanics and Mathematics
Belarusian State University, from 2016 to 2020 - Computer Science Center
Saint Petersburg, from September 2021 to May 2022
Work experience
- Assistant
Fall and Winter Semesters 2021–2022
Seminars on algorithms for the first year BSc students
Saint Petersburg State University - System Analyst
from March 2020 to March 2021
“HiQo Solutions” - Math tutor, Coordinator
from December 2016 to June 2022
Preparing school students for mathematical competitions (olympiads, tournaments, etc.)
Other
- Certified in Rope Access Services (industrial climbing);
- Long-distance cyclist;
- Juggler, unicyclist, slackline enjoyer;
- Minesweeper [Expert]: 81 sec.
Last updated on 5 March 2024