Maximum matchings in planar graphs via gaussian elimination Marcin MuchaPiotr Sankowski OriginalPaper Pages: 3 - 20
Hardness and approximation results for packing steiner trees Joseph CheriyanMohammad R. Salavatipour OriginalPaper Pages: 21 - 43
Direct routing: Algorithms and complexity Costas BuschMalik Magdon-IsmailPaul Spirakis OriginalPaper Pages: 45 - 68
Maximizing throughput in multi-queue switches Yossi AzarArik Litichevskey OriginalPaper Pages: 69 - 90
Approximate unions of lines and minkowski sums Marc van KreveldA. Frank van der Stappen OriginalPaper Pages: 91 - 107
Swap and mismatch edit distance Amihood AmirEstrella EisenbergEly Porat OriginalPaper Pages: 109 - 120
An experimental study of random knapsack problems Rene BeierBerthold Vöcking OriginalPaper Pages: 121 - 136
Data migration on parallel disks: Algorithms and evaluation Leana GolubchikSamir KhullerYung-Chun (Justin) Wan OriginalPaper Pages: 137 - 158