Algorithms and Data Structures

Time Responsive External Data Structures for Moving Points

Pages 50-61

Agarwal, Pankaj K. (et al.)

Voronoi Diagrams for Moving Disks and Applications

Pages 62-74

Karavelas, Menelaos I.

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

Pages 75-86

Nishimura, Naomi (et al.)

Deciding Clique-Width for Graphs of Bounded Tree-Width

Pages 87-98

Espelage, Wolfgang (et al.)

Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions

Pages 99-110

Koltun, Vladlen

Optimization over Zonotopes and Training Support Vector Machines

Pages 111-121

Bern, Marshall (et al.)

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions

Pages 122-134

Agarwal, Pankaj K. (et al.)

Seller-Focused Algorithms for Online Auctioning

Pages 135-147

Bagchi, Amitabha (et al.)

Competitive Analysis of the LRFU Paging Algorithm

Pages 148-154

Cohen, Edith (et al.)

Admission Control to Minimize Rejections

Pages 155-164

Blum, Avrim (et al.)

Secure Multi-party Computational Geometry

Pages 165-179

Atallah, Mikhail J. (et al.)

The Grid Placement Problem

Pages 180-191

Bose, Prosenjit (et al.)

On the Reflexivity of Point Sets

Pages 192-204

Arkin, Esther M. (et al.)

A 7/8-Approximation Algorithm for Metric Max TSP

Pages 205-209

Hassin, Refael (et al.)

Approximating Multi-objective Knapsack Problems

Pages 210-221

Erlebach, Thomas (et al.)

Visual Ranking of Link Structures

Pages 222-233

Brandes, Ulrik (et al.)

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

Pages 234-245

He, Xin

Short and Simple Labels for Small Distances and Other Functions

Pages 246-257

Kaplan, Haim (et al.)

Fast Boolean Matrix Multiplication for Highly Clustered Data

Pages 258-263

Björklund, Andreas (et al.)

Partitioning Colored Point Sets into Monochromatic Parts

Pages 264-275

Dumitrescu, Adrian (et al.)

The Analysis of a Probabilistic Approach to Nearest Neighbor Searching

Pages 276-286

Maneewongvatana, Songrit (et al.)

I/O-Efficient Shortest Path Queries in Geometric Spanners

Pages 287-299

Maheshwari, Anil (et al.)

Higher-Dimensional Packing with Order Constraints

Pages 300-312

Fekete, Sándor P. (et al.)

Bin Packing with Item Fragmentation

Pages 313-324

Menakerman, Nir (et al.)

Practical Approximation Algorithms for Separable Packing Linear Programs

Pages 325-337

Dragan, Feodor F. (et al.)

The Challenges of Delivering Content on the Internet

Pages 338-338

Thomson Leighton, F.

Upward Embeddings and Orientations of Undirected Planar Graphs

Pages 339-351

Didimo, Walter (et al.)

An Approach for Mixed Upward Planarization

Pages 352-364

Eiglsperger, Markus (et al.)

A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

Pages 365-376

Bader, David A. (et al.)

Computing Phylogenetic Roots with Bounded Degrees and Errors

Pages 377-388

Chen, Zhi-Zhong (et al.)

A Decomposition-Based Approach to Layered Manufacturing

Pages 389-400

Ilinkin, Ivaylo (et al.)

When Can You Fold a Map?

Pages 401-413

Arkin, Esther M. (et al.)

Search Trees with Relaxed Balance and Near-Optimal Height

Pages 414-425

Fagerberg, Rolf (et al.)

Succinct Dynamic Data Structures

Pages 426-437

Raman, Rajeev (et al.)

Optimal Algorithms for Two-Guard Walkability of Simple Polygons

Pages 438-449

Bhattacharya, Binay (et al.)

Movement Planning in the Presence of Flows

Pages 450-461

Reif, John (et al.)

Small Maximal Independent Sets and Faster Exact Graph Coloring

Pages 462-470

Eppstein, David

On External-Memory Planar Depth First Search

Pages 471-482

Arge, Lars (et al.)