Table of Contents

• Approximation of Multiobjective Optimization ProblemsMihalis Yannakakis. 1 [doi]
• Optimal, Suboptimal, and Robust Algorithms for Proximity GraphsFerran Hurtado, Giuseppe Liotta, Henk Meijer. 2-13 [doi]
• Optimal Möbius Transformations for Information Visualization and MeshingMarshall W. Bern, David Eppstein. 14-25 [doi]
• Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer ProgrammingPhilip M. Long. 26-37 [doi]
• On the Complexity of Scheduling Conditional Real-Time CodeSamarjit Chakraborty, Thomas Erlebach, Lothar Thiele. 38-49 [doi]
• Time Responsive External Data Structures for Moving PointsPankaj K. Agarwal, Lars Arge, Jan Vahrenhold. 50-61 [doi]
• Voronoi Diagrams for Moving Disks and ApplicationsMenelaos I. Karavelas. 62-74 [doi]
• Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex CoverNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. 75-86 [doi]
• Deciding Clique-Width for Graphs of Bounded Tree-WidthWolfgang Espelage, Frank Gurski, Egon Wanke. 87-98 [doi]
• Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four DimensionsVladlen Koltun. 99-110 [doi]
• Optimization over Zonotopes and Training Support Vector MachinesMarshall W. Bern, David Eppstein. 111-121 [doi]
• Reporting Intersecting Pairs of Polytopes in Two and Three DimensionsPankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. 122-134 [doi]
• Seller-Focused Algorithms for Online AuctioningAmitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar. 135-147 [doi]
• Competitive Analysis of the LRFU Paging AlgorithmEdith Cohen, Haim Kaplan, Uri Zwick. 148-154 [doi]
• Admission Control to Minimize RejectionsAvrim Blum, Adam Kalai, Jon M. Kleinberg. 155-164 [doi]
• Secure Multi-party Computational GeometryMikhail J. Atallah, Wenliang Du. 165-179 [doi]
• The Grid Placement ProblemProsenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison. 180-191 [doi]
• On the Reflexivity of Point SetsEsther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia. 192-204 [doi]
• A 7/8-Approximation Algorithm for Metric Max TSPRefael Hassin, Shlomi Rubinstein. 205-209 [doi]
• Approximating Multi-objective Knapsack ProblemsThomas Erlebach, Hans Kellerer, Ulrich Pferschy. 210-221 [doi]
• Visual Ranking of Link StructuresUlrik Brandes, Sabine Cornelsen. 222-233 [doi]
• A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane GraphsXin He. 234-245 [doi]
• Short and Simple Labels for Small Distances and Other FunctionsHaim Kaplan, Tova Milo. 246-257 [doi]
• Fast Boolean Matrix Multiplication for Highly Clustered DataAndreas Björklund, Andrzej Lingas. 258-263 [doi]
• Partitioning Colored Point Sets into Monochromatic PartsAdrian Dumitrescu, János Pach. 264-275 [doi]
• The Analysis of a Probabilistic Approach to Nearest Neighbor SearchingSongrit Maneewongvatana, David M. Mount. 276-286 [doi]
• I/O-Efficient Shortest Path Queries in Geometric SpannersAnil Maheshwari, Michiel H. M. Smid, Norbert Zeh. 287-299 [doi]
• Higher-Dimensional Packing with Order ConstraintsSándor P. Fekete, Ekkehard Köhler, Jürgen Teich. 300-312 [doi]
• Bin Packing with Item FragmentationNir Menakerman, Raphael Rom. 313-324 [doi]
• Practical Approximation Algorithms for Separable Packing Linear ProgramsFeodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky. 325-337 [doi]
• The Challenges of Delivering Content on the InternetFrank Thomson Leighton. 338 [doi]
• Upward Embeddings and Orientations of Undirected Planar GraphsWalter Didimo, Maurizio Pizzonia. 339-351 [doi]
• An Approach for Mixed Upward PlanarizationMarkus Eiglsperger, Michael Kaufmann. 352-364 [doi]
• A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyDavid A. Bader, Bernard M. E. Moret, Mi Yan. 365-376 [doi]
• Computing Phylogenetic Roots with Bounded Degrees and ErrorsZhi-Zhong Chen, Tao Jiang, Guo-Hui Lin. 377-388 [doi]
• A Decomposition-Based Approach to Layered ManufacturingIvaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram. 389-400 [doi]
• When Can You Fold a Map?Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena. 401-413 [doi]
• Search Trees with Relaxed Balance and Near-Optimal HeightRolf Fagerberg, Rune E. Jensen, Kim S. Larsen. 414-425 [doi]
• Succinct Dynamic Data StructuresRajeev Raman, Venkatesh Raman, S. Srinivasa Rao. 426-437 [doi]
• Optimal Algorithms for Two-Guard Walkability of Simple PolygonsBinay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan. 438-449 [doi]
• Movement Planning in the Presence of FlowsJohn H. Reif, Zheng Sun. 450-461 [doi]
• Small Maximal Independent Sets and Faster Exact Graph ColoringDavid Eppstein. 462-470 [doi]
• On External-Memory Planar Depth First SearchLars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh. 471-482 [doi]