Koustav Bhanja

collaborators

3 papers

cs.DS2025

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut

Surender Baswana, Koustav Bhanja, Anupam Roy

We study (s,t)-cuts of second minimum capacity and present the following algorithmic and graph-theoretic results. 1. Vazirani and Yannakakis [ICALP 1992] designed the first algorit…

cs.DS2025

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity

Koustav Bhanja, Asaf Petruschka

We present a compact labeling scheme for determining whether a designated set of terminals in a graph remains connected after any $f$ (or less) vertex failures occur. An $f$ -FT Ste…

cs.DS2024

Optimal Sensitivity Oracle for Steiner Mincut

Koustav Bhanja

Let $G = (V, E)$ be an undirected weighted graph on $n = ∣ V ∣$ vertices and $S \subseteq V$ be a Steiner set. Steiner mincut is a well-studied concept, which provides a generalization to…