Rajesh Chitnis

most citedDesigning FPT algorithms for cut problems using randomized contractions

7 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2015

A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands

Rajesh Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi +3

Given an edge-weighted directed graph $G = (V, E)$ on $n$ vertices and a set $T = {t_{1}, t_{2}, \dots, t_{p}}$ of $p$ terminals, the objective of the \scss ( $p$ -SCSS) problem is to find a…

cs.DS2012★ 7 cited

Designing FPT algorithms for cut problems using randomized contractions

Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi +2

We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for…