1: Mixing Time for the Solid-on-Solid Model
2: Improved Parameterized Algorithms for Constraint Satisfaction
3: Efficient algorithms for three-dimensional axial and planar random assignment problems
4: Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly
5: Determinant Sums for Undirected Hamiltonicity
6: Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound
7: Is submodularity testable?
8: Improved Fast Similarity Search in Dictionaries