[DMANET] HALG 2025 -- Call for Participation (list of survey/invited talks)

The 10th IGAFIT Highlights of Algorithms conference (HALG 2025)
Zurich, June 4-6, 2025.
https://2025.highlightsofalgorithms.org/index.html

Early registration (by April 28th, 2025)
Hotel reservations (depending on hotel - earliest one by April 9)

The IGAFIT Highlights of Algorithms (HALG) conference is a forum for presenting the
highlights of recent developments in algorithms and for discussing potential
further advances in this area. The conference will provide a broad
picture of the latest research in algorithms through a series of invited talks, as
well as the possibility for all researchers and students to present their recent
results through a series of short talks and poster presentations.
Attending the Highlights of Algorithms conference will also be an opportunity for
networking and meeting leading researchers in algorithms.

Here is a partial list of the invited talks/surveys:

Shay Solomon - Survey on spanners
Sergei Vassilvitskii - Survey on learning-augmented algorithms
Mohsen Ghaffari - Survey on deterministic distributed algorithms
Sebastian Forster - Survey on dynamic algorithms
Yael Kalai - Survey on verifying quantum computation

Mihir Singhal - Optimal quantile estimation: beyond the comparison model
Louis Golowich - New Explicit Constant-Degree Lossless Expanders
Yasamin Nazari - On Dynamic Graph Algorithms with Predictions
Shuyi Yan - Edge-Weighted Online Stochastic Matching: Beating 1−1/e
Xi Chen - Computing a Fixed Point of Contraction Maps in Polynomial Queries
Ewin Tang - High-Temperature Gibbs States are Unentangled and Efficiently Preparable
Greg Bodwin - An Alternate Proof of Near-Optimal Light Spanners
Michal Feldman - Fair Division via Quantile Shares
Jeremy Fineman - Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛^8/9) Time
Richard Hladik - Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
Christoph Grunau - Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
Max Probst Gutenberg - Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Soheil Behnezhad - Fully Dynamic Matching and Ordered Ruzsa-Szemer´edi Graphs
Oliver Hinder - The Price of Adaptivity in Stochastic Convex Optimization
Prasanna Ramakrishnan - Breaking the Metric Voting Distortion Barrier

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************