Koustav Bhanja

According to our database, Koustav Bhanja authored at least 9 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

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, July, 2025

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity.

Koustav Bhanja, Asaf Petruschka

CoRR, June, 2025

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

Koustav Bhanja

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

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

Koustav Bhanja

CoRR, 2024

Optimal Sensitivity Oracle for Steiner Mincut.

Koustav Bhanja

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles.

Surender Baswana, Koustav Bhanja

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Minimum+1 (<i>s, t</i>)-cuts and Dual-edge Sensitivity Oracle.

Surender Baswana, Koustav Bhanja, Abhyuday Pandey

ACM Trans. Algorithms, October, 2023

Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle.

Surender Baswana, Koustav Bhanja

CoRR, 2023

2022

Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle.

Surender Baswana, Koustav Bhanja, Abhyuday Pandey

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022