| 2002 | Bounded-Degree Independent Sets in Planar Graphs. | Therese Biedl, Dana F. Wilkinson |
| 2002 | Scheduling of Independent Dedicated Multiprocessor Tasks. | Evripidis Bampis, Massimiliano Caramia, Jir Fiala, Aleksei V. Fishkin, Antonio Iovanella |
| 2002 | Biased Skip Lists. | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich |
| 2002 | Approximating MIN k-SAT. | Adi Avidor, Uri Zwick |
| 2002 | Approximation Algorithms for Some Parameterized Counting Problems. | Vikraman Arvind, Venkatesh Raman |
| 2002 | On the Clique Problem in Intersection Graphs of Ellipses. | Christoph Ambhl, Uli Wagner |
| 2002 | Flat-State Connectivity of Linkages under Dihedral Motions. | Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint |
| 2002 | Casting a Polyhedron with Directional Uncertainty. | Hee-Kap Ahn, Otfried Cheong, Ren van Oostrum |
| 2001 | Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. | Xiao Zhou, Takao Nishizeki |
| 2001 | A Unified Framework for Approximating Multiway Partition Problems. | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2001 | Complexity Study on Two Clustering Problems. | Louxin Zhang, Song Zhu |
| 2001 | Generic Algorithms and Key Agreement Protocols Based on Group Actions. | Akihiro Yamamura, Kaoru Kurosawa |
| 2001 | A New Recognition Algorithm for Extended Regular Expressions. | Hiroaki Yamamoto |
| 2001 | Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. | Sue Whitesides |
| 2001 | A Fast Algorithm for Enumerating Bipartite Perfect Matchings. | Takeaki Uno |
| 2001 | BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. | Zheng Sun, John H. Reif |
| 2001 | Tree-Approximations for the Weighted Cost-Distance Problem. | Christian Schindelhauer, Birgitta Weber |
| 2001 | Quantum Algorithms for Intersection and Proximity Problems. | Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama |
| 2001 | Labeling Points with Weights. | Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff |
| 2001 | Go with the Winners Algorithms for Cliques in Random Graphs. | Marcus Peinado |
| 2001 | An Index for the Data Size to Extract Decomposable Structures in LAD. | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
| 2001 | On Adaptive Fault Diagnosis for Multiprocessor Systems. | Kumiko Nomura, Toshinori Yamada, Shuichi Ueno |
| 2001 | Recognition and Orientation Algorithms for P | Stavros D. Nikolopoulos, Leonidas Palios |
| 2001 | Enumerating Floorplans with n Rooms. | Shin-Ichi Nakano |
| 2001 | Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. | Takayuki Nagoya |