AMG is a half-day workshop that focuses on algorithms for big data and large graphs. The program consists of 3 invited talks, which are aimed at the general DISC audience.
AMG 2026 will be held on Friday, 13th of November 2026 in Rome, Italy. AMG is be co-located with DISC 2026.
Confirmed Speakers
![[Yi-Jun Chang]](./files/changyj.jpg "Yi-Jun Chang")
National University of Singapore, NUS
Yi-Jun Chang is an Assistant Professor of Computer Science at the National University of Singapore. He received his PhD from the University of Michigan in 2019. His research focuses on distributed, parallel, and sublinear graph algorithms. His recent papers received Best Student Paper Awards at PODC 2024, DISC 2025, and PODC 2026, and an Outstanding Paper Award at SPAA 2026.
Title: Approximate All-Pairs Shortest Paths in the Congested Clique Model
Abstract: In this talk, I will present the $O(\log \log \log n)$-round constant-approximate APSP algorithm in the congested clique from my PODC 2024 paper, “Improved All-Pairs Approximate Shortest Paths in the Congested Clique,” coauthored with Hong Duc Bui, Shashwat Chandra, Michal Dory, and Dean Leitersdorf. This unusual $O(\log \log \log n)$ round complexity is still the best known upper bound. I will focus on introducing the techniques and how they are combined to obtain the final algorithm, and I will also discuss subsequent work and remaining open problems.
![[Tijn de Vos]](./files/tijn.jpg "Tijn de Vos")
TU Graz
Tijn is a theoretical computer scientist with a math background. His main interest is in algorithm design, especially for graphs. He is interested in exploring the complexity of problems in various computational models, most notably including distributed computing and dynamic graph algorithms.
Currently, he is a postdoc in the group of Yannic Maus at the Institute of Algorithms and Theory, TU Graz. He completed his PhD under Sebastian Forster at the University of Salzburg.
Title: Computing the Arboricity
Abstract:
The arboricity is an important parameter in many distributed algorithms. However, determining the value of the arboricity -- even approximately -- has received little attention. In this talk, I first give an overview of the algorithms in centralized computing and in the dynamic setting. Then, we consider what is known in the distributed setting and more importantly: we discuss which questions are still open.