1: An Optimal Labeling Scheme for Ancestry Queries
2: Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
3: Memory Consistency Conditions for Self-Assembly Programming
4: Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion
5: The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
6: A note on the data-driven capacity of P2P networks
7: Succinct Representation of Well-Spaced Point Clouds
8: FPT Algorithms for Connected Feedback Vertex Set
9: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
10: Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs
11: On Ordinal Covering of Proposals Using Balanced Incomplete Block Designs
12: Packet Scheduling in a Size-Bounded Buffer
13: Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation