Avatar
Yonggang Jiang
PhD candidate at MPI-INF
yjiang mpi-inf.mpg.de
E14, Room 315, Saarland Informatics Campus

Short Bio

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

My research interest is theoretical computer science in general. My current research focus is on developing efficient graph algorithms in various computation models.

Education

Max Planck Institute for Informatics
2023.4 - now
Doctoral study in Computer Science

(2021.10 - 2023.3) Preparatory Phase for doctoral study.

Nanjing University
2017.9 - 2021.6
Bachelor of Science in Computer Science and Technology

Thanks to Yitong Yin and Chaodong Zheng for supervising my undergraduate research, and to Binkai Lin for supervising my undergraduate thesis.

I spent some wonderful years at the theory group, doing research and having fun with my peers and seniors. Thanks to all of them.

(2020.1 - 2020.5) Exchange student at University of California, Berkeley.

Publications

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

  • 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.

  • Shortcuts and Transitive-Closure Spanners Approximation arXiv
    Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai.

  • New Oracles and Labeling Schemes for Vertex Cut Queries arXiv
    Yonggang Jiang, Merav Parter, Asaf Petruschka.

  • Perfect Simulation of Las Vegas Algorithms via Local Computation arXiv
    Xinyu Fu, Yonggang Jiang, Yitong Yin.

  • Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
    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
    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 [Talk,Slides]
    Yonggang Jiang, Haimin Chen, Chaodong Zheng.
    PODC 2021: ACM Symposium on Principles of Distributed Computing.

Awards

  • Outstanding Graduates of Nanjing University, 2021.
  • National Elite Program Scholarship. Outstanding Prize (top1), 2018,2019,2020.
  • China Collegiate Programming Contest (CCPC), reginal contest. Gold Medal (Thanks: Fangzhou Lan, Yiding Li), 2018.
  • National Olympiad in Informatics in Provinces (NOIP). First Prize, 2015.

Misc.

The URL name “jyg94” is a combination of my name pronounced in Chinese (Jiang Yong Gang) and the number 94 (which has the same pronunciation as the phrase “It is” in Chinese, it doesn’t mean I was born in 1994). I got this idea from Weiming Feng’s website.