| 2003 | The Relative Worst Order Ratio for On-Line Algorithms. | Joan Boyar, Lene M. Favrholdt |
| 2003 | Reconciling Gene Trees to a Species Tree. | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi |
| 2003 | XOR-Based Schemes for Fast Parallel IP Lookups. | Gian Carlo Bongiovanni, Paolo Penna |
| 2003 | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2003 | An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2003 | Differential Approximation for Some Routing Problems. | Cristina Bazgan, Refael Hassin, Jrme Monnot |
| 2003 | Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. | Andreas Baltz, Anand Srivastav |
| 2003 | Some Properties of MOD | Kazuyuki Amano, Akira Maruoka |
| 2003 | Approximation of a Retrieval Problem for Parallel Disks. | Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma |
| 2000 | Duality in ATM Layout Problems. | Shmuel Zaks |
| 2000 | Triangulations without Minimum-Weight Drawing. | Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang |
| 2000 | The Independence Number of Random Interval Graphs. | Wenceslas Fernandez de la Vega |
| 2000 | Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems. | Kathleen Steinhfel, Andreas Alexander Albrecht, Chak-Kuen Wong |
| 2000 | Speeding Up Pattern Matching by Text Compression. | Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa |
| 2000 | The Hardness of Placing Street Names in a Manhattan Type Map. | Sebastian Seibert, Walter Unger |
| 2000 | Algorithms for a Simple Point Placement Problem. | Joshua Redstone, Walter L. Ruzzo |
| 2000 | Semantical Counting Circuits. | Fabrice Noilhan, Miklos Santha |
| 2000 | Labeling Downtown. | Gabriele Neyer, Frank Wagner |
| 2000 | Dynamically Maintaining the Widest k -Dense Corridor. | Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano |
| 2000 | Modified Binary Searching for Static Tables. | Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri |
| 2000 | The Online Dial-a-Ride Problem under Reasonable Load. | Dietrich Hauptmeier, Sven Oliver Krumke, Jrg Rambau |
| 2000 | Group Updates for Red-Black Trees. | Sabine Hanke, Eljas Soisalon-Soininen |
| 2000 | Faster Exact Solutions for MAX2SAT. | Jens Gramm, Rolf Niedermeier |
| 2000 | Approximating SVP | Irit Dinur |
| 2000 | Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. | Narsingh Deo, Ayman M. Abdalla |