1: Take it or Leave it: Running a Survey when Privacy Comes at a Cost
2: Distributed Private Heavy Hitters
3: Algorithms for Sampling 3-Orientations of Planar Triangulations
4: Strongly universal string hashing is fast
5: A polynomial time approximation scheme for computing the supremum of Gaussian processes
6: A Planarity Test via Construction Sequences
7: Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
8: Solving Single-digit Sudoku Subproblems
9: Computing Lempel-Ziv Factorization Online
10: Scheduling and allocation algorithm for an elliptic filter
11: L1-norm minimization for quaternion signals
12: Persistent Monitoring in Discrete Environments: Minimizing the Maximum Weighted Latency Between Observations
13: (Really) Tight bounds for dispatching binary methods
14: Preserving Terminal Distances using Minors
15: Computing L1 Shortest Paths among Polygonal Obstacles in the Plane
16: Fixed-parameter tractability of multicut in directed acyclic graphs
17: Stochastic Vehicle Routing with Recourse
18: Approximate Counting of Matchings in Sparse Hypergraphs
19: An efficient algorithm for the diameter of Cayley graphs generated by transposition trees
20: Fast computation of the performance evaluation of biometric systems: application to multibiometric
21: The Power of Local Information in Social Networks
22: Maximum Inner-Product Search using Tree Data-structures