List of accepted papers for WADS 2003: Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser Shape Segmentation and Matching with Flow Discretization Tamal Dey, Joachim Giesen, Samrat Goswami Phylogenetic Reconstruction from Gene Rearrangement Data with Unequal Gene Content Jijun Tang, Bernard Moret Toward Optimal Motif Enumeration Patricia Evans, Andrew Smith Common-Deadline Lazy Bureaucrat Scheduling Problems Behdad Esfahbo, Mohammad Ghodsi, Ali Sharifi Bandwidth-Constrained Allocation in Grid Computing Anshul Kothari, Subhash Suri, Yunhong Zhou Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection Sudipta Sengupta Fast Algorithms for a Class of Temporal Range Queries Qingmin Shi, Joseph JaJa Distribution-Sensitive Binomial Queues Amr Elmasry Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees Gianni Franceschini, Roberto Grossi Extremal Configurations and Levels in Pseudoline Arrangements Micha Sharir, Shakhar Smorodinsky Fast Relative Approximation of Potential Fields, Martin Ziegler The one-round Voronoi game replayed Sandor Fekete, Henk Meijer Integrated Prefetching and Caching with Read and Write Requests Susanne Albers, Markus Buttner On-Line Seat Reservations via Off-Line Seating Arrangements Jens S. Frederiksen, Kim S. Larsen Routing and Call Control Algorithms for Ring Networks R. Sai Anand, Thomas Erlebach Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles Matthias Muller-Hannemann, Sven Peyer On the Hausdorff Voronoi diagram of point clusters in the plane Evanthia Papadopoulou Cropping-Resilient Segmented Multiple Watermarking Keith Frikken, Mikhail Atallah On Simultaneous Planar Graph Embeddings P. Brass, E. Cenek, C. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, J. Mitchell Approximation Algorithm for Hotlink Assignments in Web Directories Rachel Matichin, David Peleg Drawing Graphs with Large Vertices and Thick Edges Gill Barequet, Michael T. Goodrich, Chris Riley Semi-Matchings for Bipartite Graphs and Load Balancing Nicholas Harvey, Richard Ladner, Laszlo Lovasz, Tami Tamir The Traveling Salesman Problem for Cubic Graphs David Eppstein Sorting circular permutations by reversal Andrew Solomon, Paul Sutcliffe, Raymond Lister An improved bound on Boolean matrix multiplication for highly clustered data Leszek Gasieniec, Andrzej Lingas Dynamic Text and Static Pattern Matching Amihood Amir, Gad Landau, Moshe Lewenstein, Dina Sokol Real Two Dimensional Scaled Matching Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat Proximity Structures for Geometric graphs Sanjiv Kapoor, Xiang-Yang Li The Zigzag Path of a Pseudo-Triangulation Oswin Aichholzer, Guenter Rote, Bettina Speckmann, Ileana Streinu Alternating Paths along Orthogonal Segmenta Csaba Toth Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem Marek Karpinski, Ion Mandoiu, Alex Olshevsky, Alexander Zelikovsky Chips on Wafers, or Packing Rectangles into Grids Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos A Model for Analyzing Black-Box Optimization Pavel Sumazin, Vinhthuy Phan, Steve Skiena Multi-way Space Partitioning Trees Christian Duncan Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint Significant-Presence Range Queries in Categorical Data Mark de Berg, Herman J. Haverkort Either/Or: Using Vertex Cover Structure in designing FPT-algorithms - the case of k-Internal Spanning Tree Elena Prieto, Christian Sloper Parameterized Complexity of Directed Feedback Set Problems in Tournaments Venkatesh Raman, Saket Saurabh Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs Huaming Zhang, Xin He