Skip to main content

5 Result(s)

within Lawqueen Kanesh Remove this filter Data Structures 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. No Access

    Chapter and Conference Paper

    Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    Let \(\mathrm{\Pi }\) be a family of graphs. In the classical

    Pallavi Jain, Lawqueen Kanesh… in Computer Science – Theory and Applications (2018)

  4. 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

  5. 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)