Table of Contents

• Sublinear ComputingBernard Chazelle. 1 [doi]
• Authenticated Data StructuresRoberto Tamassia. 2-5 [doi]
• Approximation Algorithms and Network GamesÉva Tardos. 6 [doi]
• I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max QueriesPankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi. 7-18 [doi]
• Line System Design and a Generalized Coloring ProblemMansoor Alicherry, Randeep Bhatia. 19-30 [doi]
• Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity PropertiesAaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys. 31-42 [doi]
• Scheduling for Flow-Time with Admission ControlNikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere. 43-54 [doi]
• On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended AbstractReuven Bar-Yehuda, Guy Even, Shimon Shahar. 55-66 [doi]
• Semi-clairvoyant SchedulingLuca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs. 67-77 [doi]
• Algorithms for Graph Rigidity and Scene AnalysisAlex R. Berg, Tibor Jordán. 78-89 [doi]
• Optimal Dynamic Video-on-Demand Using Adaptive BroadcastingTherese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper. 90-101 [doi]
• Multi-player and Multi-round Auctions with Severely Bounded CommunicationLiad Blumrosen, Noam Nisan, Ilya Segal. 102-113 [doi]
• Network Lifetime and Power Assignment in ad hoc Wireless NetworksGruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky. 114-126 [doi]
• Disjoint Unit Spheres admit at Most Two Line TransversalsOtfried Cheong, Xavier Goaoc, Hyeon-Suk Na. 127-135 [doi]
• An Optimal Algorithm for the Maximum-Density Segment ProblemKai-Min Chung, Hsueh-I Lu. 136-147 [doi]
• Estimating Dominance Norms of Multiple Data StreamsGraham Cormode, S. Muthukrishnan. 148-160 [doi]
• Smoothed Motion ComplexityValentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler. 161-171 [doi]
• Kinetic Dictionaries: How to Shoot a Moving TargetMark de Berg. 172-183 [doi]
• Deterministic Rendezvous in GraphsAnders Dessmark, Pierre Fraigniaud, Andrzej Pelc. 184-195 [doi]
• Fast Integer Programming in Fixed DimensionFriedrich Eisenbrand. 196-207 [doi]
• Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted GraphsDotan Emanuel, Amos Fiat. 208-220 [doi]
• Dominating Sets and Local TreewidthFedor V. Fomin, Dimitrios M. Thilikos. 221-229 [doi]
• Approximating Energy Efficient Paths in Wireless Multi-hop NetworksStefan Funke, Domagoj Matijevic, Peter Sanders. 230-241 [doi]
• Bandwidth Maximization in MulticastingNaveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit. 242-253 [doi]
• Optimal Distance Labeling for Interval and Circular-Arc GraphsCyril Gavoille, Christophe Paul. 254-265 [doi]
• Improved Approximation of the Stable Marriage ProblemMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. 266-277 [doi]
• Fast Algorithms for Computing the Smallest k-Enclosing DiscSariel Har-Peled, Soham Mazumdar. 278-288 [doi]
• The Minimum Generalized Vertex Cover ProblemRefael Hassin, Asaf Levin. 289-300 [doi]
• An Approximation Algorithm for MAX-2-SAT with Cardinality ConstraintThomas Hofmeister. 301-312 [doi]
• On-Demand Broadcasting Under DeadlineBala Kalyanasundaram, Mahendran Velauthapillai. 313-324 [doi]
• Improved Bounds for Finger Search on a RAMAlexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. 325-336 [doi]
• The Voronoi Diagram of Planar Convex ObjectsMenelaos I. Karavelas, Mariette Yvinec. 337-348 [doi]
• Buffer Overflows of Merging StreamsAlexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir. 349-360 [doi]
• Improved Competitive Guarantees for QoS BufferingAlexander Kesselman, Yishay Mansour, Rob van Stee. 361-372 [doi]
• On Generalized Gossiping and Broadcasting (Extended Abstract)Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan. 373-384 [doi]
• Approximating the Achromatic Number Problem on Bipartite GraphsGuy Kortsarz, Sunil M. Shende. 385-396 [doi]
• Adversary Immune Leader Election in ad hoc Radio NetworksMiroslaw Kutylowski, Wojciech Rutkowski. 397-408 [doi]
• Universal Facility LocationMohammad Mahdian, Martin Pál. 409-421 [doi]
• A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract)Grzegorz Malewicz. 422-433 [doi]
• I/O-Efficient Undirected Shortest PathsUlrich Meyer, Norbert Zeh. 434-445 [doi]
• On the Complexity of Approximating TSP with Neighborhoods and Related ProblemsShmuel Safra, Oded Schwartz. 446-458 [doi]
• A Lower Bound for Cake CuttingJiri Sgall, Gerhard J. Woeginger. 459-469 [doi]
• Ray Shooting and Stone ThrowingMicha Sharir, Hayim Shaul. 470-481 [doi]
• Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic GraphsAleksandrs Slivkins. 482-493 [doi]
• Binary Space Partition for Orthogonal Fat RectanglesCsaba D. Tóth. 494-505 [doi]
• Sequencing by Hybridization in Few RoundsDekel Tsur. 506-516 [doi]
• Efficient Algorithms for the Ring Loading Problem with Demand SplittingBiing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh. 517-526 [doi]
• Seventeen Lines and One-Hundred-and-One PointsGerhard J. Woeginger. 527-531 [doi]
• Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic CurvesNicola Wolpert. 532-543 [doi]
• Streaming Geometric Optimization Using Graphics HardwarePankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian. 544-555 [doi]
• An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph TransversalsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. 556-567 [doi]
• Experiments on Graph Clustering AlgorithmsUlrik Brandes, Marco Gaertler, Dorothea Wagner. 568-579 [doi]
• More Reliable Protein NMR Peak Assignment via Improved 2-Interval SchedulingZhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu. 580-592 [doi]
• The Minimum Shift Design Problem: Theory and PracticeLuca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany. 593-604 [doi]
• Loglog Counting of Large Cardinalities (Extended Abstract)Marianne Durand, Philippe Flajolet. 605-617 [doi]
• Packing a TrunkFriedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer. 618-629 [doi]
• Fast Smallest-Enclosing-Ball Computation in High DimensionsKaspar Fischer, Bernd Gärtner, Martin Kutz. 630-641 [doi]
• Automated Generation of Search Tree Algorithms for Graph Modification ProblemsJens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier. 642-653 [doi]
• Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationMiguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel. 654-666 [doi]
• Fleet Assignment with Connection Dependent Ground TimesSven Grothklags. 667-678 [doi]
• A Practical Minimum Spanning Tree Algorithm Using the Cycle PropertyIrit Katriel, Peter Sanders, Jesper Larsson Träff. 679-690 [doi]
• The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended AbstractGunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher. 691-702 [doi]
• Algorithms and Experiments for the WebgraphLuigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn. 703-714 [doi]
• Finding Short Integral Cycle Bases for Cyclic TimetablingChristian Liebchen. 715-726 [doi]
• Slack Optimization of Timing-Critical NetsMatthias Müller-Hannemann, Ute Zimmermann. 727-739 [doi]
• Multisampling: A New Approach to Uniform Sampling and Approximate CountingPiotr Sankowski. 740-751 [doi]
• Multicommodity Flow Approximation Used for Exact Graph PartitioningMeinolf Sellmann, Norbert Sensen, Larissa Timajev. 752-764 [doi]
• A Linear Time Heuristic for the Branch-Decomposition of Planar GraphsHisao Tamaki. 765-775 [doi]
• Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse GraphsDorothea Wagner, Thomas Willhalm. 776-787 [doi]