1: A Survey of Tree Convex Sets Test
2: Solving $k$-Nearest Neighbor Problem on Multiple Graphics Processors
3: Rivisiting Token/Bucket Algorithms in New Applications
4: Towards a Centralized Scheduling Framework for Communication Flows in Distributed Systems
5: Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
6: Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees
7: Curse of Dimensionality in Pivot-based Indexes
8: A New Upper Bound on 2D Online Bin Packing
9: Computing the tree number of a cut-outerplanar graph
10: Computational Complexity and Numerical Stability of Linear Problems
11: A Memetic Algorithm for the Multidimensional Assignment Problem
12: Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains
13: Efficient Algorithms for Several Constrained Resource Allocation, Management and Discovery Problems
14: A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds
15: Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
16: On the effectiveness of a binless entropy estimator for generalised entropic forms