1: Cut-matching Games for Generalized Hypergraph Ratio Cuts
2: Combinatorial Pen Testing (or Consumer Surplus of Deferred-Acceptance Auctions)
3: Fast Correlation Function Calculator – A high-performance pair counting toolkit
4: Multi-Priority Graph Sparsification
5: The Leafed Induced Subtree in chordal and bounded treewidth graphs
6: Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
7: Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
8: Fast Combinatorial Algorithms for Min Max Correlation Clustering
9: Faster Algorithm for Minimum Ply Covering of Points with Unit Squares
10: Partitioned Matching Games for International Kidney Exchange
11: A Safety Framework for Flow Decomposition Problems via Integer Linear Programming
12: Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter
13: The Iteration Number of the Weisfeiler-Leman Algorithm
14: A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback
15: A Bias-Variance-Privacy Trilemma for Statistical Estimation
16: Weitzman’s Rule for Pandora’s Box with Correlations
17: Singular Value Approximation and Sparsifying Random Walks on Directed Graphs