| 2005 | Workload-Optimal Histograms on Streams. | S. Muthukrishnan, Martin Strauss, Xuan Zheng |
| 2005 | Online View Maintenance Under a Response-Time Constraint. | Kamesh Munagala, Jun Yang, Hai Yu |
| 2005 | Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism. | Cristopher Moore |
| 2005 | Efficient Approximation Schemes for Geometric Problems?. | Dniel Marx |
| 2005 | A Loopless Gray Code for Minimal Signed-Binary Representations. | Gurmeet Singh Manku, Joe Sawada |
| 2005 | Space Efficient Algorithms for the Burrows-Wheeler Backtransformation. | Ulrich Lauther, Tams Lukovszki |
| 2005 | Low Degree Connectivity in Ad-Hoc Networks. | Ludek Kucera |
| 2005 | An Experimental Study of Algorithms for Fully Dynamic Transitive Closure. | Ioannis Krommidas, Christos D. Zaroliagis |
| 2005 | Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines. | Annamria Kovcs |
| 2005 | Generating Realistic Terrains with Higher-Order Delaunay Triangulations. | Thierry de Kok, Marc J. van Kreveld, Maarten Lffler |
| 2005 | Relax-and-Cut for Capacitated Network Design. | Georg Kliewer, Larissa Timajev |
| 2005 | On Degree Constrained Shortest Paths. | Samir Khuller, Kwangil Lee, Mark A. Shayman |
| 2005 | Predecessor Queries in Constant Time?. | Marek Karpinski, Yakov Nekrich |
| 2005 | Linear-Time Enumeration of Isolated Cliques. | Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi |
| 2005 | Optimal Integer Alphabetic Trees in Linear Time. | T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler |
| 2005 | Engineering Planar Separator Algorithms. | Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2005 | Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2005 | Jitter Regulation for Multiple Streams. | David Hay, Gabriel Scalosub |
| 2005 | Unbalanced Graph Cuts. | Ara Hayrapetyan, David Kempe, Martin Pl, Zoya Svitkina |
| 2005 | Min Sum Clustering with Penalties. | Refael Hassin, Einat Or |
| 2005 | An Approximation Algorithm for the Minimum Latency Set Cover Problem. | Refael Hassin, Asaf Levin |
| 2005 | Allocating Memory in a Lock-Free Manner. | Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas |
| 2005 | An Algorithm for Node-Capacitated Ring Routing. | Andrs Frank, Zoltn Kirly, Balzs Kotnyek |
| 2005 | Greedy Routing in Tree-Decomposed Graphs. | Pierre Fraigniaud |
| 2005 | Online Occlusion Culling. | Gereon Frahling, Jens Krokowski |