11. SWAT 2008:
Gothenburg,
Sweden
Joachim Gudmundsson (Ed.):
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings.
Lecture Notes in Computer Science 5124 Springer 2008, ISBN 978-3-540-69900-2 BibTeX
Invited Lectures
Contributed Papers
- John Hershberger, Subhash Suri:
Simplified Planar Coresets for Data Streams.
5-16
Electronic Edition (link) BibTeX
- Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry.
17-28
Electronic Edition (link) BibTeX
- Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries.
29-40
Electronic Edition (link) BibTeX
- Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé:
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
41-52
Electronic Edition (link) BibTeX
- Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid.
53-64
Electronic Edition (link) BibTeX
- Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking.
65-76
Electronic Edition (link) BibTeX
- Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno:
Improved Bounds for Wireless Localization.
77-89
Electronic Edition (link) BibTeX
- Yuval Rabani, Gabriel Scalosub:
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem.
90-101
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen:
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.
102-113
Electronic Edition (link) BibTeX
- Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem.
114-126
Electronic Edition (link) BibTeX
- Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings.
127-137
Electronic Edition (link) BibTeX
- Yakov Nekrich:
Data Structures with Local Update Operations.
138-147
Electronic Edition (link) BibTeX
- Alexander Golynski, Rajeev Raman, S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures.
148-159
Electronic Edition (link) BibTeX
- Erik D. Demaine, Stefan Langerman, Eric Price:
Confluently Persistent Tries for Efficient Version Control.
160-172
Electronic Edition (link) BibTeX
- Arash Farzan, J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees.
173-184
Electronic Edition (link) BibTeX
- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees.
185-197
Electronic Edition (link) BibTeX
- Magnús M. Halldórsson, Hadas Shachnai:
Batch Coloring Flat Graphs and Thin.
198-209
Electronic Edition (link) BibTeX
- Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre:
Approximating the Interval Constrained Coloring Problem.
210-221
Electronic Edition (link) BibTeX
- Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak:
A Path Cover Technique for LCAs in Dags.
222-233
Electronic Edition (link) BibTeX
- Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders.
234-245
Electronic Edition (link) BibTeX
- Bernard Mans, Stefan Schmid, Roger Wattenhofer:
Distributed Disaster Disclosure.
246-257
Electronic Edition (link) BibTeX
- Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees.
258-269
Electronic Edition (link) BibTeX
- Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
On the Locality of Extracting a 2-Manifold in .
270-281
Electronic Edition (link) BibTeX
- Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii.
282-293
Electronic Edition (link) BibTeX
- Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado.
294-305
Electronic Edition (link) BibTeX
- Rolf Harren, Rob van Stee:
Packing Rectangles into 2OPT Bins Using Rotations.
306-318
Electronic Edition (link) BibTeX
- Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.
319-330
Electronic Edition (link) BibTeX
- Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.
331-342
Electronic Edition (link) BibTeX
- Telikepalli Kavitha:
On a Special Co-cycle Basis of Graphs.
343-354
Electronic Edition (link) BibTeX
- Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.
355-366
Electronic Edition (link) BibTeX
- Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of Additively Weighted Point Sets.
367-377
Electronic Edition (link) BibTeX
- Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
The Kinetic Facility Location Problem.
378-389
Electronic Edition (link) BibTeX
- Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time.
390-401
Electronic Edition (link) BibTeX
- Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections.
402-413
Electronic Edition (link) BibTeX
- C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin:
Online Compression Caching.
414-425
Electronic Edition (link) BibTeX
- Ulrich Meyer:
On Trade-Offs in External-Memory Diameter-Approximation.
426-436
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:43:19 2009
by Michael Ley (ley@uni-trier.de)
