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
172021
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
152022
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
132020
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica 82 (7), 1939-1965, 2020
122020
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
112021
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage
P Jain, L Kanesh, F Panolan, S Saha, A Sahu, S Saurabh, A Upasana
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
52023
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
42022
Elimination distance to topological-minor-free graphs is FPT
A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ...
arXiv preprint arXiv:2104.09950 76, 2021
42021
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
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
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
32021
Identifying and eliminating majority illusion in social networks
U Grandi, L Kanesh, G Lisowski, R Sridharan, P Turrini
Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 5062-5069, 2023
22023
Exact and approximate digraph bandwidth
P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma
22023
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
22022
Hitting and covering partially
A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh
International Computing and Combinatorics Conference, 751-763, 2018
22018
Max-SAT with cardinality constraint parameterized by the number of clauses
P Jain, L Kanesh, F Panolan, S Saha, A Sahu, S Saurabh, A Upasana
Latin American Symposium on Theoretical Informatics, 223-237, 2024
12024
On the parameterized complexity of minus domination
S Bhyravarapu, L Kanesh, A Mohanapriya, N Purohit, N Sadagopan, ...
International Conference on Current Trends in Theory and Practice of …, 2024
12024
Burn and win
P Ashok, S Das, L Kanesh, S Saurabh, A Tomar, S Verma
International Workshop on Combinatorial Algorithms, 36-48, 2023
12023
On the complexity of singly connected vertex deletion
A Das, L Kanesh, J Madathil, K Muluk, N Purohit, S Saurabh
Theoretical Computer Science 934, 47-64, 2022
12022
Parameterized complexity of fair feedback vertex set problem
L Kanesh, S Maity, K Muluk, S Saurabh
Theoretical Computer Science 867, 1-12, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20