Publications

Available at dblp and Google Scholar.

• Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Ramanujan M. Sridharan and Saket Saurabh, FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less, FSTTCS 2023.

• Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit and Saket Saurabh, Fixed-Parameter Algorithms for Fair Hitting Set Problems, MFCS 2023.

• Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma, Parameterized Algorithms for Eccentricity Shortest Path Problem, IWOCA 2023.

• Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma, Burn and Win, IWOCA, 2023.

• Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini, Identifying and Eliminating Majority Illusion in Social Networks, Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI), 2023.

• Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana, Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023.

• Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi, Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent,  ACM-SIAM Symposium on Discrete Algorithms (SODA), January 9 - 12, 2022, Virtual Conference.

• Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh, Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems, Proceedings of the 16th International Symposium on Parameterized and Exact Computation (STACS), 2022.

• Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma, Circumventing Connectivity for Kernelization. Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC), 2021.

• Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), 2021. 

• Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh,  Odd Cycle Transversal in Mixed Graphs, 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), June 23 to 25, 2021, Virtual Conference.

•  Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma, Circumventing Connectivity for Kernelization, 12th International Conference on Algorithms and Complexity (CIAC), May 10 to 12, 2021, Virtual Conference.

•  Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Parameterized Complexity of Feedback Vertex Sets on Hypergraphs, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 14 to 18, 2020, Virtual Conference.

• Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma, Exact and Approximate Digraph Bandwidth, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 11 to 13, 2019, Bombay, India.

• Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh, Hitting and Covering Partially, 24th International Conference on Computing and Combinatorics (COCOON), July 2 to 4, 2018, Qingdao, China.

•  Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh, Parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut,  A Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO), July 15 to 19, 2018, Kyoto, Japan.

•  Exploring the Kernelization Borders for Hitting Cycles, Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh, 13th International Symposium on Parameterized and Exact Computation (IPEC), August 22 to 24, 2018, Helsinki, Finland.

• Conflict Free Feedback Vertex Set: A Parameterized Dichotomy,  Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), August 27 to 31, 2018, Liverpool (UK).

• Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma, A Polynomial Kernel for Bipartite Permutation Vertex Deletion.  Algorithmica 84(11): 3246-3275, 2022, (An extended abstract appeared in IPEC 2021).

• Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh, On the Complexity of Singly Connected Vertex Deletion, Theoretical Computer Science 934: 47-64, 2022, (An extended abstract appeared in IWOCA).

• Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale, Paths to trees and cacti, Theoretical Computer Science, 860, 2021, 10.1016/j.tcs.2021.01.033 (An extended abstract appeared in CIAC 2017).

• Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh, Parameterized complexity of fair feedback vertex set problem, Theoretical Computer Science, 867, 2021, 10.1016/j.tcs.2021.03.008 (An extended abstract appeared in CSR 2020).

• Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh, Parameterized Complexity of Conflict-Free Matchings and Paths, Algorithmica, 82,7, 10.1007/s00453-020-00681-y (An extended abstract appeared in MFCS 2019).

• Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized,  Theory of Computing Systems, 64, 6, 10.1007/s00224-019-09964-6 (An extended abstract appeared in CSR 2018).