| 1999 | Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. | Kasturi R. Varadarajan, Pankaj K. Agarwal |
| 1999 | Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling. | Eric Torng, Patchrawat Uthaisombut |
| 1999 | A Slique Size Bounding Technique with Application to Non-Linear Codes. | Mario Szegedy |
| 1999 | Packet Filtering in High Speed Networks. | Subhash Suri, George Varghese |
| 1999 | A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. | C. R. Subramanian |
| 1999 | Rectangular Tiling in Multi-dimensional Arrays. | Adam Smith, Subhash Suri |
| 1999 | Median Bounds and Their Application. | Alan Siegel |
| 1999 | An Efficient Algorithm for Computing the | Jeffrey O. Shallit, David Swart |
| 1999 | Optimal Scheduling of Multiclass Parallel Machines. | Jay Sethuraman, Mark S. Squillante |
| 1999 | Preemptive Scheduling with Job-Dependent Setup Times. | Petra Schuurman, Gerhard J. Woeginger |
| 1999 | An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. | Andreas S. Schulz, Robert Weismantel |
| 1999 | Colouring Graphs with Prescribed Induced Cycle Lengths. | Ingo Schiermeyer, Bert Randerath |
| 1999 | Approximability of Scheduling with Fixed Jobs. | Mark Scharbrodt, Angelika Steger, Horst Weisser |
| 1999 | An Efficient Algorithm for Generating Necklaces with Fixed Density. | Joe Sawada, Frank Ruskey |
| 1999 | Sampling Spin Configurations of an Ising System. | Dana Randall, David Wilson |
| 1999 | Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. | Vijaya Ramachandran, Brian Grayson, Michael Dahlin |
| 1999 | On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. | Sridhar Rajagopalan, Vijay V. Vazirani |
| 1999 | Approximation Algorithms for the Asymmetric Postman Problem. | Balaji Raghavachari, Jeyakesavan Veerasamy |
| 1999 | Greedy Algorithms for Optimized DNA Sequencing. | Allon G. Percus, David C. Torney |
| 1999 | Rendering Equation Revisited: How to Avoid Explicit Visibility Computations. | Marco Pellegrini |
| 1999 | Certified Computation of the Sign of a Matrix Determinant. | Victor Y. Pan, Yanqiang Yu |
| 1999 | Using Stopping Times to Bound Mixing Times. | Igor Pak |
| 1999 | Combinatorial Approximation Algorithms for Generalized Flow Problems. | Jeffrey D. Oldham |
| 1999 | Approximating Multiroot 3-Outconnected Subgraphs. | Zeev Nutov |
| 1999 | All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. | Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau |