Skip to main content

4 Result(s)

within Computer Science Remove this filter Artificial Intelligence Remove this filter Pranabendu Misra Remove this filter Chapter Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    An Erdős–Pósa Theorem on Neighborhoods and Domination Number

    The neighborhood packing number of a graph is the maximum number of...

    Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh in Computing and Combinatorics (2019)

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

  3. No Access

    Chapter and Conference Paper

    Reducing Rank of the Adjacency Matrix by Graph Modification

    The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices...

    S. M. Meesum, Pranabendu Misra, Saket Saurabh in Computing and Combinatorics (2015)

  4. No Access

    Chapter and Conference Paper

    Parameterized Algorithms for Even Cycle Transversal

    We consider a decision version of the problem of finding the minimum number of vertices whose deletion results in a graph without even cycles. While this problem is a natural analogue of the Odd Cycle Transversal

    Pranabendu Misra, Venkatesh Raman… in Graph-Theoretic Concepts in Computer Scien… (2012)