Skip to main content

4 Result(s)

within Lawqueen Kanesh Remove this filter Computer Graphics Remove this filter

and

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

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

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

  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