| 2006 | The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. | Vikraman Arvind, Jacobo Torn |
| 2006 | On Isomorphism and Canonization of Tournaments and Hypertournaments. | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
| 2006 | A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. | Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang |
| 2006 | Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
| 2006 | Online Packet Admission and Oblivious Routing in Sensor Networks. | Mohamed Aly, John Augustine |
| 2006 | Approximating Tree Edit Distance Through String Edit Distance. | Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu |
| 2006 | Algorithms on Graphs with Small Dominating Targets. | Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta |
| 2005 | Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. | Xiao Zhou, Takao Nishizeki |
| 2005 | A Novel Adaptive Learning Algorithm for Stock Market Prediction. | Lean Yu, Shouyang Wang, Kin Keung Lai |
| 2005 | Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem. | Hao Yuan, Linji Yang, Erdong Chen |
| 2005 | Algorithmic Problems in Wireless Ad Hoc Networks. | F. Frances Yao |
| 2005 | Finding Two Disjoint Paths in a Network with Normalized | Bing Yang, S. Q. Zheng, Enyue Lu |
| 2005 | Uniformization of Discrete Data. | Lei Yang |
| 2005 | An Improved O(1.234 | Masaki Yamamoto |
| 2005 | Revisiting T. Uno and M. Yagiura's Algorithm . | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
| 2005 | GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. | Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue |
| 2005 | The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. | Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka |
| 2005 | On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. | Chris Worman, Boting Yang |
| 2005 | Upper Bounds on the Computational Power of an Optical Model of Computation. | Damien Woods |
| 2005 | Space Efficient Algorithms for Ordered Tree Comparison. | Lusheng Wang, Kaizhong Zhang |
| 2005 | Efficient Parallel Algorithms for Constructing a | Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian |
| 2005 | Recursion Theoretic Operators for Function Complexity Classes. | Kenya Ueno |
| 2005 | Laminar Structure of Ptolemaic Graphs and Its Applications. | Ryuhei Uehara, Yushi Uno |
| 2005 | On Routing in VLSI Design and Communication Networks. | Tams Terlaky, Anthony Vannelli, Hu Zhang |
| 2005 | Multiple Polyline to Polygon Matching. | Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort |