Research output per year
Research output per year
Fingerprint
Dive into the research topics where Sagnik Mukhopadhyay is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
Fischer, O., Jiang, Y., Mukhopadhyay, S. & Yingchareonthawornchai, S., 6 Jan 2026, 2026 SIAM Symposium on Simplicity in Algorithms (SOSA). Assadi, S. & Rotenberg, E. (eds.). Society for Industrial and Applied Mathematics Publications, p. 413-420 8 p. (Proceedings of the SIAM Symposium on Simplicity in Algorithms).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Shortcuts and Transitive-Closure Spanners Approximation
Chalermsook, P., Jiang, Y., Mukhopadhyay, S. & Nanongkai, D., 7 Jan 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery , p. 3536-3561 26 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
The Power of the Score Sequence of a Tournament
Ghosh, P., Kuchlous, S., Mukhopadhyay, S. & Mehra, S., 26 Jun 2026, (Accepted/In press) 34th Annual European Symposium on Algorithms (ESA 2026). Schloss Dagstuhl - Leibniz-Zentrum für Informatik , p. 156:1-156:19 19 p. 156. (Leibniz International Proceedings in Informatics).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile6 Downloads (Pure) -
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
Jiang, Y., Mukhopadhyay, S. & Yingchareonthawornchai, S., 27 Aug 2025, arXiv, 10 p.Research output: Working paper/Preprint › Preprint
File9 Downloads (Pure) -
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations
Blikstad, J., Jiang, Y., Mukhopadhyay, S. & Yingchareonthawornchai, S., 15 Jun 2025, STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucky, M. & Bansal, N. (eds.). Association for Computing Machinery , p. 2305-2316 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile6 Downloads (Pure)
-
Communication complexity of graph algorithms (GraphCom)
Mukhopadhyay, S. (Principal Investigator)
Engineering & Physical Science Research Council
1/08/24 → 31/05/27
Project: Research Councils
-
MSCA-PF: Vihan Shah (Sagnik Mukhopadhyay)
Mukhopadhyay, S. (Principal Investigator)
1/10/26 → 30/09/28
Project: EU