| 2005 | Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. | Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. | Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov |
| 2005 | Approximating the Traffic Grooming Problem. | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2005 | On Efficient Weighted Rectangle Packing with Large Resources. | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
| 2005 | Optimal Paths for Mutually Visible Agents. | Joel Fenwick, Vladimir Estivill-Castro |
| 2005 | Edge-Pancyclicity of Twisted Cubes. | Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W. H. Lau |
| 2005 | Probability and Recursion. | Kousha Etessami, Mihalis Yannakakis |
| 2005 | Hybrid Voting Protocols and Hardness of Manipulation. | Edith Elkind, Helger Lipmaa |
| 2005 | Simultaneous Matchings. | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan |
| 2005 | Combinatorial Network Abstraction by Trees and Distances. | Stefan Eckhardt, Sven Kosub, Moritz G. Maa, Hanjo Tubig, Sebastian Wernicke |
| 2005 | Embedding Point Sets into Plane Graphs of Small Dilation. | Annette Ebbers-Baumann, Ansgar Grne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas |
| 2005 | On the Complexity of the | Zdenek Dvork, Vt Jelnek |
| 2005 | Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. | Feodor F. Dragan, Chenyu Yan |
| 2005 | A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. | Yvo Desmedt, Yongge Wang, Mike Burmester |
| 2005 | On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. | Marc Demange, Bernard Kouakou, ric Soutif |
| 2005 | Algorithms for Max Hamming Exact Satisfiability. | Vilhelm Dahllf |
| 2005 | A 1.75-Approximation Algorithm for Unsigned Translocation Distance. | Yun Cui, Lusheng Wang, Daming Zhu |
| 2005 | Computing Optimal Solutions for the min 3-set covering Problem. | Federico Della Croce, Vangelis Th. Paschos |
| 2005 | Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. | Erdong Chen, Hao Yuan, Linji Yang |
| 2005 | Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. | Danny Z. Chen, Xiaobo Sharon Hu, Shuang (Sean) Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu |
| 2005 | Improved Algorithms for the | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao |
| 2005 | On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. | Zhixiang Chen, Bin Fu |
| 2005 | A Min-Max Relation on Packing Feedback Vertex Sets. | Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang |
| 2005 | Efficient Algorithms for Finding a Longest Common Increasing Subsequence. | Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu |
| 2005 | Minimum Entropy Coloring. | Jean Cardinal, Samuel Fiorini, Gwenal Joret |