1: Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
2: On the Local Structure of Stable Clustering Instances
3: The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?
4: Approximate String Matching: Theory and Applications (La Recherche Approch'ee de Motifs : Th'eorie et Applications)
5: Scheduling Maintenance Jobs in Networks
6: Computing a tree having a small vertex cover
7: A parallel approach to bi-objective integer programming
8: Binets: fundamental building blocks for phylogenetic networks