| 2002 | A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2002 | A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. Anna Galluccio, Guido Proietti |
| 2002 | A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. Thomas Wolle |
| 2002 | A Geometric Approach to Boolean Matrix Multiplication. Andrzej Lingas |
| 2002 | A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. Vivek Shikaripura, Ajay D. Kshemkalyani |
| 2002 | Algorithms and Complexity for Tetrahedralization Detections. Boting Yang, Cao An Wang, Francis Y. L. Chin |
| 2002 | Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings Prosenjit Bose, Pat Morin |
| 2002 | An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. Klaus Jansen, Roberto Solis-Oba |
| 2002 | An Improved Algorithm for the Minimum Manhattan Network Problem. Ryo Kato, Keiko Imai, Takao Asano |
| 2002 | An O(pn + 1.151 Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel |
| 2002 | Approximate Distance Oracles Revisited. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 2002 | Approximating MIN k-SAT. Adi Avidor, Uri Zwick |
| 2002 | Approximation Algorithms for Some Parameterized Counting Problems. Vikraman Arvind, Venkatesh Raman |
| 2002 | Average-Case Communication-Optimal Parallel Parenthesis Matching. Chun-Hsi Huang, Xin He |
| 2002 | Average-Case Competitive Analyses for Ski-Rental Problems. Hiroshi Fujiwara, Kazuo Iwama |
| 2002 | Biased Skip Lists. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich |
| 2002 | Bounded-Degree Independent Sets in Planar Graphs. Therese Biedl, Dana F. Wilkinson |
| 2002 | Casting a Polyhedron with Directional Uncertainty. Hee-Kap Ahn, Otfried Cheong, René van Oostrum |
| 2002 | Characterizing History Independent Data Structures. Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney, Emily Rocke |
| 2002 | Crossing Minimization for Symmetries. Christoph Buchheim, Seok-Hee Hong |
| 2002 | Cutting a Country for Smallest Square Fit. Marc J. van Kreveld, Bettina Speckmann |
| 2002 | Expected Acceptance Counts for Finite Automata with Almost Uniform Input. Nicholas Pippenger |
| 2002 | Exponential Speedup of Fixed-Parameter Algorithms on K Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2002 | Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. Venkatesh Raman, Saket Saurabh, C. R. Subramanian |
| 2002 | File Transfer Tree Problems. Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita |
| 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 | Funnel Heap - A Cache Oblivious Priority Queue. Gerth Stølting Brodal, Rolf Fagerberg |
| 2002 | Hierarchy of Surface Models and Irreducible Triangulation. Siu-Wing Cheng, Tamal K. Dey, Sheung-Hung Poon |
| 2002 | Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. Markus Bläser, Bodo Manthey |
| 2002 | Improved Distance Oracles for Avoiding Link-Failure. Rezaul Alam Chowdhury, Vijaya Ramachandran |
| 2002 | Key Independent Optimality. John Iacono |
| 2002 | Market Clearing with Supply and Demand Curves. Tuomas Sandholm, Subhash Suri |
| 2002 | Maximizing a Voronoi Region: The Convex Case. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel |
| 2002 | Meaningful Information. Paul M. B. Vitányi |
| 2002 | Minimum Edge Ranking Spanning Trees of Threshold Graphs. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 2002 | Monotone Drawings of Planar Graphs. János Pach, Géza Tóth |
| 2002 | New Results for Energy-Efficient Broadcasting in Wireless Networks. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos |
| 2002 | Non-Delaunay-Based Curve Reconstruction. Sumanta Guha, Paula Josiah, Anoop Mittal, Son Dinh Tran |
| 2002 | On the Approximability of Multiprocessor Task Scheduling Problems. Antonio Miranda, Luz Torres, Jianer Chen |
| 2002 | On the Clique Problem in Intersection Graphs of Ellipses. Christoph Ambühl, Uli Wagner |
| 2002 | On the Clique-Width of Graphs in Hereditary Classes. Rodica Boliac, Vadim V. Lozin |
| 2002 | On the Comparison-Addition Complexity of All-Pairs Shortest Paths. Seth Pettie |
| 2002 | On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun |
| 2002 | On the Minimum Volume of a Perturbed Unit Cube. Jin-Yi Cai |
| 2002 | Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2002 | Partitioning Trees of Supply and Demand. Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2002 | Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. Tomasz Jurdzinski, Grzegorz Stachowiak |
| 2002 | Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. Alexander Grigoriev, Gerhard J. Woeginger |
| 2002 | Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. Hirotada Kobayashi, Keiji Matsumoto |
| 2002 | Queaps. John Iacono, Stefan Langerman |
| 2002 | Random Tries. Luc Devroye |
| 2002 | Scheduling of Independent Dedicated Multiprocessor Tasks. Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella |
| 2002 | Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. Cesim Erten, Stephen G. Kobourov |
| 2002 | Some Remarks on the L-Conjecture. Qi Cheng |
| 2002 | Space-Efficient Data Structures for Flexible Text Retrieval Systems. Kunihiko Sadakane |
| 2002 | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. Evanthia Papadopoulou, D. T. Lee |
| 2002 | The Probability of a Rendezvous is Minimal in Complete Graphs. Martin Dietzfelbinger |
| 2002 | Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le |