| 1999 | A Case Study on the Cost of Geometric Computing. | Stefan Schirra |
| 1999 | Fast Priority Queues for Cached Memory. | Peter Sanders |
| 1999 | Object-Oriented Design of Graph Oriented Data Structures. | Maurizio Pizzonia, Giuseppe Di Battista |
| 1999 | Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. | Matthias Mller-Hannemann, Alexander Schwartz |
| 1999 | Binary Space Partitions in Plcker Space. | David M. Mount, Fan-Tao Pu |
| 1999 | Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. | Ruy Luiz Milidi, Artur Alves Pessoa, Eduardo Sany Laber |
| 1999 | Finding the Right Cutting Planes for the TSP. | Matthew S. Levine |
| 1999 | Designing Practical Efficient Algorithms for Symmetric Multiprocessors. | David R. Helman, Joseph F. JJ |
| 1999 | Image Watermarking for Copyright Protection. | Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah |
| 1999 | Accessing the Internal Organization of Data Structures in the JDSL Library. | Michael T. Goodrich, Mark Handy, Benot Hudson, Roberto Tamassia |
| 1999 | Algorithms for Restoration Planning in a Telecommunications Network. | Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook |
| 1999 | A Self Organizing Bin Packing Heuristic. | Jnos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber |
| 1999 | Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning. | Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov |
| 1999 | Efficient Bulk Operations on Dynamic R-trees. | Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter |
| 1999 | Adaptive Algorithms for Cache-Efficient Trie Search. | Anurag Acharya, Huican Zhu, Kai Shen |