default search action
Lawqueen Kanesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC 2024: 17:1-17:17 - [c26]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - [c25]Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - [c24]Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo:
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS 2024: 44:1-44:19 - 2023
- [j8]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37(4): 2626-2669 (2023) - [c23]Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini:
Identifying and Eliminating Majority Illusion in Social Networks. AAAI 2023: 5062-5069 - [c22]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS 2023: 28:1-28:16 - [c21]Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:
Burn and Win. IWOCA 2023: 36-48 - [c20]Sriram Bhyravarapu, Satyabrata Jana
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c19]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14 - [c18]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [i4]Sriram Bhyravarapu, Satyabrata Jana
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - [i3]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR abs/2307.08854 (2023) - [i2]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR abs/2310.03469 (2023) - 2022
- [j7]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j6]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36(2): 911-921 (2022) - [j5]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934: 47-64 (2022) - [c17]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c16]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - 2021
- [j4]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to trees and cacti. Theor. Comput. Sci. 860: 98-116 (2021) - [j3]Lawqueen Kanesh, Soumen Maity, Komal Muluk
Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867: 1-12 (2021) - [c15]Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. CIAC 2021: 300-313 - [c14]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - [c13]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [c12]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
Odd Cycle Transversal in Mixed Graphs. WG 2021: 130-142 - [i1]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - 2020
- [j2]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh
Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 82(7): 1939-1965 (2020) - [j1]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64(6): 1067-1093 (2020) - [c11]Lawqueen Kanesh, Soumen Maity, Komal Muluk
Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR 2020: 250-262 - [c10]Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS 2020: 18:1-18:15 - [c9]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250
2010 – 2019
- 2019
- [c8]Pallavi Jain, Lawqueen Kanesh, William Lochet
Exact and Approximate Digraph Bandwidth. FSTTCS 2019: 18:1-18:15 - [c7]Akanksha Agrawal
Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS 2019: 35:1-35:15 - 2018
- [c6]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - [c5]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. CSR 2018: 194-206 - [c4]Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. GECCO (Companion) 2018: 326-327 - [c3]Akanksha Agrawal
Exploring the Kernelization Borders for Hitting Cycles. IPEC 2018: 14:1-14:14 - [c2]Akanksha Agrawal
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15 - 2017
- [c1]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to Trees and Cacti. CIAC 2017: 31-42
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: