| Name | Dissertation's Title | Position with |
| Nickolas G. Hall | Solutions for the Multicovering Problem | Ohio State University |
| Thomas A. Feo | I. A lagrangean relaxation method for testing the infeasibility of certain VLSI routing problems. II. Efficient reduction of planar networks for solving certain combinatorial problems. | University of Texas, Austin |
| Mallek Khellaf | On graph partitioning problems | British Telecom |
| David B. Shmoys | Approximation algorithms for problems in sequencing, scheduling, and communication network design | Cornell University |
| Olivier P. Goldschmidt | Deterministic and probabilistic aspects of the k-cut problem | OPNET Technologies |
| Sung-Pil Hong | About strongly polynomial algorithms of some special classes of convex quadratic programming | Seoul National University, Korea |
| Dan Landy | Batch scheduling for manufacturing | i2 Technology, California and perpetual commute |
| Anna Chen | Efficient algorithms for the ultimate pit limit problem | |
| Anu Pathria | Algorithms and complexity for cuts and selection problems on graphs | Burning Glass Technologies, San Diego |
| Eli Olinick | Algorithms for telecommunication networks | Southern Methodist University, Texas |
| Bala Chandran | Implementations of the pseudoflow algorithm for maximum flow, bipartite matching, flows in unit capacity networks, and parametric maximum flow | Analytics Operations Engineering, Inc. Boston |