1: Efficient and Modular Coalgebraic Partition Refinement
2: Computation-Aware Data Aggregation
3: Polyhedra Circuits and Their Applications
4: Enhanced string factoring from alphabet orderings
5: Formulations for designing robust networks. An application to wind power collection
6: Efficient Graph Compression Using Huffman Coding Based Techniques
7: Two Algorithms in Group Theory
8: Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees
9: Solving $(k-1)$-Stable Instances of k-Terminal Cut with Isolating Cuts
10: The Limits of Post-Selection Generalization
11: Tight Bound of Incremental Cover Trees for Dynamic Diversification
12: On the Complexity of Detecting Convexity over a Box
13: Fast Distance Sensitivity Oracle for Multiple Failures
14: Advice Complexity of Priority Algorithms
15: PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review
16: Approximate Submodular Functions and Performance Guarantees
17: Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity
18: Greedy and Local Ratio Algorithms in the MapReduce Model
19: Property Testing for Differential Privacy
20: On Sketching the $q$ to $p$ norms
21: Subspace Embedding and Linear Regression with Orlicz Norm
22: Mining frequent items in unstructured P2P networks
23: A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
24: Zip Trees
25: Matching Observations to Distributions: Efficient Estimation via Sparsified Hungarian Algorithm
26: Delegated Search Approximates Efficient Search
27: Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming
28: NISQ circuit compilation is the travelling salesman problem on a torus
29: Deterministic $O(1)$-Approximation Algorithms to 1-Center Clustering with Outliers
30: Approximating real-rooted and stable polynomials, with combinatorial applications
31: A unifying method for the design of algorithms canonizing combinatorial objects
32: Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
33: Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
34: A Faster External Memory Priority Queue with DecreaseKeys
35: The compressions of reticulation-visible networks are tree-child
36: Game-theoretic derivation of upper hedging prices of multivariate contingent claims and submodularity
37: An output-sensitive algorithm for the minimization of 2-dimensional String Covers
38: Hardness and algorithmic results for the approximate cover problem
39: Instance-Optimality in the Noisy Value-and Comparison-Model — Accept, Accept, Strong Accept: Which Papers get in?
40: A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization