1: Combining the Connection Scan Algorithm with Contraction Hierarchies
2: Multiple Server SRPT with speed scaling is competitive
3: Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
4: Robust Approach to Restricted Items Selection Problem
5: Succinct Representation for (Non)Deterministic Finite Automata
6: Optimal In-place Algorithms for Basic Graph Problems
7: Decentralized Deep Learning with Arbitrary Communication Compression
8: Translating between the representations of a ranked convex geometry
9: The $k$-Dimensional Weisfeiler-Leman Algorithm
10: Efficient Approximation Algorithms for Adaptive Seed Minimization
11: Managing Multiple Mobile Resources
12: SciPy 1.0–Fundamental Algorithms for Scientific Computing in Python
13: An FPT algorithm for orthogonal buttons and scissors
14: Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
15: Classification of linear codes using canonical augmentation
16: Reducing Path TSP to TSP
17: Medians in median graphs and their cube complexes in linear time
18: Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank
19: P-SLOCAL-Completeness of Maximum Independent Set Approximation
20: Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature
21: Constant Girth Approximation for Directed Graphs in Subquadratic Time
22: How to Store a Random Walk
23: Fast Deterministic Constructions of Linear-Size Spanners and Skeletons
24: GAMA: A Novel Algorithm for Non-Convex Integer Programs
25: Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
26: Enumerating Range Modes
27: Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max
28: Exhaustive Exact String Matching: The Analysis of the Full Human Genome
29: The Strong 3SUM-INDEXING Conjecture is False
30: Integrality Gap of the Vertex Cover Linear Programming Relaxation
31: New $(\alpha,\beta)$ Spanners and Hopsets
32: On Approximating Degree-Bounded Network Design Problems
33: Almost Shortest Paths with Near-Additive Error in Weighted Graphs
34: Strongly Chordal Graph Generation using Intersection Graph Characterisation
35: Subexponential-Time Algorithms for Sparse PCA
36: Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
37: Adventures in Abstraction: Reachability in Hierarchical Drawings
38: Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
39: A Tight Degree 4 Sum-of-Squares Lower Bound for the Sherrington-Kirkpatrick Hamiltonian
40: Low-Rank Matrix Completion: A Contemporary Survey
41: PingPong: Packet-Level Signatures for Smart Home Device Events
42: Improved randomized algorithm for $k$-submodular function maximization
43: Spartan: Sparse Robust Addressable Networks
44: Minimal Absent Words in Rooted and Unrooted Trees
45: Parameterized Pre-coloring Extension and List Coloring Problems