Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

    In the k -Feedback Arc/Vertex Set problem we are given a directed graph D and a positive integer k and the objective is to check whether it is possible to delete at most k arcs/vertices from D to ...

    Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan in Algorithms and Computation (2011)

  2. No Access

    Chapter and Conference Paper

    Fast Exact Algorithms for Survivable Network Design with Uniform Requirements

    We design exact algorithms for the following two problems in survivable network design: (i) designing a minimum cost network with a desired value of edge connectivity, which is called Minimum Weight ...

    Akanksha Agrawal, Pranabendu Misra, Fahad Panolan in Algorithms and Data Structures (2017)

  3. No Access

    Chapter and Conference Paper

    An FPT Algorithm for Contraction to Cactus

    For a collection \(\mathcal {F}\) of graphs, given a graph G and an integer k, the

    R. Krithika, Pranabendu Misra, Prafullkumar Tale in Computing and Combinatorics (2018)