1: Cache-Oblivious Persistence
2: Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network
3: The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
4: A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem
5: Fractional programming formulation for the vertex coloring problem
6: Deconvolution Using Projections Onto The Epigraph Set of a Convex Cost Function
7: On the Integrality Ratio of the Subtour LP for Euclidean TSP
8: The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
9: Efficiently navigating a random Delaunay triangulation
10: Approximate Counting of Matchings in $(3,3)$-Hypergraphs
11: Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
12: Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
13: Approximating the Cubicity of Trees
14: Solving MaxSAT and #SAT on structured CNF formulas
15: Resourceful Contextual Bandits
16: On low treewidth graphs and supertrees