| 1999 | Parallel Virtual Memory. | Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari |
| 1999 | On Approximability of the Minimum-Cost | Artur Czumaj, Andrzej Lingas |
| 1999 | Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. | Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys |
| 1999 | Recovering Evolutionary Trees Through Harmonic Greedy Triplets. | Mikls Csrs, Ming-Yang Kao |
| 1999 | Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion. | Giovanni Di Crescenzo, Yair Frankel |
| 1999 | Compact Roundtrip Routing for Digraphs. | Lenore Cowen, Christopher G. Wagner |
| 1999 | Compact Routing with Minimum Stretch. | Lenore Cowen |
| 1999 | LBFS Orderings and Cocomparability Graphs. | Derek G. Corneil, Stephan Olariu, Lorna Stewart |
| 1999 | Tree Pattern Matching and Subset Matching in Deterministic | Richard Cole, Ramesh Hariharan, Piotr Indyk |
| 1999 | Dynamic LCA Queries on Trees. | Richard Cole, Ramesh Hariharan |
| 1999 | LP-based Analysis of Greedy-dual-size. | Edith Cohen, Haim Kaplan |
| 1999 | Scheduling Calls for Multicasting in Tree-Networks. | Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana |
| 1999 | Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. | Edward G. Coffman Jr., Alexander L. Stolyar |
| 1999 | Improved Approximation Algorithms for a Capacitated Facility Location Problem. | Fabin A. Chudak, David B. Shmoys |
| 1999 | On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. | Ka Wong Chong, Yijie Han, Tak Wah Lam |
| 1999 | Two-Point Euclidean Shortest Path Queries in the Plane. | Yi-Jen Chiang, Joseph S. B. Mitchell |
| 1999 | Nonplanar Topological Inference and Political-Map Graphs. | Zhi-Zhong Chen, Xin He, Ming-Yang Kao |
| 1999 | Approximate Minimum Weight Steiner Triangulation in Three Dimensions. | Siu-Wing Cheng, Tamal K. Dey |
| 1999 | Minimizing Weighted Completion Time on a Single Machine. | Chandra Chekuri, Rajeev Motwani |
| 1999 | On Multi-Dimensional Packing Problems. | Chandra Chekuri, Sanjeev Khanna |
| 1999 | Minimizing Wirelength in Zero and Bounded Skew Clock Trees. | Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins |
| 1999 | Greedy Local Improvement and Weighted Set Packing Approximation. | Barun Chandra, Magns M. Halldrsson |
| 1999 | A Near-Linear Area Bound for Drawing Binary Trees. | Timothy M. Chan |
| 1999 | A Small Universal Graph for Bounded-degree Planar Graphs. | Michael R. Capalbo |
| 1999 | Some Graphic Uses of an Even Number of Odd Nodes. | Kathie Cameron, Jack Edmonds |