1: A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
2: Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem
3: Using a min-cut generalisation to go beyond Boolean surjective VCSPs
4: A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation
5: Convergence of the Non-Uniform Physarum Dynamics
6: A $(4+\epsilon)$-approximation for $k$-connected subgraphs
7: Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
8: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
9: How Many Passengers Can We Serve with Ride-sharing?
10: Solve For Shortest Paths Problem Within Logarithm Runtime
11: Dualization in lattices given by implicational bases
12: Faster parameterized algorithm for Cluster Vertex Deletion
13: A randomized strategy in the mirror game
14: Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications
15: The self-concordant perceptron is efficient on a sub-family feasibility instances
16: Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements
17: Multi-Frequency Phase Synchronization
18: Note on distance matrix hashing
19: Learning Space Partitions for Nearest Neighbor Search
20: Infinite All-Layers Simple Foldability
21: Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute
22: Fair k-Center Clustering for Data Summarization
23: Dolha - an Efficient and Exact Data Structure for Streaming Graphs
24: Guarantees for Spectral Clustering with Fairness Constraints
25: On the Complexity of Approximating Wasserstein Barycenter
26: Almost Boltzmann Exploration
27: Local Distance Constrained Bribery in Voting
28: A Laplacian Approach to $\ell_1$-Norm Minimization
29: Finding a Mediocre Player
30: Star Routing: Between Vehicle Routing and Vertex Cover
31: Competitive Online Optimization under Inventory Constraints
32: Large Minors in Expanders
33: Nearly Optimal Sparse Polynomial Multiplication
34: Black Box Submodular Maximization: Discrete and Continuous Settings
35: Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division
36: On the Complexity of Computing the Topology of Real Algebraic Space Curves