1: Stochastic Optimization and Learning for Two-Stage Supplier Problems
2: A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
3: Parameterized Complexity of $(A,\ell)$-Path Packing
4: A simpler strong refutation of random $k$-XOR
5: Online Nash Social Welfare Maximization with Predictions
6: Adjustable Coins
7: Sparsifying the Operators of Fast Matrix Multiplication Algorithms
8: Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
9: An Improved Exact Sampling Algorithm for the Standard Normal Distribution
10: ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
11: Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem
12: Storyline Visualizations with Ubiquitous Actors
13: Improved Bounds for Distributed Load Balancing
14: Connected Components in Undirected Set–Based Graphs. Applications in Object–Oriented Model Manipulation
15: Sketching semidefinite programs for faster clustering
16: Coloring Fast Without Learning Your Neighbors’ Colors
17: Approximation in (Poly-) Logarithmic Space
18: Scheduling activities with time-dependent durations and resource consumptions
19: FedSKETCH: Communication-Efficient and Private Federated Learning via Sketching
20: Settling SETH vs. Approximate Sparse Directed Unweighted Diameter (up to (NU)NSETH)
21: Further Unifying the Landscape of Cell Probe Lower Bounds
22: Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
23: Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
24: Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
25: Soft Sequence Heaps
26: Deterministic Replacement Path Covering
27: On the tree-width of even-hole-free graphs
28: A new notion of commutativity for the algorithmic Lov'{a}sz Local Lemma
29: Graph Drawing via Gradient Descent, $(GD)^2$
30: Cadences in Grammar-Compressed Strings
31: Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification
32: Inset Edges Effect and Average Distance of Trees
33: On Testability of First-Order Properties in Bounded-Degree Graphs
34: An explicit construction of graphs of bounded degree that are far from being Hamiltonian
35: On seat allocation problem with multiple merit lists
36: Consistent $k$-Median: Simpler, Better and Robust
37: Consideration for effectively handling parallel workloads on public cloud system
38: Towards a characterization of stretchable aligned graphs