| 2003 | A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags. Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2003 | A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. Torsten Tholey |
| 2003 | A Dynamic Dictionary for Priced Information with Application. Anil Maheshwari, Michiel H. M. Smid |
| 2003 | A Faster Algorithm for Two-Variable Integer Programming. Friedrich Eisenbrand, Sören Laue |
| 2003 | A Faster Lattice Reduction Method Using Quantum Search. Christoph Ludwig |
| 2003 | A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura |
| 2003 | A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
| 2003 | A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs. Gabriel Valiente |
| 2003 | A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem. Hiroaki Yamamoto |
| 2003 | A Promising Key Agreement Protocol. Eun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo |
| 2003 | A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. Tom Altman, Yoshihide Igarashi, Michiko Omori |
| 2003 | A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. Anne Berry, Pinar Heggernes, Yngve Villanger |
| 2003 | Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono |
| 2003 | Algorithms for Enumerating Circuits in Matroids. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2003 | An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. Hiroshi Nagamochi, Yuusuke Abe |
| 2003 | An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees. Mohammod Abul Kashem, M. Ziaur Rahman |
| 2003 | Approximate Regular Expression Searching with Arbitrary Integer Weights. Gonzalo Navarro |
| 2003 | Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. Miroslav Chlebík, Janka Chlebíková |
| 2003 | Augmenting Forests to Meet Odd Diameter Requirements. Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi |
| 2003 | Biconnectivity on Symbolically Represented Graphs: A Linear Solution. Raffaella Gentilini, Alberto Policriti |
| 2003 | Computational Complexity Measures of Multipartite Quantum Entanglement. Tomoyuki Yamakami |
| 2003 | Constructing Compressed Suffix Arrays with Large Alphabets. Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung |
| 2003 | Counting Complexity Classes over the Reals I: The Additive Case. Peter Bürgisser, Felipe Cucker |
| 2003 | Deterministic Algorithm for the t-Threshold Set Problem. Jérémy Barbay, Claire Kenyon |
| 2003 | Drawing Plane Graphs. Takao Nishizeki |
| 2003 | Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. Yaw-Ling Lin, Tsan-sheng Hsu |
| 2003 | Efficient Algorithms for Generation of Combinatorial Covering Suites. Adrian Dumitrescu |
| 2003 | Efficient Algorithms for Optimizing Whole Genome Alignment with Noise. Tak Wah Lam, N. Lu, Hing-Fung Ting, Prudence W. H. Wong, Siu-Ming Yiu |
| 2003 | Energy-Efficient Wireless Network Design. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos |
| 2003 | Enumerating Global Roundings of an Outerplanar Graph. Nadia Takki-Chebihi, Takeshi Tokuyama |
| 2003 | Equilibria for Networks with Malicious Users. George Karakostas, Anastasios Viglas |
| 2003 | Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. Yoshio Okamoto |
| 2003 | Finding a Length-Constrained Maximum-Density Path in a Tree. Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao |
| 2003 | Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. Atsuko Yamaguchi, Hiroshi Mamitsuka |
| 2003 | Flexible Train Rostering. Stephan J. Eidenbenz, Aris Pagourtzis, Peter Widmayer |
| 2003 | Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic. Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong |
| 2003 | Geometric Restrictions on Producible Polygonal Protein Chains. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke |
| 2003 | Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract). Ornan Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg |
| 2003 | Hypergraph Decomposition and Secret Sharing. Giovanni Di Crescenzo, Clemente Galdi |
| 2003 | Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. Artur Czumaj, Andrzej Lingas, Johan Nilsson |
| 2003 | Infinitely-Often Autoreducible Sets. Richard Beigel, Lance Fortnow, Frank Stephan |
| 2003 | Interactive Proofs for Quantum Computation. Andrew Chi-Chih Yao |
| 2003 | Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2003 | Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. Shao Chin Sung, Keisuke Tanaka |
| 2003 | Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama |
| 2003 | Lower Bounds on Correction Networks. Grzegorz Stachowiak |
| 2003 | New Ways to Construct Binary Search Trees. Travis Gagie |
| 2003 | Non-interactive Quantum Perfect and Statistical Zero-Knowledge. Hirotada Kobayashi |
| 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 | On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2003 | On the Existence and Determination of Satisfactory Partitions in a Graph. Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
| 2003 | On the Geometric Dilation of Finite Point Sets. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein |
| 2003 | On the Locality Properties of Space-Filling Curves. H. K. Dai, Hung-Chi Su |
| 2003 | Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes. Deshi Ye, Guochuan Zhang |
| 2003 | Optimal Point Set Projections onto Regular Grids. José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès |
| 2003 | Polygonal Path Approximation: A Query Based Approach. Ovidiu Daescu, Ningfang Mi |
| 2003 | Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. Hiroshi Nagamochi, Kohei Okada |
| 2003 | Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani |
| 2003 | Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
| 2003 | Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. Ferdinando Cicalese, Christian Deppe |
| 2003 | Quasi-optimal Arithmetic for Quaternion Polynomials. Martin Ziegler |
| 2003 | Range Mode and Range Median Queries on Lists and Trees. Danny Krizanc, Pat Morin, Michiel H. M. Smid |
| 2003 | Rapid Mixing of Several Markov Chains for a Hard-Core Model. Ravi Kannan, Michael W. Mahoney, Ravi Montenegro |
| 2003 | Segmenting Doughnut-Shaped Objects in Medical Images. Xiaodong Wu |
| 2003 | Settling the Intractability of Multiple Alignment. Isaac Elias |
| 2003 | Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki |
| 2003 | Succinct Data Structures for Searchable Partial Sums. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung |
| 2003 | Symmetric Layout of Disconnected Graphs. Seok-Hee Hong, Peter Eades |
| 2003 | The Intractability of Computing the Hamming Distance. Bodo Manthey, Rüdiger Reischuk |
| 2003 | The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. Vikraman Arvind, Rainer Schuler |
| 2003 | The Student-Project Allocation Problem. David J. Abraham, Robert W. Irving, David F. Manlove |
| 2003 | Three Sorting Algorithms Using Priority Queues. Amr Elmasry |
| 2003 | Unfolded Modular Multiplication. Wieland Fischer, Jean-Pierre Seifert |
| 2003 | Upper Bounds on the Complexity of Some Galois Theory Problems. Vikraman Arvind, Piyush P. Kurur |
| 2003 | Voronoi Diagram in the Flow Field. Tetsushi Nishida, Kokichi Sugihara |
| 2003 | Wavelength Conversion in Shortest-Path All-Optical Networks. Thomas Erlebach, Stamatis Stefanakos |