1: Stable Nash Equilibria in the Gale-Shapley Matching Game
2: Linear Probing with 5-Independent Hashing
3: Fast Template Matching by Subsampled Circulant Matrix
4: An FPT 2-Approximation for Tree-Cut Decomposition
5: Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited
6: Array Layouts for Comparison-Based Searching
7: Estimating operator norms using covering nets
8: Boosting Bayesian Parameter Inference of Nonlinear Stochastic Differential Equation Models by Hamiltonian Scale Separation
9: Computing the Rectilinear Center of Uncertain Points in the Plane
10: Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution
11: FPTAS for Hardcore and Ising Models on Hypergraphs
12: Streaming Verification in Data Analysis
13: Finding Two Edge-Disjoint Paths with Length Constraints
14: Randomised enumeration of small witnesses using a decision oracle
15: A Parameterized Algorithm for Mixed Cut
16: Lower bounds for approximation schemes for Closest String
17: A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
18: A greedy algorithm for the minimization of a ratio of same-index element sums from two positive arrays
19: Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
20: On space efficiency of algorithms working on structural decompositions of graphs
21: A linear approximation algorithm for the BPP with the best possible absolute approximation ratio
22: Parallel Query in the Suffix Tree
23: Efficient Algorithms for Morphisms over Omega-Regular Languages
24: Communication Complexity (for Algorithm Designers)