1: Narrow sieves for parameterized paths and packings
2: Using CSP To Improve Deterministic 3-SAT
3: Efficient Sketches for the Set Query Problem
4: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
5: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
6: Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations
7: Improved approximation bounds for Vector Bin Packing
8: Top-K Color Queries for Document Retrieval
9: Flows in One-Crossing-Minor-Free Graphs
10: Quantum search by partial adiabatic evolution
11: An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
12: A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
13: Infectious Random Walks
14: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model
15: Submodular Maximization by Simulated Annealing
16: Analysing Astronomy Algorithms for GPUs and Beyond
17: Online Stochastic Matching: Online Actions Based on Offline Statistics
18: Vsep-New Heuristic and Exact Algorithms for Graph Automorphism Group Computation
19: Complexity of Splits Reconstruction for Low-Degree Trees
20: Multimode Control Attacks on Elections
21: Maximum Bipartite Matching Size And Application to Cuckoo Hashing
22: Parameterizing by the Number of Numbers
23: Symmetric Submodular Function Minimization Under Hereditary Family Constraints
24: Matroid Secretary Problem in the Random Assignment Model
25: Faster Replacement Paths