Hamiltonicity and colorings of arrangement graphs. On the temporal HZY compression scheme. Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. Communication complexity of document exchange. A PTAS for the multiple knapsack problem.
Approximation algorithms for data placement on parallel disks.
Movement minimization in conveyor flow shop processing. Computing the quartet distance between evolutionary trees. On local search and placement of meters in networks. An approximation algorithm for the covering Steiner problem. On the red-blue set cover problem.