Lawqueen Kanesh
Associate Professor Grade 2
+91-291-280-1258 (Work)
Publications (24)
recent
oldest
most-cited
recently-added
alpha
-alpha
ConferencesFurther Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems2022 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing- ConferencesDeleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent2022 | Association for Computing Machinery
- ArticlesA FIXED-PARAMETER TRACTABLE ALGORITHM for ELIMINATION DISTANCE to BOUNDED DEGREE GRAPHS2022 | Society for Industrial and Applied Mathematics Publications
- ConferencesAn FPT algorithm for elimination distance to bounded degree graphs2021 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- ConferencesA polynomial kernel for bipartite permutation vertex deletion2021 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ConferencesCircumventing Connectivity for Kernelization2021 | Springer Science and Business Media Deutschland GmbH- ConferencesOdd Cycle Transversal in Mixed Graphs2021 | Springer Science and Business Media Deutschland GmbH
- ArticlesConflict Free Version of Covering Problems on Graphs: Classical and Parameterized2020 | Springer
- ConferencesParameterized complexity of feedback vertex sets on hypergraphs2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- ConferencesExact and approximate digraph bandwidth2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- ConferencesParameterized complexity of conflict-free matchings and paths2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- ConferencesExploring the kernelization borders for hitting cycles2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- ConferencesConflict free feedback vertex set: A parameterized dichotomy2018 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
