Skip to main content

9 Result(s)

within Lawqueen Kanesh Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Paths to Trees and Cacti

    For a family of graphs \(\mathcal F\) , the

    Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh… in Algorithms and Complexity (2017)

  2. No Access

    Chapter and Conference Paper

    Hitting and Covering Partially

    d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial

    Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain… in Computing and Combinatorics (2018)

  3. Chapter and Conference Paper

    On the Complexity of Singly Connected Vertex Deletion

    A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\) , there is at most one path in D

    Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil… in Combinatorial Algorithms (2020)

    Download PDF (428 KB) View Chapter

  4. No Access

    Article

    Parameterized Complexity of Conflict-Free Matchings and Paths

    An input to a conflict-free variant of a classical problem \(\Gamma \)Γ, called Conflict-Free\(\Gamma \)Γ, consists of an instance I of \(\Gamma \)Γ coupled with a graph H, called the conflict graph. A solution t...

    Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh in Algorithmica (2020)

  5. No Access

    Chapter and Conference Paper

    Circumventing Connectivity for Kernelization

    Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is c...

    Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy… in Algorithms and Complexity (2021)

  6. No Access

    Chapter and Conference Paper

    Odd Cycle Transversal in Mixed Graphs

    An odd cycle transversal (oct, for short) in a graph is a set of vertices whose deletion will leave a graph without any odd cycles. The Odd Cycle Transversal (OCT) problem takes an undirected graph G and a non-ne...

    Avinandan Das, Lawqueen Kanesh… in Graph-Theoretic Concepts in Computer Scien… (2021)

  7. No Access

    Article

    A Polynomial Kernel for Bipartite Permutation Vertex Deletion

    In a permutation graph, vertices represent the elements of a permutation, and edges represent pairs of elements that are reversed by the permutation. In the Permutation Vertex Deletion problem, given an undirecte...

    Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu… in Algorithmica (2022)

  8. No Access

    Chapter and Conference Paper

    Parameterized Algorithms for Eccentricity Shortest Path Problem

    Given an undirected graph \( G=(V,E) \) G = (

    Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh… in Combinatorial Algorithms (2023)

  9. No Access

    Chapter and Conference Paper

    Burn and Win

    Given a graph G and an integer k, the Graph Burning problem asks whether the graph G can be burned in at most k rounds. Graph burning is a model for information spreading in a network, where we study how fast the...

    Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh… in Combinatorial Algorithms (2023)