1: Representing Pattern Matching Algorithms by Polynomial-Size Automata
2: An Optimal Algorithm for Range Search on Multidimensional Points
3: Adaptive Learning a Hidden Hypergraph
4: Lecture Notes on the ARV Algorithm for Sparsest Cut
5: Unit Interval Vertex Deletion: Fewer Vertices are Relevant
6: Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
7: Improved Lower Bounds for Online Hypercube and Rectangle Packing
8: Trip-Based Public Transit Routing Using Condensed Search Trees
9: On Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes
10: Deterministic Graph Exploration with Advice
11: Graphons, mergeons, and so on!
12: Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations
13: Biabduction (and Related Problems) in Array Separation Logic