| 2003 | Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. | Ashim Garg, Adrian Rusu |
| 2003 | A Space Efficient Algorithm for Sequence Alignment with Inversions. | Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin |
| 2003 | Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. | Carlo Gaibisso, Guido Proietti, Richard B. Tan |
| 2003 | On All-Substrings Alignment Problems. | Wei Fu, Wing-Kai Hon, Wing-Kin Sung |
| 2003 | The Specker-Blatter Theorem Revisited. | Eldar Fischer, Johann A. Makowsky |
| 2003 | Approximate Rank Aggregation (Preliminary Version). | Xiaotie Deng, Qizhi Fang, Shanfeng Zhu |
| 2003 | Tetris is Hard, Even to Approximate. | Erik D. Demaine, Susan Hohenberger, David Liben-Nowell |
| 2003 | Distributed Algorithm for Better Approximation of the Maximum Matching. | Andrzej Czygrinow, Michal Hanckowiak |
| 2003 | Covering a Set of Points with a Minimum Number of Turns. | Michael J. Collins |
| 2003 | Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. | Mark Cieliebak, Stephan J. Eidenbenz, Gerhard J. Woeginger |
| 2003 | Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. | Ren Hua Chung, Dan Gusfield |
| 2003 | Improved Competitive Algorithms for Online Scheduling with Partial Job Values. | Francis Y. L. Chin, Stanley P. Y. Fung |
| 2003 | Geometric Algorithms for Agglomerative Hierarchical Clustering. | Danny Z. Chen, Bin Xu |
| 2003 | On the Full and Bottleneck Full Steiner Tree Problems. | Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang |
| 2003 | Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet. | Zhixiang Chen, Richard H. Fowler, Ada Wai-Chee Fu, Chunyue Wang |
| 2003 | Majority Equilibrium for Public Facility Allocation (Preliminary Version). | Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian |
| 2003 | Isoperimetric Inequalities and the Width Parameters of Graphs. | L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian |
| 2003 | On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. | Jin-yi Cai, Osamu Watanabe |
| 2003 | Finding Hidden Independent Sets in Interval Graphs. | Therese Biedl, Brona Brejov, Erik D. Demaine, Angle M. Hamel, Alejandro Lpez-Ortiz, Toms Vinar |
| 2003 | Cylindrical Hierarchy for Deforming Necklaces. | Sergei Bespamyatnikh |
| 2003 | On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. | Anne Bergeron, Jens Stoye |
| 2003 | Experiments for Algorithm Engineering. | Jon Louis Bentley |
| 2003 | On a Conjecture on Wiener Indices in Combinatorial Chemistry. | Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa |
| 2003 | The Structure and Number of Global Roundings of a Graph. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 2003 | Graph Coloring and the Immersion Order. | Faisal N. Abu-Khzam, Michael A. Langston |