![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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 ...
-
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 ...
-
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