1: Solving $k$-SUM using few linear queries
2: On Lagrangian Relaxation and Reoptimization Problems
3: The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency
4: Computing the $L_1$ Geodesic Diameter and Center of a Polygonal Domain
5: General Graph Identification By Hashing
6: QuickProbs 2: towards rapid construction of high-quality alignments of large protein families
7: The lateral transhipment problem with a-priori routes, and a lot sizing application
8: Reduction rules for the maximum parsimony distance on phylogenetic trees
9: A Quadratic Assignment Formulation of the Graph Edit Distance
10: Optimizing the Number of Gates in Quantum Search
11: Achievable Performance of Blind Policies in Heavy Traffic
12: Mining Top-K Co-Occurrence Items
13: Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
14: Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time