| 2005 | 5-th Phylogenetic Root Construction for Strictly Chordal Graphs. William S. Kennedy, Guohui Lin |
| 2005 | A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi |
| 2005 | A 1.5-Approximation of the Minimal Manhattan Network Problem. Sebastian Seibert, Walter Unger |
| 2005 | A 1.75-Approximation Algorithm for Unsigned Translocation Distance. Yun Cui, Lusheng Wang, Daming Zhu |
| 2005 | A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. Yvo Desmedt, Yongge Wang, Mike Burmester |
| 2005 | A Min-Max Relation on Packing Feedback Vertex Sets. Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang |
| 2005 | A Novel Adaptive Learning Algorithm for Stock Market Prediction. Lean Yu, Shouyang Wang, Kin Keung Lai |
| 2005 | A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. Hiroki Arimura, Takeaki Uno |
| 2005 | A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions. Li-Sha Huang |
| 2005 | A Simple Optimal Randomized Algorithm for Sorting on the PDM. Sanguthevar Rajasekaran, Sandeep Sen |
| 2005 | A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations. Satoshi Fujita |
| 2005 | Algorithmic Problems in Wireless Ad Hoc Networks. F. Frances Yao |
| 2005 | Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings Xiaotie Deng, Ding-Zhu Du |
| 2005 | Algorithms for Local Forest Similarity. Zeshan Peng |
| 2005 | Algorithms for Max Hamming Exact Satisfiability. Vilhelm Dahllöf |
| 2005 | Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. Prosenjit Gupta |
| 2005 | Almost Optimal Solutions for Bin Coloring Problems. Mingen Lin, Zhiyong Lin, Jinhui Xu |
| 2005 | An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. Klaus Jansen, Hu Zhang |
| 2005 | An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. Martin Nehéz, Daniel Olejár |
| 2005 | An Improved O(1.234 Masaki Yamamoto |
| 2005 | An Optimization Problem Related to VoD Broadcasting. Tsunehiko Kameda, Yi Sun, Luis A. Goddyn |
| 2005 | Approximate Colored Range Queries. Ying Kit Lai, Chung Keung Poon, Benyun Shi |
| 2005 | Approximating the Traffic Grooming Problem. Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2005 | Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations. Oliver Klein, Remco C. Veltkamp |
| 2005 | Approximation Algorithms for Layered Multicast Scheduling. Qingbo Cai, Vincenzo Liberatore |
| 2005 | Average Case Analysis for Tree Labelling Schemes. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang |
| 2005 | Basic Computations in Wireless Networks. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis |
| 2005 | Bisecting a Four-Connected Graph with Three Resource Sets. Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi |
| 2005 | Boosting Spectral Partitioning by Sampling and Iteration. Joachim Giesen, Dieter Mitsche |
| 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 | Casting an Object with a Core. Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa |
| 2005 | Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. Feodor F. Dragan, Chenyu Yan |
| 2005 | Combinatorial Network Abstraction by Trees and Distances. Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke |
| 2005 | Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. Lan Liu, Xi Chen, Jing Xiao, Tao Jiang |
| 2005 | Complexity of the Min-Max (Regret) Versions of Cut Problems. Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | Computing Optimal Solutions for the min 3-set covering Problem. Federico Della Croce, Vangelis Th. Paschos |
| 2005 | Configurations with Few Crossings in Topological Graphs. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff |
| 2005 | Correlation Clustering and Consensus Clustering. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang |
| 2005 | Counting Distinct Items over Update Streams. Sumit Ganguly |
| 2005 | Counting Stable Strategies in Random Evolutionary Games. Spyros C. Kontogiannis, Paul G. Spirakis |
| 2005 | Decision Making Based on Approximate and Smoothed Pareto Curves. Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking |
| 2005 | Dense Subgraph Problems with Output-Density Conditions. Akiko Suzuki, Takeshi Tokuyama |
| 2005 | Distance Labeling in Hyperbolic Graphs. Cyril Gavoille, Olivier Ly |
| 2005 | Drawing Phylogenetic Trees. Christian Bachmaier, Ulrik Brandes, Barbara Schlieper |
| 2005 | Edge-Pancyclicity of Twisted Cubes. Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W. H. Lau |
| 2005 | Efficient Algorithms for Finding a Longest Common Increasing Subsequence. Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu |
| 2005 | Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi |
| 2005 | Efficient Parallel Algorithms for Constructing a Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian |
| 2005 | Embedding Point Sets into Plane Graphs of Small Dilation. Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas |
| 2005 | Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid |
| 2005 | External Data Structures for Shortest Path Queries on Planar Digraphs. Lars Arge, Laura Toma |
| 2005 | Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks. Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung |
| 2005 | Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. Anders Bergkvist, Peter Damaschke |
| 2005 | Fast k-Means Algorithms with Constant Approximation. Mingjun Song, Sanguthevar Rajasekaran |
| 2005 | Finding Two Disjoint Paths in a Network with Normalized Bing Yang, S. Q. Zheng, Enyue Lu |
| 2005 | Finding a Weight-Constrained Maximum-Density Subtree in a Tree. Sun-Yuan Hsieh, Ting-Yu Chou |
| 2005 | From Balls and Bins to Points and Vertices. Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes |
| 2005 | GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue |
| 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 | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2005 | Hardness and Approximation of Octilinear Steiner Trees. Matthias Müller-Hannemann, Anna Schulze |
| 2005 | Hybrid Voting Protocols and Hardness of Manipulation. Edith Elkind, Helger Lipmaa |
| 2005 | ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour. Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis |
| 2005 | Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem. Hao Yuan, Linji Yang, Erdong Chen |
| 2005 | Improved Algorithms for the Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao |
| 2005 | Improved Approximate String Matching Using Compressed Suffix Data Structures. Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong |
| 2005 | Laminar Structure of Ptolemaic Graphs and Its Applications. Ryuhei Uehara, Yushi Uno |
| 2005 | Localized and Compact Data-Structure for Comparability Graphs. Fabrice Bazzaro, Cyril Gavoille |
| 2005 | Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. Erdong Chen, Hao Yuan, Linji Yang |
| 2005 | Minimizing a Monotone Concave Function with Laminar Covering Constraints. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
| 2005 | Minimum Entropy Coloring. Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
| 2005 | Minimum Weight Triangulation by Cutting Out Triangles. Magdalene Grantson, Christian Borgelt, Christos Levcopoulos |
| 2005 | Monitoring Continuous Band-Join Queries over Dynamic Data. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu |
| 2005 | Multi-directional Width-Bounded Geometric Separator and Protein Folding. Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu |
| 2005 | Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | Multiple Polyline to Polygon Matching. Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort |
| 2005 | Network Game with Attacker and Protector Entities. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis |
| 2005 | Network Load Games. Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis |
| 2005 | On Bounded Load Routings for Modeling Adrian Kosowski, Michal Malafiejski, Pawel Zylinski |
| 2005 | On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. Jérôme Monnot |
| 2005 | On Efficient Weighted Rectangle Packing with Large Resources. Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
| 2005 | On Routing in VLSI Design and Communication Networks. Tamás Terlaky, Anthony Vannelli, Hu Zhang |
| 2005 | On the Complexity of Global Constraint Satisfaction. Cristina Bazgan, Marek Karpinski |
| 2005 | On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. Zhixiang Chen, Bin Fu |
| 2005 | On the Complexity of the Zdenek Dvorák, Vít Jelínek |
| 2005 | On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. Chris Worman, Boting Yang |
| 2005 | On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. Marc Demange, Bernard Kouakou, Éric Soutif |
| 2005 | Optimal Paths for Mutually Visible Agents. Joel Fenwick, Vladimir Estivill-Castro |
| 2005 | Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. Xiao Zhou, Takao Nishizeki |
| 2005 | Pareto Optimality in House Allocation Problems. David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn |
| 2005 | Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, . Carme Àlvarez, Joaquim Gabarró, Maria J. Serna |
| 2005 | Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information. Yong He, Yiwei Jiang |
| 2005 | Probability and Recursion. Kousha Etessami, Mihalis Yannakakis |
| 2005 | Randomized Algorithm for the Sum Selection Problem. Tien-Ching Lin, D. T. Lee |
| 2005 | Recursion Theoretic Operators for Function Complexity Classes. Kenya Ueno |
| 2005 | Representation of Graphs by OBDDs. Robin Nunkesser, Philipp Woelfel |
| 2005 | Revisiting T. Uno and M. Yagiura's Algorithm . Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
| 2005 | Sampling Unlabeled Biconnected Planar Graphs. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang |
| 2005 | Scheduling to Minimize Makespan with Time-Dependent Processing Times. Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao |
| 2005 | Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time. Seth Pettie |
| 2005 | Separability with Outliers. Sariel Har-Peled, Vladlen Koltun |
| 2005 | Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. Sang Won Bae, Kyung-Yong Chwa |
| 2005 | Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2005 | Simulating Undirected Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-Yi Cai |
| 2005 | Simultaneous Matchings. Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan |
| 2005 | SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi |
| 2005 | Smoothed Analysis of Binary Search Trees. Bodo Manthey, Rüdiger Reischuk |
| 2005 | Solving Minimum Weight Exact Satisfiability in Time Stefan Porschen |
| 2005 | Space Efficient Algorithms for Ordered Tree Comparison. Lusheng Wang, Kaizhong Zhang |
| 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 | Stacking and Bundling Two Convex Polygons. Hee-Kap Ahn, Otfried Cheong |
| 2005 | The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. Andrew Lim, Fan Wang, Zhou Xu |
| 2005 | The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka |
| 2005 | The Phase Matrix. Peter Høyer |
| 2005 | Uniformization of Discrete Data. Lei Yang |
| 2005 | Upper Bounds on the Computational Power of an Optical Model of Computation. Damien Woods |