Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT'2008 (Gothenburg, Sweden, July 2-4, 2008)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

A survey of results for deletion channels and related synchronization channels
Michael Mitzenmacher
Lecture Notes in Computer Science 5124, 2008, pp. 1-3
Nash bargaining via flexible budget markets
Vijay V. Vazirani
Lecture Notes in Computer Science 5124, 2008, pp. 4-4
Simplified planar coresets for data streams
John Hershberger, Subhash Suri
Lecture Notes in Computer Science 5124, 2008, pp. 5-16
Uniquely represented data structures for computational geometry
Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska
Lecture Notes in Computer Science 5124, 2008, pp. 17-28
I/O efficient dynamic data structures for longest prefix queries
Moshe Hershcovitch, Haim Kaplan
Lecture Notes in Computer Science 5124, 2008, pp. 29-40
Guarding art galleries: The extra cost for sculptures is linear
Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
Lecture Notes in Computer Science 5124, 2008, pp. 41-52
Vision-based pursuit-evasion in a grid
Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Paweƚ Żyliński
Lecture Notes in Computer Science 5124, 2008, pp. 53-64
Angle optimization in target tracking
Beat Gfeller, Matús̑ Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Lecture Notes in Computer Science 5124, 2008, pp. 65-76
Improved bounds for wireless localization
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
Lecture Notes in Computer Science 5124, 2008, pp. 77-89
Bicriteria approximation tradeoff for the Node-Cost Budget Problem
Yuval Rabani, Gabriel Scalosub
Lecture Notes in Computer Science 5124, 2008, pp. 90-101
Integer maximum flow in wireless sensor networks with energy constraint
Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen
Lecture Notes in Computer Science 5124, 2008, pp. 102-113
The maximum energy-constrained dynamic flow problem
Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller
Lecture Notes in Computer Science 5124, 2008, pp. 114-126
Bounded unpopularity matchings
Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Lecture Notes in Computer Science 5124, 2008, pp. 127-137
Data structures with local update operations
Yakov Nekrich
Lecture Notes in Computer Science 5124, 2008, pp. 138-147
On the redundancy of succinct data structures
Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 5124, 2008, pp. 148-159
Confluently persistent tries for efficient version control
Erik D. Demaine, Stefan Langerman, Eric Price
Lecture Notes in Computer Science 5124, 2008, pp. 160-172
A uniform approach towards succinct representation of trees
Arash Farzan, J. Ian Munro
Lecture Notes in Computer Science 5124, 2008, pp. 173-184
An O(n^{1.75}) algorithm for L(2,1)-labeling of trees
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Lecture Notes in Computer Science 5124, 2008, pp. 185-197
Batch coloring flat graphs and thin
Magnús M. Halldórsson, Hadas Shachnai
Lecture Notes in Computer Science 5124, 2008, pp. 198-209
Approximating the interval constrained coloring problem
Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, Julián Mestre
Lecture Notes in Computer Science 5124, 2008, pp. 210-221
A path cover technique for LCAs in dags
Mirosƚaw Kowaluk, Andrzej Lingas, Johannes Nowak
Lecture Notes in Computer Science 5124, 2008, pp. 222-233
Boundary labeling with octilinear leaders
Michael A. Bekos, Micheal Kaufmann, Martin Nöllenburg, Antonios Symvonis
Lecture Notes in Computer Science 5124, 2008, pp. 234-245
Distributed disaster disclosure
Bernard Mans, Stefan Schmid, Roger Wattenhofer
Lecture Notes in Computer Science 5124, 2008, pp. 246-257
Reoptimization of Steiner trees
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Richard Královic̑, Tobias Mömke, Peter Widmayer, Anna Zych
Lecture Notes in Computer Science 5124, 2008, pp. 258-269
On the locality of extracting a 2-manifold in \mathbb{R}^3
Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljević
Lecture Notes in Computer Science 5124, 2008, pp. 270-281

Seiten 1 2 >