Abstract is missing.
- Front Matter [doi]
- A Simple Algorithm for Multiple-Source Shortest Paths in Planar DigraphsDebarati Das 0001, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen. 1-11 [doi]
- Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time BoundsFabrizio Grandoni 0001, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad. 12-23 [doi]
- Simpler Adjacency Labeling for Planar Graphs with B-TreesPawel Gawrychowski, Wojciech Janczewski. 24-36 [doi]
- The Parameterized Complexity of the Survivable Network Design ProblemAndreas Emil Feldmann, Anish Mukherjee 0002, Erik Jan van Leeuwen. 37-56 [doi]
- Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded SizeEdward Pyne, Salil P. Vadhan. 57-67 [doi]
- Finding Relevant Points for Nearest-Neighbor ClassificationDavid Eppstein. 68-78 [doi]
- A Simple Algorithm for Computing the Zone of a Line in an Arrangement of LinesHaitao Wang. 79-86 [doi]
- Topological Art in Simple GalleriesDaniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber. 87-116 [doi]
- Understanding Nesterov's Acceleration via Proximal Point MethodKwangjun Ahn, Suvrit Sra. 117-130 [doi]
- Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of AnalysisIoannis Anagnostides, Ioannis Panageas. 131-160 [doi]
- Nearly Tight Bounds for Discrete Search under Outlier NoiseAnindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey. 161-173 [doi]
- Parameterized Convexity TestingAbhiruk Lahiri, Ilan Newman, Nithin Varma. 174-181 [doi]
- Uniformity Testing in the Shuffle Model: Simpler, Better, FasterClément L. Canonne, Hongyi Lyu. 182-202 [doi]
- Tight Bounds for Differentially Private Anonymized HistogramsPasin Manurangsi. 203-213 [doi]
- Adversarially Robust Streaming via Dense-Sparse Trade-offsOmri Ben-Eliezer, Talya Eden, Krzysztof Onak. 214-227 [doi]
- k-Center with Constant Types of RadiiXinrui Jia 0001, Lars Rohwedder, Kshiteej Sheth, Ola Svensson. 228-237 [doi]
- An explicit vector algorithm for high-girth MaxCutJessica K. Thompson, Ojas Parekh, Kunal Marwaha. 238-246 [doi]
- A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load BalancingSharat Ibrahimpur, Chaitanya Swamy. 247-256 [doi]
- The Short-Side Advantage in Random Matching MarketsLinda Cai, Clayton Thomas. 257-267 [doi]
- Oblivious Online Contention Resolution SchemesHu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang 0002. 268-278 [doi]
- Faster Exponential Algorithm for Permutation Pattern MatchingPawel Gawrychowski, Mateusz Rzepecki. 279-284 [doi]
- 2Charles Bouillaguet, Claire Delaplace, Monika Trimoska. 285-296 [doi]
- Parameterizing the Permanent: Hardness for fixed excluded minorsRadu Curticapean, Mingji Xia. 297-307 [doi]
- A Tighter Relation Between Hereditary Discrepancy and Determinant Lower BoundHaotian Jiang, Victor Reis. 308-313 [doi]
- The Quantum Union Bound made easyRyan O'Donnell, Ramgopal Venkateswaran. 314-320 [doi]