Sagnik Mukhopadhyay
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
16
Venues
7
Active years
2015–2026
Best venue rank
A*
Where they publish
Papers
16 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | The Power of the Score Sequence of a Tournament. | Prantar Ghosh, Sahil Kuchlous, Shravan Mehra, Sagnik Mukhopadhyay |
| 2026 | SODA | Shortcuts and Transitive-Closure Spanners Approximation. | Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2025 | STOC | Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations. | Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai |
| 2023 | STOC | Fast Algorithms via Dynamic-Oracle Matroids. | Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu |
| 2023 | STOC | Finding a Small Vertex Cut on Distributed Networks. | Yonggang Jiang, Sagnik Mukhopadhyay |
| 2022 | FOCS | Cut Query Algorithms with Star Contraction. | Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | FOCS | Nearly Optimal Communication and Query Complexity of Bipartite Matching. | Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | IPCO | Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. | Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | STOC | Breaking the quadratic barrier for matroid intersection. | Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | STOC | Distributed weighted min-cut in nearly-optimal time. | Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | SPAA | Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. | Andrs Lpez-Martnez, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2020 | STOC | Weighted min-cut: sequential, cut-query, and streaming algorithms. | Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2019 | STACS | Lifting Theorems for Equality. | Bruno Loff, Sagnik Mukhopadhyay |
| 2018 | STOC | Simulation beats richness: new data-structure lower bounds. | Arkadev Chattopadhyay, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2017 | STACS | Lower Bounds for Elimination via Weak Regularity. | Arkadev Chattopadhyay, Pavel Dvork, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2015 | STACS | Tribes Is Hard in the Message Passing Model. | Arkadev Chattopadhyay, Sagnik Mukhopadhyay |