Algorithm Theory - SWAT 2004

Robust Subgraphs for Trees and Paths

Pages 51-63

Hassin, Refael (et al.)

Collective Tree Spanners of Graphs

Pages 64-76

Dragan, Feodor F. (et al.)

Optimally Competitive List Batching

Pages 77-89

Bein, Wolfgang W. (et al.)

The Relative Worst Order Ratio Applied to Seat Reservation

Pages 90-101

Boyar, Joan (et al.)

Online Maintenance of k-Medians and k-Covers on a Line

Pages 102-113

Fleischer, Rudolf (et al.)

Matching Polyhedral Terrains Using Overlays of Envelopes

Pages 114-126

Koltun, Vladlen (et al.)

Independent Set of Intersection Graphs of Convex Objects in 2D

Pages 127-137

Agarwal, Pankaj K. (et al.)

Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion

Pages 138-149

Berg, Mark (et al.)

Construction of the Nearest Neighbor Embracing Graph of a Point Set

Pages 150-160

Chan, M. Y. (et al.)

Connectivity of Graphs Under Edge Flips

Pages 161-173

Zeh, Norbert

Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity

Pages 174-186

Chlebík, Miroslav (et al.)

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

Pages 187-198

Habib, Michel (et al.)

Railway Delay Management: Exploring Its Algorithmic Complexity

Pages 199-211

Gatto, Michael (et al.)

Layered Heaps

Pages 212-222

Elmasry, Amr

Melding Priority Queues

Pages 223-235

Mendelson, Ran (et al.)

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs

Pages 236-247

Dvořák, Zdeněk (et al.)

Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices

Pages 248-259

Dessmark, Anders (et al.)

New Algorithms for Enumerating All Maximal Cliques

Pages 260-272

Makino, Kazuhisa (et al.)

The Multi-multiway Cut Problem

Pages 273-284

Avidor, Adi (et al.)

The Bottleneck Problem with Minimum Quantity Commitments

Pages 285-297

Lim, Andrew (et al.)

All-Norm Approximation for Scheduling on Identical Machines

Pages 298-310

Azar, Yossi (et al.)

Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler

Pages 311-322

Jansen, Klaus

Approximation Schemes for the Crane Scheduling Problem

Pages 323-335

Lim, Andrew (et al.)

Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems

Pages 336-348

Jothi, Raja (et al.)

A ($2 - c\frac{{\rm log} N}{N}$)–Approximation Algorithm for the Stable Marriage Problem

Pages 349-361

Iwama, Kazuo (et al.)

Maximizing the Number of Packed Rectangles

Pages 362-371

Jansen, Klaus (et al.)

Two Space Saving Tricks for Linear Time LCP Array Computation

Pages 372-383

Manzini, Giovanni

Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles

Pages 384-396

Thorup, Mikkel

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

Pages 397-407

Gąsieniec, Leszek (et al.)

Online Scheduling of Splittable Tasks in Peer-to-Peer Networks

Pages 408-419

Epstein, Leah (et al.)

The Optimal Online Algorithms for Minimizing Maximum Lateness

Pages 420-430

Uthaisombut, Patchrawat

Power Assignment in Radio Networks with Two Power Levels

Pages 431-441

Carmi, Paz (et al.)

Pointed Binary Encompassing Trees

Pages 442-454

Hoffmann, Michael (et al.)

On Geometric Structure of Global Roundings for Graphs and Range Spaces

Pages 455-467

Asano, Tetsuo (et al.)

External Connected Components

Pages 468-479

Sibeyn, Jop F.

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

Pages 480-492

Brodal, Gerth Stølting (et al.)

Simplified External Memory Algorithms for Planar DAGs

Pages 493-503

Arge, Lars (et al.)