Sagnik Mukhopadhyay
Home
Experience
Publications
Teaching
Contact
Danupon Nanongkai
Latest
A Note on Isolating Cut Lemma for Submodular Function Minimization
Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs
Distributed Weighted Min-Cut in Nearly-Optimal Time
Breaking the Quadratic Barrier for Matroid Intersection
Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms
Cite
×