Lawqueen Kanesh - Research Publications - IIT Jodhpur Research Profile

Publications (24)

Sort by Year (most recent)

Sort by Year (oldest first)

Sort by Most Cited

Sort by Recently Added

Sort (A-Z)

Sort (Z-A)

Conferences
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
Lawqueen Kanesh
, J. Madathil, ..., S. Saurabh (5 authors)
2022 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
A. Agrawal,
Lawqueen Kanesh
, ..., M. Zehavi (7 authors)
2022 | Association for Computing Machinery
Articles
On the complexity of singly connected vertex deletion
A. Das,
Lawqueen Kanesh
, ..., S. Saurabh (6 authors)
2022 | Elsevier B.V.
Articles
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
J. Derbisz,
Lawqueen Kanesh
, ..., S. Verma (6 authors)
2022 | Springer
Articles
A FIXED-PARAMETER TRACTABLE ALGORITHM for ELIMINATION DISTANCE to BOUNDED DEGREE GRAPHS
A. Agrawal,
Lawqueen Kanesh
, ..., S. Saurabh (5 authors)
2022 | Society for Industrial and Applied Mathematics Publications
PDFPostprint
Conferences
An FPT algorithm for elimination distance to bounded degree graphs
A. Agrawal,
Lawqueen Kanesh
, ..., S. Saurabh (5 authors)
2021 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Parameterized complexity of fair feedback vertex set problem
Lawqueen Kanesh
, S. Maity, ..., S. Saurabh (4 authors)
2021 | Elsevier B.V.
Conferences
A polynomial kernel for bipartite permutation vertex deletion
Lawqueen Kanesh
, J. Madathil, ..., S. Verma (5 authors)
2021 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Circumventing Connectivity for Kernelization
Pallavi Jain
,
Lawqueen Kanesh
, ..., R. Sharma (5 authors)
2021 | Springer Science and Business Media Deutschland GmbH
Conferences
Odd Cycle Transversal in Mixed Graphs
A. Das,
Lawqueen Kanesh
, ..., S. Saurabh (4 authors)
2021 | Springer Science and Business Media Deutschland GmbH
Articles
Paths to trees and cacti
A. Agrawal,
Lawqueen Kanesh
, ..., P. Tale (4 authors)
2021 | Elsevier B.V.
Articles
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Pallavi Jain
,
Lawqueen Kanesh
and P. Misra
2020 | Springer
Articles
Parameterized Complexity of Conflict-Free Matchings and Paths
A. Agrawal,
Pallavi Jain
,
Lawqueen Kanesh
and S. Saurabh
2020 | Springer
PDFPublisher Copy
Conferences
On the Complexity of Singly Connected Vertex Deletion
A. Das,
Lawqueen Kanesh
, ..., S. Saurabh (6 authors)
2020 | Springer
Conferences
Parameterized complexity of feedback vertex sets on hypergraphs
P. Choudhary,
Lawqueen Kanesh
, ..., S. Saurabh (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Parameterized complexity of fair feedback vertex set problem
Lawqueen Kanesh
, S. Maity, ..., S. Saurabh (4 authors)
2020 | Springer
Conferences
Exact and approximate digraph bandwidth
Pallavi Jain
,
Lawqueen Kanesh
, ..., R. Sharma (5 authors)
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Parameterized complexity of conflict-free matchings and paths
A. Agrawal,
Pallavi Jain
,
Lawqueen Kanesh
and S. Saurabh
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Exploring the kernelization borders for hitting cycles
A. Agrawal,
Pallavi Jain
,
Lawqueen Kanesh
, ..., S. Saurabh (5 authors)
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Conflict free feedback vertex set: A parameterized dichotomy
A. Agrawal,
Pallavi Jain
,
Lawqueen Kanesh
, ..., S. Saurabh (5 authors)
2018 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Showing 1-20 of 24 results