Short Bio

I am a PhD student at Max Planck Institute for Informatics, advised by Danupon Nanongkai. Before that, I got my Bachelor’s Degree in Computer Science at Nanjing University.

I am broadly interested in the design and analysis of algorithms. My current research focuses on graph algorithms, with the goal of understanding their theoretical limits across various settings, including parallel and distributed computing.

My research is supported by the Google PhD Fellowship.

My Google Scholar and CV (not frequently updated).

We are currently hiring Hiwis and interns — see offers for details.

Education

Publications

* Following the convention in mathematics, authors are listed in alphabetical order with equal contribution.

• Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers arXiv
  Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak.

• Reviving Thorup’s Shortcut Conjecture arXiv
  Aaron Bernstein, Henry Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller

• A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow arXiv
  Hossein Gholizadeh, Yonggang Jiang.

• Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth arXiv
  Yonggang Jiang, Changki Yun.

• Perfect Simulation of Las Vegas Algorithms via Local Computation arXiv
  Xinyu Fu, Yonggang Jiang, Yitong Yin.
  ITCS 2026 Innovations in Theoretical Computer Science.

• Reducing Shortcut and Hopset Constructions to Shallow Graphs arXiv
  Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak.
  SOSA 2026: SIAM Symposium on Simplicity in Algorithms.

• Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs arXiv
  Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai.
  SOSA 2026: SIAM Symposium on Simplicity in Algorithms.

• Minimum s–t Cuts with Fewer Cut Queries arXiv
  Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya.
  SODA 2026: ACM-SIAM Symposium on Discrete Algorithms.

• Shortcuts and Transitive-Closure Spanners Approximation arXiv
  Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai.
  SODA 2026: ACM-SIAM Symposium on Discrete Algorithms.

• New Oracles and Labeling Schemes for Vertex Cut Queries arXiv
  Yonggang Jiang, Merav Parter, Asaf Petruschka.
  SODA 2026: ACM-SIAM Symposium on Discrete Algorithms.

• Parallel $(1+\epsilon)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work arXiv
  Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang.
  FOCS 2025: IEEE Symposium on Foundations of Computer Science.

• Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances arXiv
  Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos.
  SPAA 2025: ACM Symposium on Parallelism in Algorithms and Architectures.
  Distinguished Paper Award
  Invited to TOPC Special Issue

• Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness arXiv
  Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai.
  STOC 2025: ACM Symposium on Theory of Computing.

• Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations arXiv
  Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai.
  STOC 2025: ACM Symposium on Theory of Computing.

• Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights arXiv
  Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin Hao Su.
  ESA 2024: European Symposium on Algorithms.

• Finding a Small Vertex Cut on Distributed Networks arXiv
  Yonggang Jiang, Sagnik Mukhopadhyay.
  STOC 2023: ACM Symposium on Theory of Computing.

• Robust and Optimal Contention Resolution without Collision Detection arXiv
  Yonggang Jiang, Chaodong Zheng.
  SPAA 2022: ACM Symposium on Parallelism in Algorithms and Architectures.

• Tight Trade-off in Contention Resolution without Collision Detection arXiv
  Yonggang Jiang, Haimin Chen, Chaodong Zheng.
  PODC 2021: ACM Symposium on Principles of Distributed Computing.

We are looking for motivated Hiwis (student assistants) to join the Algorithms & Complexity group (D1) at the Max Planck Institute for Informatics. Students will be co-advised by me and Danupon Nanongkai.

Experience in competitive programming is highly welcome.

Topic 1: Algorithms Engineering

Develop high-performance implementations of fundamental graph algorithms, including shortest paths, maximum flow, matching, with real-world applications.

You are required to have strong understanding of algorithms and solid coding skills.

Topic 2: Theory

Engage in pure theoretical research in graph algorithms, graph theory, parallel algorithms, and distributed computing. This position is highly selective, you are required to have very strong mathematical or algorithmic background and a deep motivation for research.

What we offer:

Opportunity to co-author top-tier research publications.

Flexible working hours and competitive salary.

Contacts

If you are interested, please send me an email with your CV and transcript attached, and specify the topic that you wish to do.

You are also welcome to apply through the official internship program by max planck institutes.