1: Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut
2: Online Vertex Cover and Matching: Beating the Greedy Algorithm
3: Suffix Tree of Alignment: An Efficient Index for Similar Data
4: A Heuristic for Magic and Antimagic Graph Labellings
5: Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems
6: An Improved Three-Weight Message-Passing Algorithm
7: On Advice Complexity of the k-server Problem under Sparse Metrics
8: Finding Distinct Subpalindromes Online
9: Bandits with Knapsacks
10: Full Square Rhomboids and Their Algebraic Expressions
11: On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs
12: Fibonacci Graphs and their Expressions
13: A faster FPT algorithm for Bipartite Contraction
14: OBDD-Based Representation of Interval Graphs
15: Fingerprints in Compressed Strings
16: Dynamic Top-$k$ Dominating Queries
17: FPT is Characterized by Useful Obstruction Sets
18: Heaviest Induced Ancestors and Longest Common Substrings