1: An Exact Algorithm for Side-Chain Placement in Protein Design
2: The tractability of CSP classes defined by forbidden patterns
3: Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
4: Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
5: A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy
6: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
7: Improved space-time tradeoffs for approximate full-text indexing with one edit error
8: Channel Assignment via Fast Zeta Transform
9: Fast Set Intersection in Memory
10: Direction-Reversing Quasi-Random Rumor Spreading with Restarts
11: Optimal query/update tradeoffs in versioned dictionaries
12: Constant-Time Algorithms for Sparsity Matroids
13: Linear pattern matching on sparse suffix trees
14: Accelerating Nearest Neighbor Search on Manycore Systems