| 2006 | Matching Subsequences in Trees. | Philip Bille, Inge Li Grtz |
| 2006 | Gathering Algorithms on Paths Under Interference Constraints. | Jean-Claude Bermond, Ricardo C. Corra, Min-Li Yu |
| 2006 | How to Pack Directed Acyclic Graphs into Small Blocks. | Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano |
| 2003 | Nearly Bounded Error Probabilistic Sets. | Tomoyuki Yamakami |
| 2003 | Error-Correcting Codes in Complexity Theory. | Luca Trevisan |
| 2003 | Generating All Forest Extensions of a Partially Ordered Set. | Jayme Luiz Szwarcfiter |
| 2003 | On the Generation of Extensions of a Partially Ordered Set. | Jayme Luiz Szwarcfiter |
| 2003 | Optimal Binary Search Trees with Costs Depending on the Access Paths. | Jayme Luiz Szwarcfiter |
| 2003 | Computing with Electronic Nanotechnologies. | John E. Savage |
| 2003 | Hyper Encryption and Everlasting Secrets. | Michael O. Rabin |
| 2003 | Spanning Trees with Low Maximum/Average Stretch. | David Peleg |
| 2003 | Localized Network Representations. | David Peleg |
| 2003 | Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. | Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis |
| 2003 | Cache-Oblivious Algorithms. | Charles E. Leiserson |
| 2003 | Improving Customer Proximity to Railway Stations. | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer |
| 2003 | The Impact of Network Structure on the Stability of Greedy Protocols. | Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis |
| 2003 | Unlocking the Advantages of Dynamic Service Selection and Pricing. | Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky |
| 2003 | The Complexity of Detecting Fixed-Density Clusters. | Klaus Holzapfel, Sven Kosub, Moritz G. Maa, Hanjo Tubig |
| 2003 | Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. | Jens Gramm, Jiong Guo, Falk Hffner, Rolf Niedermeier |
| 2003 | Indexing Structures for Approximate String Matching. | Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino |
| 2003 | Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. | William Duckworth, Bernard Mans |
| 2003 | Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. | Miroslav Chlebk, Janka Chlebkov |
| 2003 | Additive Spanners for k-Chordal Graphs. | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
| 2003 | On-Line Stream Merging, Max Span, and Min Coverage. | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
| 2003 | Efficient Update Strategies for Geometric Computing with Uncertainty. | Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman |