| 2004 | Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families. | Douglas E. Carroll, Ashish Goel |
| 2004 | Direct Routing: Algorithms and Complexity. | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis |
| 2004 | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2004 | Contraction and Treewidth Lower Bounds. | Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle |
| 2004 | An Algorithm for Computing DNA Walks. | Ankur Bhargava, S. Rao Kosaraju |
| 2004 | An Experimental Study of Random Knapsack Problems. | Ren Beier, Berthold Vcking |
| 2004 | Modeling Locality: A Probabilistic Analysis of LRU and FWF. | Luca Becchetti |
| 2004 | Graph Decomposition Lemmas and Their Role in Metric Embedding Methods. | Yair Bartal |
| 2004 | Labeling Smart Dust. | Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler |
| 2004 | An Improved Algorithm for CIOQ Switches. | Yossi Azar, Yossi Richter |
| 2004 | Maximizing Throughput in Multi-queue Switches. | Yossi Azar, Arik Litichevskey |
| 2004 | Optimal External Memory Planar Point Enclosure. | Lars Arge, Vasilis Samoladas, Ke Yi |
| 2004 | Path Decomposition Under a New Cost Measure with Applications to Optical Network Design. | Elliot Anshelevich, Lisa Zhang |
| 2004 | Swap and Mismatch Edit Distance. | Amihood Amir, Estrella Eisenberg, Ely Porat |
| 2004 | Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu |
| 2003 | Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves. | Nicola Wolpert |
| 2003 | Seventeen Lines and One-Hundred-and-One Points. | Gerhard J. Woeginger |
| 2003 | Efficient Algorithms for the Ring Loading Problem with Demand Splitting. | Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh |
| 2003 | Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. | Dorothea Wagner, Thomas Willhalm |
| 2003 | Sequencing by Hybridization in Few Rounds. | Dekel Tsur |
| 2003 | Binary Space Partition for Orthogonal Fat Rectangles. | Csaba D. Tth |
| 2003 | Approximation Algorithms and Network Games. | va Tardos |
| 2003 | Authenticated Data Structures. | Roberto Tamassia |
| 2003 | A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. | Hisao Tamaki |
| 2003 | Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. | Aleksandrs Slivkins |