1: Hydrodynamic limit of move-to-front rules and search cost probabilities
2: Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals
3: Algorithmic Aspects of Several Data Transfer Service Optimization Problems
4: An Algorithmic Perspective on Some Network Design, Construction and Analysis Problems
5: Polynomial Time Algorithms for Minimum Energy Scheduling
6: Notes on large angle crossing graphs
7: In-packet Bloom filters: Design and networking applications
8: Optimal Geometric Partitions, Covers and K-Centers
9: An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
10: Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems