| Metric dimension parameterized by feedback vertex set and other structural parameters E Galby, L Khazaliya, F Mc Inerney, R Sharma, P Tale SIAM Journal on Discrete Mathematics 37 (4), 2241-2264, 2023 | 6 | 2023 |
| Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations F Foucaud, E Galby, L Khazaliya, S Li, FM Inerney, R Sharma, P Tale arXiv preprint arXiv:2307.08149, 2023 | 3 | 2023 |
| Upward and orthogonal planarity are W [1]-hard parameterized by treewidth BMP Jansen, L Khazaliya, P Kindermann, G Liotta, F Montecchiani, ... International Symposium on Graph Drawing and Network Visualization, 203-217, 2023 | 1 | 2023 |
| Metric Dimension and Geodetic Set Parameterized by Vertex Cover F Foucaud, E Galby, L Khazaliya, S Li, FM Inerney, R Sharma, P Tale arXiv preprint arXiv:2405.01344, 2024 | | 2024 |
| The -Planar Edge Completion Problem is Fixed-Parameter Tractable L Khazaliya, P Kindermann, G Liotta, F Montecchiani, K Simonov arXiv preprint arXiv:2309.15454, 2023 | | 2023 |
| Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity R Ganian, L Khazaliya, K Simonov arXiv preprint arXiv:2308.11416, 2023 | | 2023 |
| Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable S Bhore, R Ganian, L Khazaliya, F Montecchiani, M Nöllenburg arXiv preprint arXiv:2302.10046, 2023 | | 2023 |
| New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) R Ganian, F Montecchiani, M Nöllenburg, M Zehavi, L Khazaliya Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023 | | 2023 |
| Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters FM Inerney, R Sharma, P TALE, L Khazaliya, E Galby Society for Industrial and Applied Mathematics, 2023 | | 2023 |
| 5.5 Upward and Rectilinear Planarity Testing and st-Planar Edge Completion BMP Jansen, L Khazaliya, P Kindermann, G Liotta, F Montecchiani, ... New Frontiers of Parameterized Complexity in Graph Drawing, 92, 0 | | |
