Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. - Surender Baswana; Koustav Bhanja; Abhyuday Pandey (ICALP, 2022)

Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. - Surender Baswana; Koustav Bhanja (CoRR, 2023)

Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle. - Surender Baswana; Koustav Bhanja; Abhyuday Pandey (ACM Trans. Algorithms, 2023)

Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. - Surender Baswana; Koustav Bhanja (ICALP, 2024)

Optimal Sensitivity Oracle for Steiner Mincut. - Koustav Bhanja (ISAAC, 2024)

Minimum+1 Steiner Cuts and Dual Edge Sensitivity Oracle: Bridging the Gap between Global cut and (s,t)-cut. - Koustav Bhanja (CoRR, 2024)

Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s, t)-cut. - Koustav Bhanja (ICALP, 2025)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity. - Koustav Bhanja; Asaf Petruschka (CoRR, 2025)

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 (CoRR, 2025)