1: Shorter Labels for Routing in Trees
2: Universal Function Approximation on Graphs
3: Four-Dimensional Dominance Range Reporting in Linear Space
4: Recommending Deployment Strategies for Collaborative Tasks
5: Approximation algorithm for the Multicovering Problem
6: Adversarial Perturbations of Opinion Dynamics in Networks
7: Faster Minimization of Tardy Processing Time on a Single Machine
8: Exact capacitated domination: on the computational complexity of uniqueness
9: Scheduling Lower Bounds via AND Subset Sum
10: Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier
11: Adapting Persistent Data Structures for Concurrency and Speculation
12: Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST
13: Efficient Two-Sided Markets with Limited Information
14: A Scaling Algorithm for Weighted $f$-Factors in General Graphs
15: NP-Completeness Results for Graph Burning on Geometric Graphs
16: An Efficient Implementation of Manacher’s Algorithm
17: The Parameterized Complexity of Guarding Almost Convex Polygons
18: A Spectral Approach to Network Design
19: Hardness of Bounded Distance Decoding on Lattices in $\ell_p$ Norms
20: Speeding up Linear Programming using Randomized Linear Algebra
21: Acceleration with a Ball Optimization Oracle
22: Grammar compression with probabilistic context-free grammar
23: Enumeration of Irredundant Forests
24: Dynamic Distribution-Sensitive Point Location
25: Network disruption: maximizing disagreement and polarization in social networks
26: The Strahler number of a parity game
27: Faster Divergence Maximization for Faster Maximum Flow
28: Dynamic Averaging Load Balancing on Cycles
29: Generating Weakly Chordal Graphs from Arbitrary Graphs
30: Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
31: Efficient Oblivious Database Joins
32: Hidden Words Statistics for Large Patterns