| 2001 | Selective families, superimposed codes, and broadcasting on unknown radio networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | Guessing secrets. | Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton |
| 2001 | Which formulae shrink under random restrictions? | Hana Chockler, Uri Zwick |
| 2001 | Approximation for minimum triangulation of convex polyhedra. | Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang |
| 2001 | Orderly spanning trees with applications to graph encoding and graph drawing. | Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu |
| 2001 | K-pair delay constrained minimum cost routing in undirected networks. | Guangting Chen, Guoliang Xue |
| 2001 | Dynamic skin triangulation. | Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan |
| 2001 | Polygonal path approximation with angle constraints. | Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink |
| 2001 | Approximation algorithms for the metric labeling problem via a new linear programming formulation. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin |
| 2001 | A deterministic algorithm for the cost-distance problem. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor |
| 2001 | Algorithms for facility location problems with outliers. | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan |
| 2001 | Hill-climbing finds random planted bisections. | Ted Carson, Russell Impagliazzo |
| 2001 | Approximation algorithms for the 0-extension problem. | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
| 2001 | A probabilistic analysis of a greedy algorithm arising from computational biology. | Daniel G. Brown |
| 2001 | Worst case constant time priority queue. | Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro |
| 2001 | On-line restricted caching. | Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner |
| 2001 | IMproved results for route planning in stochastic transportation. | Justin A. Boyan, Michael Mitzenmacher |
| 2001 | Stability preserving transformations: packet routing networks with edge capacities and speeds. | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
| 2001 | Linear reductions of maximum matching. | Therese Biedl |
| 2001 | Computing the depth of a flat. | Marshall W. Bern |
| 2001 | Improved approximation algorithms for rectangle tiling and packing. | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami |
| 2001 | Finding least common ancestors in directed acyclic graphs. | Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin |
| 2001 | On the discrete Bak-Sneppen model of self-organized criticality. | Jrmy Barbay, Claire Kenyon |
| 2001 | Competitive on-line stream merging algorithms for media-on-demand. | Amotz Bar-Noy, Richard E. Ladner |
| 2001 | Approximation algorithms for data placement in arbitrary networks. | Ivan D. Baev, Rajmohan Rajaraman |