1: Fast Incremental and Personalized PageRank
2: The Power of Nondeterminism in Self-Assembly
3: Conflict-Free Coloring Made Stronger
4: Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network
5: Universal Loop-Free Super-Stabilization
6: Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
7: Identifying Shapes Using Self-Assembly (extended abstract)
8: Locating a tree in a phylogenetic network
9: Fast Self-Stabilizing Minimum Spanning Tree Construction
10: Quasirandom Load Balancing
11: Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP
12: New modelling technique for aperiodic-sampling linear systems
13: Complexity dichotomy on partial grid recognition
14: A Derandomized Sparse Johnson-Lindenstrauss Transform
15: Convex Relaxations for Subset Selection
16: Quantum algorithms for formula evaluation
17: Should Static Search Trees Ever Be Unbalanced?
18: A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
19: Methods for Accelerating Conway’s Doomsday Algorithm (part 1)
20: Practical Range Aggregation, Selection and Set Maintenance Techniques
21: Approximating Sparsest Cut in Graphs of Bounded Treewidth
22: An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
23: New Developments in Quantum Algorithms