| 2000 | Higher Order Delaunay Triangulations. | Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld |
| 2000 | I/O-Efficient Well-Separated Pair Decomposition and Its Applications. | Sathish Govindarajan, Tams Lukovszki, Anil Maheshwari, Norbert Zeh |
| 2000 | Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
| 2000 | Online Scheduling Revisited. | Rudolf Fleischer, Michaela Wahl |
| 2000 | On Multicriteria Online Problems. | Michele Flammini, Gaia Nicosia |
| 2000 | K-D Trees Are Better when Cut on the Longest Side. | Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich |
| 2000 | Property Testing in Computational Geometry. | Artur Czumaj, Christian Sohler, Martin Ziegler |
| 2000 | The Minimum Range Assignment Problem on Linear Radio Networks. | Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri |
| 2000 | A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |
| 2000 | Range Searching Over Tree Cross Products. | Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook |
| 2000 | Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. | Peter Brass |
| 2000 | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal |
| 2000 | On R-trees with Low Stabbing Number. | Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars |
| 2000 | Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. | Andrs A. Benczr, Ottilia Flp |
| 2000 | On Recognizing Cayley Graphs. | Lali Barrire, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson |
| 2000 | Online Algorithms for Caching Multimedia Streams. | Matthew Andrews, Kamesh Munagala |
| 2000 | Computing Largest Common Point Sets under Approximate Congruence. | Christoph Ambhl, Samarjit Chakraborty, Bernd Grtner |
| 2000 | Offline List Update is NP-Hard. | Christoph Ambhl |
| 2000 | Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. | Marjan van den Akker, Han Hoogeveen, Nodari Vakhania |
| 2000 | An Approximation Algorithm for Hypergraph Max | Alexander A. Ageev, Maxim Sviridenko |
| 2000 | Polygon Decomposition for Efficient Construction of Minkowski Sums. | Pankaj K. Agarwal, Eyal Flato, Dan Halperin |
| 1999 | An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. | Bram Verweij, Karen I. Aardal |
| 1999 | Convex Quadratic Programming Relaxations for Network Scheduling Problems. | Martin Skutella |
| 1999 | Improving Mergesort for Linked Lists. | Salvador Roura |
| 1999 | Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. | R. Ravi, F. Sibel Salman |