| 2002 | Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. | Andreas Goerdt, Tomasz Jurdzinski |
| 2002 | Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. | Alan Gibbons, Paul Sant |
| 2002 | On Maximizing the Throughput of Multiprocessor Tasks. | Aleksei V. Fishkin, Guochuan Zhang |
| 2002 | More on Weighted Servers or FIFO is Better than LRU. | Leah Epstein, Csand Imreh, Rob van Stee |
| 2002 | Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. | Leah Epstein, Lene M. Favrholdt |
| 2002 | Two-Way Finite State Transducers with Nested Pebbles. | Joost Engelfriet, Sebastian Maneth |
| 2002 | Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. | Todd Ebert, Wolfgang Merkle |
| 2002 | On Word Equations in One Variable. | Robert Dabrowski, Wojciech Plandowski |
| 2002 | Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. | Amin Coja-Oghlan |
| 2002 | Competitive Analysis of On-line Stream Merging Algorithms. | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
| 2002 | A Chomsky-Like Hierarchy of Infinite Graphs. | Didier Caucal, Teodor Knapik |
| 2002 | On Infinite Terms Having a Decidable Monadic Theory. | Didier Caucal |
| 2002 | Accessibility in Automata on Scattered Linear Orderings. | Olivier Carton |
| 2002 | Matroid Intersections, Polymatroid Inequalities, and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. | Beate Bollig, Philipp Woelfel |
| 2002 | Global Development via Local Observational Construction Steps. | Michel Bidoit, Donald Sannella, Andrzej Tarlecki |
| 2002 | Packing Edges in Random Regular Graphs. | Mihalis Beis, William Duckworth, Michele Zito |
| 2002 | Fast Algorithms with Algebraic Monge Properties. | Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park |
| 2002 | Finite Domain Constraint Satisfaction Using Quantum Computation. | Ola Angelsmark, Vilhelm Dahllf, Peter Jonsson |
| 2002 | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. | Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
| 2001 | Linear Temporal Logic and Finite Semigroups. | Thomas Wilke |
| 2001 | Characterization of Context-Free Languages with Polynomially Bounded Ambiguity. | Klaus Wich |
| 2001 | Alignment between Two RNA Structures. | Zhuozhi Wang, Kaizhong Zhang |
| 2001 | On the Approximability of the Steiner Tree Problem. | Martin Thimm |
| 2001 | The Size of Power Automata. | Klaus Sutner |