default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th SWAT 2008: Gothenburg, Sweden
- Joachim Gudmundsson:
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
Invited Lectures
- Michael Mitzenmacher:
A Survey of Results for Deletion Channels and Related Synchronization Channels. 1-3 - Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets. 4
Contributed Papers
- John Hershberger, Subhash Suri:
Simplified Planar Coresets for Data Streams. 5-16 - Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry. 17-28 - Moshe Hershcovitch, Haim Kaplan:
I/O Efficient Dynamic Data Structures for Longest Prefix Queries. 29-40 - Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
:
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. 41-52 - Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. 53-64 - Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking. 65-76 - Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno:
Improved Bounds for Wireless Localization. 77-89 - Yuval Rabani, Gabriel Scalosub:
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem. 90-101 - 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 - Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem. 114-126 - Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre:
Bounded Unpopularity Matchings. 127-137 - Yakov Nekrich:
Data Structures with Local Update Operations. 138-147 - Alexander Golynski, Rajeev Raman, S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures. 148-159 - Erik D. Demaine, Stefan Langerman, Eric Price:
Confluently Persistent Tries for Efficient Version Control. 160-172 - Arash Farzan, J. Ian Munro:
A Uniform Approach Towards Succinct Representation of Trees. 173-184 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees. 185-197 - Magnús M. Halldórsson, Hadas Shachnai:
Batch Coloring Flat Graphs and Thin. 198-209 - Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre:
Approximating the Interval Constrained Coloring Problem. 210-221 - Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak:
A Path Cover Technique for LCAs in Dags. 222-233 - Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. 234-245 - Bernard Mans, Stefan Schmid, Roger Wattenhofer:
Distributed Disaster Disclosure. 246-257 - Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. 258-269 - Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
On the Locality of Extracting a 2-Manifold in . 270-281 - Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. 282-293 - Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. 294-305 - Rolf Harren, Rob van Stee:
Packing Rectangles into 2OPT Bins Using Rotations. 306-318 - Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. 319-330 - Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. 331-342 - Telikepalli Kavitha:
On a Special Co-cycle Basis of Graphs. 343-354 - 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 - Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of Additively Weighted Point Sets. 367-377 - Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
The Kinetic Facility Location Problem. 378-389 - Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. 390-401 - Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections. 402-413 - C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin:
Online Compression Caching. 414-425 - Ulrich Meyer:
On Trade-Offs in External-Memory Diameter-Approximation. 426-436
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-09 11:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
