| 2002 | Computing shortest paths with comparisons and additions. | Seth Pettie, Vijaya Ramachandran |
| 2002 | Edge dominating and hypomatchable sets. | Ojas Parekh |
| 2002 | Mixing time and long paths in graphs. | Igor Pak |
| 2002 | Optimal time-space trade-offs for non-comparison-based sorting. | Rasmus Pagh, Jakob Pagter |
| 2002 | A new algorithm for protein folding in the HP model. | Alantha Newman |
| 2002 | Efficient algorithms for document retrieval problems. | S. Muthukrishnan |
| 2002 | Tiling groups for Wang tiles. | Cristopher Moore, Ivan Rapaport, Eric Rmila |
| 2002 | Construction of probe interval models. | Ross M. McConnell, Jeremy P. Spinrad |
| 2002 | I/O-optimal algorithms for planar graphs using separators. | Anil Maheshwari, Norbert Zeh |
| 2002 | Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. | Hsueh-I Lu |
| 2002 | Approximation algorithms for grammar-based compression. | Eric P. Lehman, Abhi Shelat |
| 2002 | How to cut a cake almost fairly. | Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jrg Rambau, Leen Stougie, Gerhard J. Woeginger |
| 2002 | Hardware-assisted computation of depth contours. | Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian |
| 2002 | On the overlay of envelopes in four dimensions. | Vladlen Koltun, Micha Sharir |
| 2002 | Improved bounds for the unsplittable flow problem. | Petr Kolman, Christian Scheideler |
| 2002 | Flows over time with load-dependent transit times. | Ekkehard Khler, Martin Skutella |
| 2002 | An optimal algorithm for checking regularity (extended abstract). | Yoshiharu Kohayakawa, Vojtech Rdl, Lubos Thoma |
| 2002 | Preprocessing an undirected planar network to enable fast approximate distance queries. | Philip N. Klein |
| 2002 | Labeling schemes for flow and connectivity. | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
| 2002 | Faster approximation schemes for fractional multicommodity flow problems. | George Karakostas |
| 2002 | Union-find with deletions. | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
| 2002 | A comparison of labeling schemes for ancestor queries. | Haim Kaplan, Tova Milo, Ronen Shabo |
| 2002 | Efficient pattern-matching with don't cares. | Adam Kalai |
| 2002 | Generating random factored numbers, easily. | Adam Kalai |
| 2002 | A fully combinatorial algorithm for submodular function minimization. | Satoru Iwata |