List of accepted papers for SWAT 2008:


Bernard Mans, Stefan Schmid and Roger Wattenhofer. 
Distributed Disaster Disclosure

Yuval Rabani and Gabriel Scalosub.
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem

Daniel Dumitriu, Stefan Funke, Nikola Milosavljevic and Martin Kutz. 
On the Locality of Extracting a $2$-Manifold in $\mathbb{R}^3$

Yossi Azar, Uriel Feige and Daniel Glasner. 
A preemptive algorithm for maximizing disjoint paths on trees

John Hershberger and Subhash Suri. 
Simplified Planar Coresets for Data Streams

Telikepalli Kavitha.
On a special co-cycle basis of graphs

Hans Bodlaender, Richard Tan, Thomas C. van Dijk and Jan van Leeuwen.
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

Moshe Hershcovitch and Haim Kaplan.
I/O Efficient Dynamic Data Structures for Longest Prefix Queries

Nadja Betzler, Jiong Guo and Rolf Niedermeier.
Parameterized Computational Complexity of Dodgson and Young Elections

Bastian Degener, Joachim Gehweiler and Christiane Lammersen.
The Kinetic Facility Location Problem

Min Chih Lin, Francisco Soulignac and Jayme L. Szwarcfiter.
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs

Matt Gibson, Gaurav Kanade, Erik Krohn, Imran Pirwani and Kasturi Varadarajan. 
On Metric Clustering to Minimize the Sum of Radii

Prosenjit Bose, Paz Carmi and Mathieu Couture.
Spanners of Additively Weighted Point Sets

Arash Farzan and Ian Munro. 
A Uniform Approach Towards Succinct Representation of Trees

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari and Michiel Smid.
Computing the greedy spanner in near-quadratic time

Sandor Fekete, Alex Hall, Ekkehard Koehler and Alexander Kroeller.
The Maximum Energy-Constrained Dynamic Flow Problem

Sergey Bereg, Adrian Dumitrescu and Minghui Jiang.
On covering problems of Rado

Pinar Heggernes, Daniel Meister and Andrzej Proskurowski.
Minimum distortion embeddings into a path of bipartite permutation graphs and threshold graphs

Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail and Meghana Nasre.
Bounded Unpopularity Matchings

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno. 
An O(n^{1.75}) Algorithm for L(2,1)-labeling of Trees

Ulrich Meyer.
On Trade-Offs in External-Memory Diameter-Approximation

Julian Mestre, Ernst Althaus, Stefan Canzar, Andreas Karrenbauer and Khaled Elbassioni. 
Approximating the Interval Constrained Coloring Problem

Rolf Harren and Rob van Stee. 
Packing Rectangles into 2 OPT Bins using Rotations

Adrian Dumitrescu, Howi Kok, Ichiro Suzuki and Pawel Zylinski.
Vision-based pursuit-evasion in a grid

Michael Bekos, Michael Kaufmann, Martin N?llenburg and Antonios Symvonis.
Boundary Labeling with do, od and pd Leaders

Mitul Tiwari, Greg Plaxton, Yu Sun and Harrick Vin.
Online Compression Caching

Beat Gfeller, Matus Mihalak, Subhash Suri, Elias Vicari and Peter Widmayer.
Angle Optimization in Target Tracking

Miroslaw Kowaluk, Andrzej Lingas and Johannes Nowak.
A Path Cover Technique for LCAs in Dags

Davide Bilo, Hans-Joachim B?ckenhauer, Juraj Hromkovic, Richard Kralovic, Tobias M?mke, Peter Widmayer and Anna Zych.
Reoptimization of Steiner Trees

Alexander Golynski, Rajeev Raman and Srinivasa Rao Satti.
On the redundancy of succinct data structures

Magn?s M. Halld?rsson and Hadas Shachnai. 
Batch Coloring Flat Graphs and Thin

Louigi Addario-Berry, Omid Amini, Jean-Sebastien Sereni and Stephan Thomasse. 
Guarding Art Galleries: The Extra Cost for Sculptures is Linear

Tobias Christ, Michael Hoffmann, Yoshio Okamoto and Takeaki UNO.
Improved Bounds for Wireless Localization

Yakov Nekrich. 
Data Structures with Local Update Operations

Guy E. Blelloch, Daniel Golovin and Virginia Vassilevska.
Uniquely Represented Data Structures for Computational Geometry

Erik D. Demaine, Stefan Langerman and Eric Price.
Confluently Persistent Tries for Efficient Version Control