1: An Accelerated Directional Derivative Method for Smooth Stochastic Convex Optimization
2: Random Order Contention Resolution Schemes
3: Multi-Level Steiner Trees
4: A 3/2-approximation algorithm for the Student-Project Allocation problem
5: Maximizing the Number of Spanning Trees in a Connected Graph
6: A $5k$-vertex Kernel for $P_2$-packing
7: Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
8: Some Reduction Operations to Pairwise Compatibility Graphs
9: Characterizing Star-PCGs
10: From Regular Expression Matching to Parsing
11: Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
12: Personalized PageRank dimensionality and algorithmic implications
13: Set Similarity Search for Skewed Data
14: Beating the integrality ratio for s-t-tours in graphs
15: Linear Programming Bounds for Randomly Sampling Colorings
16: Contextual Search via Intrinsic Volumes
17: Dynamic Set Cover: Improved Algorithms & Lower Bounds
18: Prompt Scheduling for Selfish Agents
19: Restructuring expression dags for efficient parallelization
20: Parameterized Algorithms for the Matrix Completion Problem
21: A Non-blocking Buddy System for Scalable Memory Allocation on Multi-core Machines
22: A Tight Extremal Bound on the Lov'{a}sz Cactus Number in Planar Graphs
23: Approximating multiobjective combinatorial optimization problems with the OWA criterion
24: Optimal Document Exchange and New Codes for Insertions and Deletions
25: Testing Identity of Multidimensional Histograms
26: Approximating Operator Norms via Generalized Krivine Rounding
27: Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
28: OLCPM: An Online Framework for Detecting Overlapping Communities in Dynamic Social Networks
29: Weighted proper orientations of trees and graphs of bounded treewidth
30: A synopsis of comparative metrics for classifications
31: A PTAS for Euclidean TSP with Hyperplane Neighborhoods
32: Bipartitioning Problems on Graphs with Bounded Tree-Width
33: The Generalized Matrix Chain Algorithm
34: Rapid mixing of Glauber dynamics for colorings below Vigoda’s $11/6$ threshold
35: Unleashing Linear Optimizers for Group-Fair Learning and Optimization
36: Fully Dynamic Effective Resistances
37: On Geodesically Convex Formulations for the Brascamp-Lieb Constant
38: Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs
39: Fast Feasible and Unfeasible Matrix Multiplication
40: Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
41: Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
42: Graph Pattern Matching Preserving Label-Repetition Constraints
43: Dualities in Tree Representations
44: Design and Implementation of Dynamic Memory Management in a Reversible Object-Oriented Programming Language
45: Fast Prefix Search in Little Space, with Applications
46: Efficient algorithms for tensor scaling, quantum marginals and moment polytopes
47: On the Efficiency of Localized Work Stealing
48: Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
49: Dynamic Low-Stretch Trees via Dynamic Low-Diameter Decompositions
50: Connectivity in Random Annulus Graphs and the Geometric Block Model
51: On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms
52: The threshold for SDP-refutation of random regular NAE-3SAT