1: Shortest Paths and Distances with Differential Privacy
2: Hardness of RNA Folding Problem with Four Symbols
3: A Hierarchical Aggregation Framework for Efficient Multilevel Visual Exploration and Analysis
4: Bin Packing with Multiple Colors
5: Planar Disjoint-Paths Completion
6: Eventually Consistent Register Revisited
7: A Polynomial Lower Bound for Testing Monotonicity
8: Tight Running Time Lower Bounds for Vertex Deletion Problems
9: Better $s$-$t$-Tours by Gao Trees
10: Complexity and Approximability of Parameterized MAX-CSPs
11: The Invisible Hand of Dynamic Market Pricing
12: Wishart Mechanism for Differentially Private Principal Components Analysis
13: Fast Computation on Semirings Isomorphic to $(\times, \max)$ on $\mathbb{R}_+$
14: Randomization can be as helpful as a glimpse of the future in online computation
15: Algorithms for Communication Problems for Mobile Agents Exchanging Energy
16: A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
17: Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made
18: Enumeration and Random Generation of Unlabeled Classes of Graphs: A Practical Study of Cycle Pointing and the Dissymmetry Theorem
19: On Sketching Quadratic Forms
20: Diffusing Private Data over Networks
21: A parallel algorithm for the constrained shortest path problem on lattice graphs
22: Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent
23: On Binary Embedding using Circulant Matrices
24: Near-Optimal UGC-hardness of Approximating Max k-CSP_R
25: Approximating Directed Steiner Problems via Tree Embedding
26: Use of Eigenvector Centrality to Detect Graph Isomorphism
27: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture