1: Walking Through Waypoints
2: Reconstructing Generalized Staircase Polygons with Uniform Step Length
3: Whole Genome Phylogenetic Tree Reconstruction Using Colored de Bruijn Graphs
4: Learning Multi-item Auctions with (or without) Samples
5: A Simple Balanced Search Tree with No Balance Criterion
6: MILP and Max-Clique based heuristics for the Eternity II puzzle
7: Dynamic Shortest Path and Transitive Closure Algorithms: A Survey
8: Optimal Net-Load Balancing in Smart Grids with High PV Penetration
9: Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data
10: Estimating graph parameters with random walks
11: Distributed Colour Reduction Revisited
12: To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
13: Pairing heaps: the forward variant
14: FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search
15: Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
16: Parameterized complexity of machine scheduling: 15 open problems
17: Constructing Light Spanners Deterministically in Near-Linear Time
18: Stabilizing Weighted Graphs
19: Sharp Bounds for Generalized Uniformity Testing
20: Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
21: Enhancing KiWi - Scalable Concurrent Key-Value Map