| 2005 | Network Load Games. | Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis |
| 2005 | Basic Computations in Wireless Networks. | Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis |
| 2005 | Approximation Algorithms for Layered Multicast Scheduling. | Qingbo Cai, Vincenzo Liberatore |
| 2005 | Correlation Clustering and Consensus Clustering. | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang |
| 2005 | Sampling Unlabeled Biconnected Planar Graphs. | Manuel Bodirsky, Clemens Grpl, Mihyun Kang |
| 2005 | Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. | Anders Bergkvist, Peter Damaschke |
| 2005 | Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. | Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi |
| 2005 | Localized and Compact Data-Structure for Comparability Graphs. | Fabrice Bazzaro, Cyril Gavoille |
| 2005 | On the Complexity of Global Constraint Satisfaction. | Cristina Bazgan, Marek Karpinski |
| 2005 | Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. | Sang Won Bae, Kyung-Yong Chwa |
| 2005 | Drawing Phylogenetic Trees. | Christian Bachmaier, Ulrik Brandes, Barbara Schlieper |
| 2005 | Space-Efficient Construction of LZ-Index. | Diego Arroyuelo, Gonzalo Navarro |
| 2005 | Sparse Geometric Graphs with Small Dilation. | Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron |
| 2005 | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. | Hiroki Arimura, Takeaki Uno |
| 2005 | External Data Structures for Shortest Path Queries on Planar Digraphs. | Lars Arge, Laura Toma |
| 2005 | Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, . | Carme lvarez, Joaquim Gabarr, Maria J. Serna |
| 2005 | SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. | Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi |
| 2005 | Complexity of the Min-Max (Regret) Versions of Cut Problems. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | Stacking and Bundling Two Convex Polygons. | Hee-Kap Ahn, Otfried Cheong |
| 2005 | Casting an Object with a Core. | Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa |
| 2005 | Monitoring Continuous Band-Join Queries over Dynamic Data. | Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu |
| 2005 | Decision Making Based on Approximate and Smoothed Pareto Curves. | Heiner Ackermann, Alantha Newman, Heiko Rglin, Berthold Vcking |
| 2005 | Pareto Optimality in House Allocation Problems. | David J. Abraham, Katarna Cechlrov, David F. Manlove, Kurt Mehlhorn |
| 2004 | A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. | Uri Zwick |
| 2004 | Sweeping Graphs with Large Clique Number. | Boting Yang, Danny Dyer, Brian Alspach |