Skip to main content

10 Result(s)

within Lawqueen Kanesh Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses

    Max-SAT with cardinality constraint (CC-Max-SAT) is one of the classical NP-complete problems. In this problem, given a CNF-formula $$\varPhi ...

    Pallavi Jain, Lawqueen Kanesh, Fahad Panolan… in LATIN 2024: Theoretical Informatics (2024)

  2. No Access

    Chapter and Conference Paper

    On the Parameterized Complexity of Minus Domination

    Dominating Set is a well-studied combinatorial problem. Given a graph \(G=(V,E)\) G ...

    Sriram Bhyravarapu, Lawqueen Kanesh… in SOFSEM 2024: Theory and Practice of Comput… (2024)

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

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

  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)

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

  7. No Access

    Chapter and Conference Paper

    Parameterized Complexity of Fair Feedback Vertex Set Problem

    Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positiv...

    Lawqueen Kanesh, Soumen Maity, Komal Muluk… in Computer Science – Theory and Applications (2020)

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

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

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