TU Wien Informatics

20 Years
Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Liana Khazaliya

Univ.Ass.in

Role

Contact

  • Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover / Foucaud, F., Galby, E., Khazaliya, L., Li, S., Mc Inerney, F. A., Sharma, R., & Tale, P. (2024). Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (pp. 66:1-66:19). https://doi.org/10.4230/LIPICS.ICALP.2024.66
  • The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable / Khazaliya, L., Kindermann, P., Liotta, G., Montecchiani, F., & Simonov, K. (2023). The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. In S. Iwata & N. Kakimura (Eds.), 34th International Symposium on Algorithms and Computation (ISAAC 2023) (pp. 1–13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2023.46
  • Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth / Jansen, B. M. P., Khazaliya, L., Kindermann, P., Liotta, G., Montecchiani, F., & Simonov, K. (2023). Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. In Graph Drawing and Network Visualization : 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II (pp. 203–217). Springer. http://hdl.handle.net/20.500.12708/201368
  • Consistency Checking Problems: A Gateway to Parameterized Sample Complexity / Ganian, R., Khazaliya, L., & Simonov, K. (2023). Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. In N. Misra & M. Wahlström (Eds.), 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) (pp. 1–17). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. http://hdl.handle.net/20.500.12708/191150
  • Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable / Bhore, S., Ganian, R., Khazaliya, L., Montecchiani, F., & Nöllenburg, M. (2023). Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. In E. Chambers & J. Gudmundsson (Eds.), 39th International Symposium on Computational Geometry (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2023.18
  • Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters / Galby, E., Khazaliya, L., Mc Inerney, F., Sharma, R., & Tale, P. (2023). Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM Journal on Discrete Mathematics, 37(4), 2241–2264. https://doi.org/10.1137/22M1510911