1: Multi-Value Rule Sets
2: A General Framework for Robust Interactive Learning
3: Balanced Judicious Partition is Fixed-Parameter Tractable
4: Quantum query complexity of entropy estimation
5: Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation
6: A generative model for sparse, evolving digraphs
7: Understanding the Correlation Gap for Matchings
8: Efficient Neighbor-Finding on Space-Filling Curves
9: Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
10: A recognition algorithm for simple-triangle graphs
11: Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams
12: On vertex coloring without monochromatic triangles
13: Reaching a Target in the Plane with no Information
14: A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width
15: Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets
16: Probabilistic Analysis of the Dual-Pivot Quicksort “Count”
17: Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
18: Communication-free Massively Distributed Graph Generation
19: The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph
20: Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow
21: Kernelization Lower Bounds for Finding Constant-Size Subgraphs
22: Uniformly bounded regret in the multi-secretary problem
23: A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics