Follow
Lawqueen Kanesh
Title
Cited by
Cited by
Year
An FPT algorithm for elimination distance to bounded degree graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
122021
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
92021
Conflict free version of covering problems on graphs: Classical and parameterized
P Jain, L Kanesh, P Misra
Theory of Computing Systems 64 (6), 1067-1093, 2020
82020
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica 82 (7), 1939-1965, 2020
52020
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent∗
A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ...
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
42022
Exploring the kernelization borders for hitting cycles
A Agrawal, P Jain, L Kanesh, P Misra, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
42018
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021
22021
Conflict free feedback vertex set: a parameterized dichotomy
A Agrawal, P Jain, L Kanesh, D Lokshtanov, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
22018
Elimination Distance to Topological-minor-free Graphs is FPT
A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ...
arXiv preprint arXiv:2104.09950, 2021
12021
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs
P Choudhary, L Kanesh, D Lokshtanov, F Panolan, S Saurabh
Leibniz international proceedings in informatics, 2020
12020
Exact and Approximate Digraph Bandwidth
P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma
39th IARCS Annual Conference on Foundations of Software Technology and …, 2019
12019
Hitting and Covering Partially
A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh
International Computing and Combinatorics Conference, 751-763, 2018
12018
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 36 (2), 911-921, 2022
2022
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
L Kanesh, J Madathil, S Roy, A Sahu, S Saurabh
39th International Symposium on Theoretical Aspects of Computer Science …, 2022
2022
Odd Cycle Transversal in Mixed Graphs
A Das, L Kanesh, J Madathil, S Saurabh
International Workshop on Graph-Theoretic Concepts in Computer Science, 130-142, 2021
2021
Circumventing Connectivity for Kernelization
P Jain, L Kanesh, SK Roy, S Saurabh, R Sharma
International Conference on Algorithms and Complexity, 300-313, 2021
2021
Parameterized complexity of fair feedback vertex set problem
L Kanesh, S Maity, K Muluk, S Saurabh
Theoretical Computer Science 867, 1-12, 2021
2021
Parameterized Complexity of Conflict-Free Solutions
L Kanesh
HOMI BHABHA NATIONAL INSTITUTE, 2020
2020
On the Complexity of Singly Connected Vertex Deletion
A Das, L Kanesh, J Madathil, K Muluk, N Purohit, S Saurabh
International Workshop on Combinatorial Algorithms, 237-250, 2020
2020
Parameterized complexity of conflict free solutions [HBNI Th183]
L Kanesh
IMSc, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20