Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

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 computer science 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. [to appear] ISAAC 2023

Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity
with Robert Ganian, Kirill Simonov. [to appear] 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. [to appear] 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
[To appear] SIAM Journal on Discrete Mathematics, SIDMA, 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

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

  • GD 2023, 20⁠–⁠22 September 2023, Palermo, Italy

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

  • contributed talk at IGAFIT Highlights of Algorithms (HALG),
    2⁠–⁠4 June 2023, Charles University, Prague, Czech Republic
    [poster]
  • contributed talk at Algorithmic Graph Theory minisymposium
    10th Slovenian Conference on Graph Theory
    18⁠–⁠24 June 2023, Kranjska Gora, Slovenia
    [slides]

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

  • MFCS 2022, 22–⁠26 August 2022, Vienna, Austria
    [slides]

Reviewing

GD 2023, AIJ, SOFSEM 2022, IPEC 2022

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 walker;
  • Minesweeper [Expert]: 82 sec.

Last updated on 6 September 2023

  • Cornelius Brand
  • Doris Brazda
  • Maria Bresich
  • Jiehua Chen
  • Alexis de Colnet
  • Alexander Dobler
  • Jan Dreier
  • Robert Ganian
  • Christian Hatschka
  • Marc Huber
  • Enrico Iurlano
  • Liana Khazaliya
  • Markus Kirchweger
  • Viktoria Korchemna
  • Martin Kronegger
  • Fionn Aidan Mc Inerney
  • Andreas Müller
  • Martin Nöllenburg
  • Tomáš Peitl
  • Vaidyanathan P. R.
  • Günther Raidl
  • Franz Xaver Reichl
  • Mathis Rocton
  • Andre Schidler
  • Sofia Simola
  • Manuel Sorge
  • Stefan Szeider
  • Soeren Terziadis
  • Laurenz Tomandl
  • Johannes Varga
  • Florentina Voboril
  • Markus Wallinger
  • Simon Wietheger
  • Jules Wulms
  • Hai Xia
  • Tianwei Zhang
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.