1: Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1
2: Identifying Cluttering Edges in Near-Planar Graphs
3: Solving Unique Games over Globally Hypercontractive Graphs
4: Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary
5: Robust Algorithms on Adaptive Inputs from Bounded Adversaries
6: Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
7: Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
8: Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates
9: Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees
10: Thin trees for laminar families
11: On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the “barriers”
12: A Randomized Approach for Tight Privacy Accounting
13: An Algorithmic Approach to Address Course Enrollment Challenges
14: Detection of Dense Subhypergraphs by Low-Degree Polynomials
15: MANTRA: Temporal Betweenness Centrality Approximation through Sampling
16: Lossy Compressor preserving variant calling through Extended BWT
17: Traversing combinatorial 0/1-polytopes via optimization
18: Graph Sparsification by Approximate Matrix Multiplication
19: Revisiting Block-Diagonal SDP Relaxations for the Clique Number of the Paley Graphs
20: Subcubic algorithm for (Unweighted) Unrooted Tree Edit Distance
21: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud
22: Super-Logarithmic Lower Bounds for Dynamic Graph Problems
23: On Approximate Reconfigurability of Label Cover
24: Parallel Greedy Spanners
25: Random Cuts are Optimal for Explainable k-Medians
26: Optimal PAC Bounds Without Uniform Convergence
27: Higher-dimensional subdiagram matching
28: New Subset Selection Algorithms for Low Rank Approximation: Offline and Online
29: Optimal Eigenvalue Approximation via Sketching
30: Sliding Block Hashing (Slick) – Basic Algorithmic Ideas
31: A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths
32: Provably-Efficient and Internally-Deterministic Parallel Union-Find
33: Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields
34: Uniform Generation of Temporal Graphs with Given Degrees
35: List Defective Colorings: Distributed Algorithms and Applications
36: The Price of Explainability for Clustering
37: Nearly Work-Efficient Parallel DFS in Undirected Graphs
38: Temporal Betweenness Centrality on Shortest Paths
39: Coloring Fast with Broadcasts
40: Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities
41: High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
42: Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
43: How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
44: Learning Narrow One-Hidden-Layer ReLU Networks
45: New Lower Bounds for Adaptive Tolerant Junta Testing
46: How Well Does the Metropolis Algorithm Cope With Local Optima?
47: Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
48: Solving the List Coloring Problem through a Branch-and-Price algorithm