1: On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
2: Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences
3: Subnetwork enumeration algorithms for multilayer networks
4: Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise
5: Guarding Polyominoes under $k$-Hop Visibility
6: Conditionally Optimal Parallel Coloring of Forests
7: Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
8: Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
9: Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
10: Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
11: Approximately: Independence Implies Vertex Cover
12: An Algorithm for the Longest Common Subsequence and Substring Problem
13: Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
14: Percolation in higher order networks via mapping to chygraphs
15: A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
16: An Algorithm for the Constrained Longest Common Subsequence and Substring Problem
17: VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
18: One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
19: Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
20: Fast Coloring Despite Congested Relays
21: Optimal Online Discrepancy Minimization
22: Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
23: Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
24: Quantum speedups for stochastic optimization
25: Meta-theorems for Parameterized Streaming Algorithms
26: Kernelization of Counting Problems
27: Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
28: Randomized and quantum query complexities of finding a king in a tournament
29: Single-Source Unsplittable Flows in Planar Graphs
30: An Overview of Analysis Methods and Evaluation Results for Caching Strategies
31: A logarithmic approximation algorithm for the activation edge multicover problem
32: Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
33: Factoring Pattern-Free Permutations into Separable ones
34: Knapsack with Small Items in Near-Quadratic Time
35: Nucleotide String Indexing using Range Matching
36: A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks
37: Self-Directed Linear Classification
38: Testing Graph Properties with the Container Method
39: An Improved Approximation Algorithm for the Max-$3$-Section Problem
40: TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
41: Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space