| 2003 | Approximating Geometric Bottleneck Shortest Paths. | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
| 2003 | An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2003 | Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. | Beate Bollig |
| 2003 | Algebras of Minimal Rank over Arbitrary Fields. | Markus Blser |
| 2003 | A Discrete Subexponential Algorithm for Parity Games. | Henrik Bjrklund, Sven Sandberg, Sergei G. Vorobyov |
| 2003 | Non-clairvoyant Scheduling for Minimizing Mean Slowdown. | Nikhil Bansal, Kedar Dhamdhere, Jochen Knemann, Amitabh Sinha |
| 2003 | Cryptographically Sound and Machine-Assisted Verification of Security Protocols. | Michael Backes, Christian Jacobi |
| 2002 | A Lower Bound Technique for Restricted Branching Programs and Applications. | Philipp Woelfel |
| 2002 | Nesting Until and Since in Linear Temporal Logic. | Denis Thrien, Thomas Wilke |
| 2002 | Comparing Verboseness for Finite Automata and Turing Machines. | Till Tantau |
| 2002 | Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. | Jir Srba |
| 2002 | How Many Missing Answers Can Be Tolerated by Query Learners? | Hans Ulrich Simon |
| 2002 | Models and Techniques for Communication in Dynamic Networks. | Christian Scheideler |
| 2002 | The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. | Holger Petersen |
| 2002 | Bi-Immunity Separates Strong NP-Completeness Notions. | Aduri Pavan, Alan L. Selman |
| 2002 | Randomized Acceleration of Fundamental Matrix Computations. | Victor Y. Pan |
| 2002 | On Quantum Computation with Some Restricted Amplitudes. | Harumichi Nishimura |
| 2002 | Recognizable Sets of Message Sequence Charts. | Rmi Morin |
| 2002 | The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. | Ulf Lorenz, Burkhard Monien |
| 2002 | Ground Tree Rewriting Graphs of Bounded Tree Width. | Christof Lding |
| 2002 | An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. | Renaud Lepre, Christophe Rapine |
| 2002 | Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. | Stefan Langerman, Pat Morin, Michael A. Soss |
| 2002 | A Further Step towards a Theory of Regular MSC Languages. | Dietrich Kuske |
| 2002 | The Complexity of Constraints on Intervals and Lengths. | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson |
| 2002 | On the Average Parallelism in Trace Monoids. | Daniel Krob, Jean Mairesse, Ioannis Michos |