1: Set-Difference Range Queries
2: Approximation Algorithms for Bayesian Multi-Armed Bandit Problems
3: Exact and fixed-parameter algorithms for metro-line crossing minimization problems
4: Faster deterministic Feedback Vertex Set
5: Approximate Nearest Neighbor Search in $\ell_p$
6: Faster Deterministic Algorithms for Packing, Matching and $t$-Dominating Set Problems
7: Iterative Plan Construction for the Workflow Satisfiability Problem
8: A note on scheduling with low rank processing times
9: Approximation Algorithms for Movement Repairmen
10: Minimal Indices for Successor Search
11: Greedy algorithms and poset matroids
12: Analysis of Quickselect under Yaroslavskiy’s Dual-Pivoting Algorithm
13: Computing Tree-depth Faster Than $2^{n}$
14: Fast branching algorithm for Cluster Vertex Deletion
15: Hybrid Indexes for Repetitive Datasets
16: Counting thin subgraphs via packings faster than meet-in-the-middle time
17: Computation in anonymous networks
18: A bad 2-dimensional instance for k-means++
19: Succinct data structures for representing equivalence classes
20: Hypergraph covering problems motivated by genome assembly questions
21: Approximation Algorithm for Sparsest k-Partitioning
22: Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
23: Parallel Algorithm for Longest Common Subsequence in a String
24: Efficient Two-Stage Group Testing Algorithms for Genetic Screening
25: Computing the Greedy Spanner in Linear Space
26: A Local Computation Approximation Scheme to Maximum Matching
27: Optimal Color Range Reporting in One Dimension
28: (Total) Vector Domination for Graphs with Bounded Branchwidth
29: Bank Conflict Free Comparison-based Sorting On GPUs
30: A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure