[contact_info_field field="name" handle="lkhazaliya"]

[wpcol_2third] [contact_info handle="lkhazaliya" web="auto"] [/wpcol_2third] [wpcol_1third_end]

{draggable=“true”}
{.alignnone .size-full .wp-image-7809 width=“1106” height=“1525”} [/wpcol_1third_end] Since August 2022, I am a PhD student at TU Wien supervised by Robert Ganian, and co-supervised by Martin Nöllenburg.

Publications

The Computational Complexity of Positive Non-Clashing Teaching in Graphs with Robert Ganian, Fionn Mc Inerney, Mathis Rocton. ICLR 2025 Metric Dimension and Geodetic Set Parameterized by Vertex Cover with Florent Foucaud, Esther Galby, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. STACS 2025 Crossing Number is NP-hard for Constant Path-width (and Tree-width) with Petr Hliněný. ISAAC 2024 [Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover]{.title} with Florent Foucaud, Esther Galby, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. ICALP 2024 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 [Journal of Computational Geometry (JoCG), Vol. 15 No. 2 (2024){.title} ]{sheets-formula-bar-text-style=“font-size:13px;color:#000000;font-weight:normal;text-decoration:none;font-family:‘Arial’;font-style:normal;text-decoration-skip-ink:none;”} 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) [DBLP] [Google Scholar]

Talks

[The Computational Complexity of Positive Non-Clashing Teaching in Graphs ]{.title}

[Crossing Number is NP-hard for Constant Path-width (and Tree-width)]{.title}

  • TCS Seminar, National Institute of Informatics, Tokyo, Japan [slides]
  • ISAAC 2024, Sydney, Australia [slides]

[Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover]{.title}

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

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

Reviewing

Conferences: ICALP 2025, WALCOM 2025, ESA 2024, SoCG 2024, STACS 2024, GD 2023, SOFSEM 2022, IPEC 2022 Journals: SIAM Journal on Discrete Mathematics, Journal of Artificial Intelligence

Education

  • [PhD student]{style=“text-decoration: underline;”}, Algorithms and Complexity Group TU Wien, Vienna, Austria Since August 2022 Guild Leader: Robert Ganian
  • [M.Sc.]{style=“text-decoration: underline;”}, Department of Mathematics and Computer Science Saint Petersburg University, Saint Petersburg, Russia September 2020 [– June ]{dir=“ltr” role=“presentation”}2022
  • [B.Sc.]{style=“text-decoration: underline;”} in Minsk, Belarus September 2016 [– June ]{dir=“ltr” role=“presentation”}2020
  • Computer Science Center Saint Petersburg, Russia September 2021 [– ]{dir=“ltr” role=“presentation”} May 2022

Work experience

  • [Assistant]{style=“text-decoration: underline;”} Fall and Winter Semesters 2021–⁠2022 Seminars on algorithms for first-year BSc students Saint Petersburg State University
  • [System Analyst]{style=“text-decoration: underline;”} from March 2020 to March 2021 “HiQo Solutions”
  • [Math tutor, Coordinator]{style=“text-decoration: underline;”} from December 2016 to June 2022 Preparing school students for mathematical competitions (olympiads, tournaments, etc.)

Other

  • [Certified in Rope Access Services (industrial climbing);]{dir=“ltr” role=“presentation”}
  • [Long-distance cyclist;]{dir=“ltr” role=“presentation”}
  • Bouldering and sport climbing fan;
  • [Juggler, unicyclist, slackline enjoyer;]{dir=“ltr” role=“presentation”}
  • Kayaking;
  • Minesweeper [Expert]: 80 sec.

Last updated on 24 January 2024