Skip to main content

4 Result(s)

within Lawqueen Kanesh Remove this filter Computer Communication Networks 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. 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

    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)