| 2003 | A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. | Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura |
| 2003 | On the Geometric Dilation of Finite Point Sets. | Annette Ebbers-Baumann, Ansgar Grne, Rolf Klein |
| 2003 | Efficient Algorithms for Generation of Combinatorial Covering Suites. | Adrian Dumitrescu |
| 2003 | Optimal Point Set Projections onto Regular Grids. | Jos Miguel Daz-Bez, Ferran Hurtado, Mario Alberto Lpez, Joan Antoni Sellars |
| 2003 | Geometric Restrictions on Producible Polygonal Protein Chains. | Erik D. Demaine, Stefan Langerman, Joseph O'Rourke |
| 2003 | On the Locality Properties of Space-Filling Curves. | H. K. Dai, Hung-Chi Su |
| 2003 | Polygonal Path Approximation: A Query Based Approach. | Ovidiu Daescu, Ningfang Mi |
| 2003 | Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. | Artur Czumaj, Andrzej Lingas, Johan Nilsson |
| 2003 | Hypergraph Decomposition and Secret Sharing. | Giovanni Di Crescenzo, Clemente Galdi |
| 2003 | A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
| 2003 | Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. | Ferdinando Cicalese, Christian Deppe |
| 2003 | Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama |
| 2003 | Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. | Miroslav Chlebk, Janka Chlebkov |
| 2003 | On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. | Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen |
| 2003 | Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2003 | Energy-Efficient Wireless Network Design. | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos |
| 2003 | Counting Complexity Classes over the Reals I: The Additive Case. | Peter Brgisser, Felipe Cucker |
| 2003 | Algorithms for Enumerating Circuits in Matroids. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2003 | A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. | Anne Berry, Pinar Heggernes, Yngve Villanger |
| 2003 | Infinitely-Often Autoreducible Sets. | Richard Beigel, Lance Fortnow, Frank Stephan |
| 2003 | On the Existence and Determination of Satisfactory Partitions in a Graph. | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
| 2003 | Deterministic Algorithm for the t-Threshold Set Problem. | Jrmy Barbay, Claire Kenyon |
| 2003 | The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. | Vikraman Arvind, Rainer Schuler |
| 2003 | Upper Bounds on the Complexity of Some Galois Theory Problems. | Vikraman Arvind, Piyush P. Kurur |
| 2003 | A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. | Tom Altman, Yoshihide Igarashi, Michiko Omori |