1: An algorithm for canonical forms of finite subsets of $\mathbb{Z}^d$ up to affinities
2: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
3: Robust Adaptive Routing Under Uncertainty
4: Indexing Cost Sensitive Prediction
5: On the Complexity of Role Colouring Planar Graphs, Trees and Cographs
6: Complexity of Nondeterministic Graph Parameter Testing
7: Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
8: Fast Shortest Path Routing in Transportation Networks with Time-Dependent Road Speeds
9: Subset seed automaton
10: Relax, no need to round: integrality of clustering formulations
11: Improved Approximation Algorithms for Projection Games
12: Efficient Online Strategies for Renting Servers in the Cloud
13: Fast Approximate Matrix Multiplication by Solving Linear Systems
14: Quantified Conjunctive Queries on Partially Ordered Sets
15: On Unconstrained Quasi-Submodular Function Optimization
16: Approximate Revenue Maximization in Interdependent Value Settings
17: Tractable Pathfinding for the Stochastic On-Time Arrival Problem
18: Speeding Up Graph Algorithms via Switching Classes
19: Computing Multiplicative Order and Primitive Root in Finite Cyclic Group
20: Approximation algorithms for Capacitated Facility Location Problem with Penalties