| 2002 | 1.375-Approximation Algorithm for Sorting by Reversals. Piotr Berman, Sridhar Hannenhalli, Marek Karpinski |
| 2002 | A Comparison of Multicast Pull Models. Kirk Pruhs, Patchrawat Uthaisombut |
| 2002 | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer |
| 2002 | A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama |
| 2002 | A Primal Approach to the Stable Set Problem. Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel |
| 2002 | A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs. Huaming Zhang, Xin He |
| 2002 | A Software Library for Elliptic Curve Cryptography. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis |
| 2002 | Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings Rolf H. Möhring, Rajeev Raman |
| 2002 | An Algorithm for Dualization in Products of Lattices and Its Applications. Khaled M. Elbassioni |
| 2002 | An Approximation Scheme for Cake Division with a Linear Number of Cuts. Gerhard J. Woeginger |
| 2002 | An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. Benny K. Nielsen, Pawel Winter, Martin Zachariasen |
| 2002 | Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. Tamal K. Dey, Wulue Zhao |
| 2002 | Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs. Krzysztof Lorys, Grazyna Zwozniak |
| 2002 | Approximation Algorithms for k-Line Center. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan |
| 2002 | Balanced-Replication Algorithms for Distribution Trees. Edith Cohen, Haim Kaplan |
| 2002 | Branch-and-Bound Algorithms for the Test Cover Problem. Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie |
| 2002 | Butterflies and Peer-to-Peer Networks. Mayur Datar |
| 2002 | Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe |
| 2002 | Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. Jana Maxová, Jaroslav Nesetril |
| 2002 | Computing Homotopic Shortest Paths Efficiently. Alon Efrat, Stephen G. Kobourov, Anna Lubiw |
| 2002 | Computing Shapes from Point Cloud Data. Tamal K. Dey |
| 2002 | Constructing Plane Spanners of Bounded Degree and Low Weight. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
| 2002 | Covering Things with Things. Stefan Langerman, Pat Morin |
| 2002 | Design and Implementation of Efficient Data Types for Static Graphs. Stefan Näher, Oliver Zlotowski |
| 2002 | Determining Similarity of Conformational Polymorphs. Angela Enosh, Klara Kedem, Joel Bernstein |
| 2002 | Deterministic Communication in Radio Networks with Large Labels. Leszek Gasieniec, Aris Pagourtzis, Igor Potapov |
| 2002 | Dynamic Additively Weighted Voronoi Diagrams in 2D. Menelaos I. Karavelas, Mariette Yvinec |
| 2002 | Eager st-Ordering. Ulrik Brandes |
| 2002 | Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. Annalisa De Bonis, Ugo Vaccaro |
| 2002 | Efficient Implementation of a Minimal Triangulation Algorithm. Pinar Heggernes, Yngve Villanger |
| 2002 | Efficient Tree Layout in a Multilevel Memory Hierarchy. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
| 2002 | Engineering a Lightweight Suffix Array Construction Algorithm. Giovanni Manzini, Paolo Ferragina |
| 2002 | Estimating Rarity and Similarity over Data Stream Windows. Mayur Datar, S. Muthukrishnan |
| 2002 | Extending Reduction Techniques for the Steiner Tree Problem. Tobias Polzin, Siavash Vahdati Daneshmand |
| 2002 | External-Memory Breadth-First Search with Sublinear I/O. Kurt Mehlhorn, Ulrich Meyer |
| 2002 | Finding the Sink Takes Some Time. Ingo Schurr, Tibor Szabó |
| 2002 | Frequency Channel Assignment on Planar Networks. Michael Molloy, Mohammad R. Salavatipour |
| 2002 | Frequency Estimation of Internet Packet Streams with Limited Space. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro |
| 2002 | Geometric Algorithms for Density-Based Data Clustering. Danny Z. Chen, Michiel H. M. Smid, Bin Xu |
| 2002 | High-Level Filtering for Arrangements of Conic Arcs. Ron Wein |
| 2002 | Implementing I/O-efficient Data Structures Using TPIE. Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2002 | Kinetic Medians and kd-Trees. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas |
| 2002 | Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. Meinolf Sellmann, Georg Kliewer, Achim Koberstein |
| 2002 | Mechanism Design for Fun and Profit. Anna R. Karlin |
| 2002 | Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger |
| 2002 | Minimizing the Maximum Starting Time On-line. Leah Epstein, Rob van Stee |
| 2002 | Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. Rob van Stee, Johannes A. La Poutré |
| 2002 | Near-Linear Time Approximation Algorithms for Curve Simplification. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang |
| 2002 | New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. Dino Ahr, Gerhard Reinelt |
| 2002 | Non-independent Randomized Rounding and an Application to Digital Halftoning. Benjamin Doerr, Henning Schnieder |
| 2002 | On Distance Oracles and Routing in Graphs. Mikkel Thorup |
| 2002 | On the k-Splittable Flow Problem. Georg Baier, Ekkehard Köhler, Martin Skutella |
| 2002 | On-Line Dial-a-Ride Problems under a Restricted Information Model. Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie |
| 2002 | Online Companion Caching. Amos Fiat, Manor Mendel, Steven S. Seiden |
| 2002 | Online Scheduling for Sorting Buffers. Harald Räcke, Christian Sohler, Matthias Westermann |
| 2002 | Optimal Graph Exploration without Good Maps. Anders Dessmark, Andrzej Pelc |
| 2002 | Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu |
| 2002 | Partial Alphabetic Trees. Arye Barkan, Haim Kaplan |
| 2002 | Partially-Ordered Knapsack and Applications to Scheduling. Stavros G. Kolliopoulos, George Steiner |
| 2002 | Radio Labeling with Pre-assigned Frequencies. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
| 2002 | Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. Eduardo Sany Laber, Ojas Parekh, R. Ravi |
| 2002 | Range Searching in Categorical Data: Colored Range Searching on Grid. Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan |
| 2002 | Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. Sven Oliver Krumke, Jörg Rambau, Luis Miguel Torres |
| 2002 | SCIL - Symbolic Constraints in Integer Linear Programming. Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn |
| 2002 | Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton |
| 2002 | Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. Klaus Jansen |
| 2002 | Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. Torsten Fahle |
| 2002 | Solving Traveling Salesman Problems. William J. Cook |
| 2002 | Sorting 13 Elements Requires 34 Comparisons. Marcin Peczarski |
| 2002 | Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. Eti Ezra, Dan Halperin, Micha Sharir |
| 2002 | TSP with Neighborhoods of Varying Size. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
| 2002 | The Probabilistic Analysis of a Greedy Satisfiability Algorithm. Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas |
| 2002 | Three-Dimensional Layers of Maxima. Adam L. Buchsbaum, Michael T. Goodrich |
| 2002 | Time-Expanded Graphs for Flow-Dependent Transit Times. Ekkehard Köhler, Katharina Langkau, Martin Skutella |
| 2002 | Translating a Planar Object to Maximize Point Containment. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl |
| 2002 | Truthful and Competitive Double Auctions. Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin |
| 2002 | Two Simplified Algorithms for Maintaining Order in a List. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito |
| 2002 | Vector Assignment Problems: A General Framework. Leah Epstein, Tamir Tassa |
| 2002 | Wide-Sense Nonblocking WDM Cross-Connects. Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler |