Table of Contents

• Solving Traveling Salesman ProblemsWilliam Cook. 1 [doi]
• Computing Shapes from Point Cloud DataTamal K. Dey. 2 [doi]
• Mechanism Design for Fun and ProfitAnna R. Karlin. 3 [doi]
• On Distance Oracles and Routing in GraphsMikkel Thorup. 4 [doi]
• Kinetic Medians and kd-TreesPankaj K. Agarwal, Jie Gao, Leonidas J. Guibas. 5-16 [doi]
• Range Searching in Categorical Data: Colored Range Searching on GridPankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan. 17-28 [doi]
• Near-Linear Time Approximation Algorithms for Curve SimplificationPankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang. 29-41 [doi]
• Translating a Planar Object to Maximize Point ContainmentPankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl. 42-53 [doi]
• Approximation Algorithms for k-Line CenterPankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan. 54-63 [doi]
• New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman ProblemDino Ahr, Gerhard Reinelt. 64-74 [doi]
• SCIL - Symbolic Constraints in Integer Linear ProgrammingErnst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn. 75-87 [doi]
• Implementing I/O-efficient Data Structures Using TPIELars Arge, Octavian Procopiuc, Jeffrey Scott Vitter. 88-100 [doi]
• On the k-Splittable Flow ProblemGeorg Baier, Ekkehard Köhler, Martin Skutella. 101-113 [doi]
• Partial Alphabetic TreesArye Barkan, Haim Kaplan. 114-125 [doi]
• Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS RouterChristopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe. 126-138 [doi]
• Scanning and Traversing: Maintaining Data for Traversals in a Memory HierarchyMichael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton. 139-151 [doi]
• Two Simplified Algorithms for Maintaining Order in a ListMichael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito. 152-164 [doi]
• Efficient Tree Layout in a Multilevel Memory HierarchyMichael A. Bender, Erik D. Demaine, Martin Farach-Colton. 165-173 [doi]
• A Computational Basis for Conic Arcs and Boolean Operations on Conic PolygonsEric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer. 174-186 [doi]
• TSP with Neighborhoods of Varying SizeMark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen. 187-199 [doi]
• 1.375-Approximation Algorithm for Sorting by ReversalsPiotr Berman, Sridhar Hannenhalli, Marek Karpinski. 200-210 [doi]
• Radio Labeling with Pre-assigned FrequenciesHans Leo Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger. 211-222 [doi]
• Branch-and-Bound Algorithms for the Test Cover ProblemKoen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie. 223-233 [doi]
• Constructing Plane Spanners of Bounded Degree and Low WeightProsenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid. 234-246 [doi]
• Eager st-OrderingUlrik Brandes. 247-256 [doi]
• Three-Dimensional Layers of MaximaAdam L. Buchsbaum, Michael T. Goodrich. 257-269 [doi]
• Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation TherapyDanny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu. 270-283 [doi]
• Geometric Algorithms for Density-Based Data ClusteringDanny Z. Chen, Michiel H. M. Smid, Bin Xu. 284-296 [doi]
• Balanced-Replication Algorithms for Distribution TreesEdith Cohen, Haim Kaplan. 297-309 [doi]
• Butterflies and Peer-to-Peer NetworksMayur Datar. 310-322 [doi]
• Estimating Rarity and Similarity over Data Stream WindowsMayur Datar, S. Muthukrishnan. 323-334 [doi]
• Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access ChannelsAnnalisa De Bonis, Ugo Vaccaro. 335-347 [doi]
• Frequency Estimation of Internet Packet Streams with Limited SpaceErik D. Demaine, Alejandro López-Ortiz, J. Ian Munro. 348-360 [doi]
• Truthful and Competitive Double AuctionsKaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin. 361-373 [doi]
• Optimal Graph Exploration without Good MapsAnders Dessmark, Andrzej Pelc. 374-386 [doi]
• Approximating the Medial Axis from the Voronoi Diagram with a Convergence GuaranteeTamal K. Dey, Wulue Zhao. 387-398 [doi]
• Non-independent Randomized Rounding and an Application to Digital HalftoningBenjamin Doerr, Henning Schnieder. 399-410 [doi]
• Computing Homotopic Shortest Paths EfficientlyAlon Efrat, Stephen G. Kobourov, Anna Lubiw. 411-423 [doi]
• An Algorithm for Dualization in Products of Lattices and Its ApplicationsKhaled M. Elbassioni. 424-435 [doi]
• Determining Similarity of Conformational PolymorphsAngela Enosh, Klara Kedem, Joel Bernstein. 436-448 [doi]
• Minimizing the Maximum Starting Time On-lineLeah Epstein, Rob van Stee. 449-460 [doi]
• Vector Assignment Problems: A General FrameworkLeah Epstein, Tamir Tassa. 461-472 [doi]
• Speeding Up the Incremental Construction of the Union of Geometric Objects in PracticeEti Ezra, Dan Halperin, Micha Sharir. 473-484 [doi]
• Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueTorsten Fahle. 485-498 [doi]
• Online Companion CachingAmos Fiat, Manor Mendel, Steven S. Seiden. 499-511 [doi]
• Deterministic Communication in Radio Networks with Large LabelsLeszek Gasieniec, Aris Pagourtzis, Igor Potapov. 512-524 [doi]
• A Primal Approach to the Stable Set ProblemClaudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel. 525-537 [doi]
• Wide-Sense Nonblocking WDM Cross-ConnectsPenny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler. 538-549 [doi]
• Efficient Implementation of a Minimal Triangulation AlgorithmPinar Heggernes, Yngve Villanger. 550-561 [doi]
• Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation SchemeKlaus Jansen. 562-573 [doi]
• The Probabilistic Analysis of a Greedy Satisfiability AlgorithmAlexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas. 574-585 [doi]
• Dynamic Additively Weighted Voronoi Diagrams in 2DMenelaos I. Karavelas, Mariette Yvinec. 586-598 [doi]
• Time-Expanded Graphs for Flow-Dependent Transit TimesEkkehard Köhler, Katharina Langkau, Martin Skutella. 599-611 [doi]
• Partially-Ordered Knapsack and Applications to SchedulingStavros G. Kolliopoulos, George Steiner. 612-624 [doi]
• A Software Library for Elliptic Curve CryptographyElisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis. 625-636 [doi]
• Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time WindowsSven Oliver Krumke, Jörg Rambau, Luis Torres. 637-648 [doi]
• Randomized Approximation Algorithms for Query Optimization Problems on Two ProcessorsEduardo Sany Laber, Ojas Parekh, R. Ravi. 649-661 [doi]
• Covering Things with ThingsStefan Langerman, Pat Morin. 662-673 [doi]
• On-Line Dial-a-Ride Problems under a Restricted Information ModelMaarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie. 674-685 [doi]
• Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic GraphsKrzysztof Lorys, Grazyna Zwozniak. 686-697 [doi]
• Engineering a Lightweight Suffix Array Construction AlgorithmGiovanni Manzini, Paolo Ferragina. 698-710 [doi]
• Complexity of Compatible Decompositions of Eulerian Graphs and Their TransformationsJana Maxová, Jaroslav Nesetril. 711-722 [doi]
• External-Memory Breadth-First Search with Sublinear I/OKurt Mehlhorn, Ulrich Meyer. 723-735 [doi]
• Frequency Channel Assignment on Planar NetworksMichael Molloy, Mohammad R. Salavatipour. 736-747 [doi]
• Design and Implementation of Efficient Data Types for Static GraphsStefan Näher, Oliver Zlotowski. 748-759 [doi]
• An Exact Algorithm for the Uniformly-Oriented Steiner Tree ProblemBenny K. Nielsen, Pawel Winter, Martin Zachariasen. 760-771 [doi]
• A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian OptionsKenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama. 772-784 [doi]
• Sorting 13 Elements Requires 34 ComparisonsMarcin Peczarski. 785-794 [doi]
• Extending Reduction Techniques for the Steiner Tree ProblemTobias Polzin, Siavash Vahdati Daneshmand. 795-807 [doi]
• A Comparison of Multicast Pull ModelsKirk Pruhs, Patchrawat Uthaisombut. 808-819 [doi]
• Online Scheduling for Sorting BuffersHarald Räcke, Christian Sohler, Matthias Westermann. 820-832 [doi]
• Finding the Sink Takes Some TimeIngo Schurr, Tibor Szabó. 833-844 [doi]
• Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network DesignMeinolf Sellmann, Georg Kliewer, Achim Koberstein. 845-858 [doi]
• Minimizing Makespan and Preemption Costs on a System of Uniform MachinesHadas Shachnai, Tami Tamir, Gerhard J. Woeginger. 859-871 [doi]
• Minimizing the Total Completion Time On-line on a Single Machine, Using RestartsRob van Stee, Johannes A. La Poutré. 872-883 [doi]
• High-Level Filtering for Arrangements of Conic ArcsRon Wein. 884-895 [doi]
• An Approximation Scheme for Cake Division with a Linear Number of CutsGerhard J. Woeginger. 896-901 [doi]
• A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane GraphsHuaming Zhang, Xin He. 902-914 [doi]