| 2003 | The Student-Project Allocation Problem. | David J. Abraham, Robert W. Irving, David F. Manlove |
| 2002 | Algorithms and Complexity for Tetrahedralization Detections. | Boting Yang, Cao An Wang, Francis Y. L. Chin |
| 2002 | A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. | Thomas Wolle |
| 2002 | Meaningful Information. | Paul M. B. Vitnyi |
| 2002 | An O(pn + 1.151 | Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel |
| 2002 | A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. | Vivek Shikaripura, Ajay D. Kshemkalyani |
| 2002 | Market Clearing with Supply and Demand Curves. | Tuomas Sandholm, Subhash Suri |
| 2002 | Space-Efficient Data Structures for Flexible Text Retrieval Systems. | Kunihiko Sadakane |
| 2002 | Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
| 2002 | Expected Acceptance Counts for Finite Automata with Almost Uniform Input. | Nicholas Pippenger |
| 2002 | On the Comparison-Addition Complexity of All-Pairs Shortest Paths. | Seth Pettie |
| 2002 | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. | Evanthia Papadopoulou, D. T. Lee |
| 2002 | Monotone Drawings of Planar Graphs. | Jnos Pach, Gza Tth |
| 2002 | On the Approximability of Multiprocessor Task Scheduling Problems. | Antonio Miranda, Luz Torres, Jianer Chen |
| 2002 | Minimum Edge Ranking Spanning Trees of Threshold Graphs. | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 2002 | A Geometric Approach to Boolean Matrix Multiplication. | Andrzej Lingas |
| 2002 | Cutting a Country for Smallest Square Fit. | Marc J. van Kreveld, Bettina Speckmann |
| 2002 | Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. | Hirotada Kobayashi, Keiji Matsumoto |
| 2002 | An Improved Algorithm for the Minimum Manhattan Network Problem. | Ryo Kato, Keiko Imai, Takao Asano |
| 2002 | A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2002 | Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. | Tomasz Jurdzinski, Grzegorz Stachowiak |
| 2002 | An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. | Klaus Jansen, Roberto Solis-Oba |
| 2002 | Partitioning Trees of Supply and Demand. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2002 | File Transfer Tree Problems. | Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita |
| 2002 | Queaps. | John Iacono, Stefan Langerman |