List of accepted papers for ESA 2003: Design and Analysis Track: I/O-Efficient Structures for Orthogonal Range Max and Stabbing Max Pankaj K. Agarwal and Lars Arge and Jun Yang and Ke Yi Line System Design and a Generalized Coloring Problem Mansoor Alicherry and Randeep Bhatia Lagrangian relaxation for the k-median problem: new insights and continuity properties Aaron Archer and Ranjithkumar Rajagopalan and David B. Shmoys Scheduling for Flow-Time with Admission Control Nikhil Bansal and Avrim Blum and Shuchi Chawla and Kedar Dhamdhere On Approximating A Geometric Traveling Salesman Problem With Time Windows Reuven Bar-Yehuda and Guy Even and Shimon (Moni) Shahar Semi-clairvoyant Scheduling Luca Becchetti and Stefano Leonardi and Alberto Marchetti-Spaccamela and Kirk Pruhs Algorithms for graph rigidity and scene analysis Alex R. Berg and Tibor Jordan Optimal Dynamic Video-On-Demand using Adaptive Broadcasting Therese Biedl and Erik D. Demaine and Alexander Golynski and Joseph D. Horton and Alejandro Lopez-Ortiz and Guillaume Poirier and Claude-Guy Quimper Multi-Player and Multi-Round Auctions with Severely Bounded Communication Liad Blumrosen and Noam Nisan and Ilya Segal Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks Gruia Calinescu, Sanjiv Kapoor, Alex Olshevsky, Alex Zelikovsky Disjoint Unit Spheres Admit At Most Two Line Transversals Otfried Cheong and Xavier Goaoc and Hyeon-Suk Na An Optimal Algorithm for the Maximum-Density Segment Problem Kai-min Chung and Hsueh-I Lu Estimating Dominance Norms of Multiple Data Streams Graham Cormode and S. Muthukrishnan Smoothed Motion Complexity Valentina Damerow and Friedhelm Meyer auf der Heider and Harald Raecke and Christian Scheideler and Christian Sohler Kinetic Dictionaries: How to Shoot a Moving Target Mark de Berg Deterministic rendezvous in graphs A. Dessmark and P. Fraigniaud and A. Pelc Binary Space Partition for Orthogonal Fat Rectangles Csaba D. Toth Correlation Clustering -- Minimizing Disagreements on Arbitrary Weighted Graphs Dotan Emanuel and Amos Fiat Fast integer programming in fixed dimension Friedrich Eisenbrand Dominating sets and local treewidth Fedor V. Fomin and Dimitrios M. Thilikos Approximating Energy Efficient Paths in Wireless Multi-Hop Networks Stefan Funke and Domagoj Matijevic and Peter Sanders Bandwidth Maximization in Multicasting Naveen Garg and Rohit Khandekar and Keshav Kunal Optimal Distance Labeling Schemes Cyril Gavoille and Christophe Paul Improved Approximation of the Stable Marriage Problem Magnus Halldorsson and Kazuo Iwama and Shuichi Miyazaki and Hiroki Yanagisawa Fast Algorithms for Computing the Smallest k-Enclosing Disc Sariel Har-Peled and Soham Mazumdar The minimum generalized vertex cover problem Refael Hassin and Asaf Levin An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint Thomas Hofmeister On Demand Broadcasting Under Deadline Bala Kalyanasundaram and Mahe Velauthapillai Improved Bounds for Finger Search on a RAM Alexis Kaporis and Christos Makris and Spyros Sioutas and Athanasios Tsakalidis and Kostas Tsichlas and Christos Zaroliagis The Voronoi Diagram of Convex Objects in the Plane Menelaos I. Karavelas and Mariette Yvinec Improved Competitive Guarantees for QoS Buffering Alex Kesselman and Yishay Mansour and Rob van Stee Buffer Overflows of Merging Streams Kesselman and Lotker and Mansour and Patt-Shamir On generalized gossiping and broadcasting Samir Khuller and Yoo-Ah Kim and Yung-Chun Wan Approximating the achromatic number problem on bipartite graphs Guy Kortsarz and Sunil Shende Adversary Immune Leader Election in Ad Hoc Radio Networks. Miroslaw Kutylowski and Wojciech Rutkowski Universal Facility Location Mohammad Mahdian and Martin Pal A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm Grzegorz Malewicz I/O-Efficient Undirected Shortest Paths Ulrich Meyer and Norbert Zeh On the Complexity of Approximating TSP with Neighborhoods and related problems Oded Schwartz and Shmuel Safra A lower bound for cake cutting Jiri Sgall and Gerhard Woeginger Ray Shooting and Stone Throwing Micha Sharir and Hayim Shaul Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs Aleksandrs Slivkins Sequencing by Hybridization in Few Rounds Dekel Tsur Efficient Algorithms for the Ring Loading Problem with Demand Biing-Feng Wang, Yong-Hsian Hsieh, and Li-Pu Yeh Seventeen lines and one-hundred-and-one points Gerhard Woeginger Jacobi Curves: Computing the Exact Topologie of Arrangements of Non-Singular Algebraic Curves Nicola Wolpert Engineering and Applications Track: Streaming Geometric Optimization using Graphics Hardware Pankaj Agarwal, Shankar Krishnan, Nabil Mustafa and Suresh Venkatasubramanian An Efficient Implementation of a Quasi-Polynomial Algorithm for Generating Hypergraph Transversals E. Boros, K. Elbassioni, V. Gurvich, and L. Khachiyan Experiments on Graph Clustering Algorithms Ulrik Brandes, Marco Gaertler and Dorothea Wagner More Reliable Protein NMR Peak Assignment via Improved 2-Interval Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi and Jianjun Wen The minimum shift design problem: theory and practice Luca Di Gaspero, Johannes Gaertner, Guy Kortsarz Nysret Musliu, Andrea Schaerf and Wolfgang Slany Loglog Counting of Large Cardinalities Marianne Durand and Philippe Flajolet Packing a Trunk Friedrich Eisenbrand, Stefan Funke, Joachim Reichel and Elmar Shomer Fast Smallest-Enclosing-Ball Computation in High Dimensions Kaspar Fischer, Bernd Gaertner and Martin Kutz Automated Generation of Search Tree Algorithms for Graph Modification Problems Jens Gramm, Jiong Guo, Falk Hueffner and Rolf Niedermeier Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn and Michael Seel Fleet Assignment with Connection dependent Ground Times Sven Grothklags A Practical Minimum Spanning Tree Algorithm Using the Cycle Property Irit Katriel, Peter Sanders and Jesper Larsson Traeff The Fractional Prize-Collecting Steiner Tree Problem on Trees Gunnar Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy and Rene Weiskircher Finding Short Integer Cycle Bases for Cyclic Timetabling Christian Liebchen Algorithms and Experiments for the Webgraph Luigi Laura, Stefano Leonardi, Stefano Millozzi and Ulrich Meyer Slack Optimization of Timing-Critical Nets Matthias Mueller-Hannemann and Ute Zimmermann Multisampling: a New Approach to Uniform Sampling and Approximate Piotr Sankowski Multicommodity Flow Approximation used for Exact Graph Partitioning Meinolf Sellmann, Norbert Sensen and Larissa Timajev A linear time heuristic for the branch-decomposition of planar graphs Hisao Tamaki Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs Dorothea Wagner and Thomas Willhalm