1: Theory and Applications of N-Fold Integer Programming
2: Secure Multidimensional Queries in Tiered Sensor Networks
3: Constrained Function Based En-Route Filtering for Sensor Networks
4: Hitting Diamonds and Growing Cacti
5: Ptolemaic Indexing
6: Improved Algorithm for Degree Bounded Survivable Network Design Problem
7: A graph polynomial for independent sets of bipartite graphs
8: Efficient Higher Order Derivatives of Objective Functions Composed of Matrix Operations
9: Efficient Fully-Compressed Sequence Representations
10: An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence
11: Faster FAST(Feedback Arc Set in Tournaments)
12: Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth