1: Dynamic Complexity of Planar 3-connected Graph Isomorphism
2: Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone Submodular Maximization
3: On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions
4: New tabulation and sparse dynamic programming based techniques for sequence similarity problems
5: A Note on the Longest Common Compatible Prefix Problem for Partial Words
6: Improved integrality gap upper bounds for TSP with distances one and two
7: Shortest Unique Substring Query Revisited
8: The role of planarity in connectivity problems parameterized by treewidth
9: Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs
10: Approximate Least Squares
11: Benders, Nested Benders and Stochastic Programming: An Intuitive Introduction
12: A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
13: On Solving Manufacturing Cell Formation via Bicluster Editing
14: A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm
15: Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time
16: Compressed Spaced Suffix Arrays
17: Counting Popular Matchings in House Allocation Problems
18: On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion
19: Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
20: A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem