Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3608

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

Towards a theory of algorithms
Allan Borodin
Lecture Notes in Computer Science 3608, 2005, pp. 1-1
k-restricted rotation with an application to search tree rebalancing
Alejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriquez, Linda Pagli
Lecture Notes in Computer Science 3608, 2005, pp. 2-13
Heap building bounds
Zhentao Li, Bruce A. Reed
Lecture Notes in Computer Science 3608, 2005, pp. 14-23
The multi-radius cover problem
Refael Hassin, Danny Segev
Lecture Notes in Computer Science 3608, 2005, pp. 24-35
Parameterized complexity of generalized vertex cover problems
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
Lecture Notes in Computer Science 3608, 2005, pp. 36-48
The complexity of implicit and space efficient priority queues
Christian W. Mortensen, Seth Pettie
Lecture Notes in Computer Science 3608, 2005, pp. 49-60
Analysis of a class of tries with adaptive multi-digitbranching
Yuriy A. Reznik
Lecture Notes in Computer Science 3608, 2005, pp. 61-72
Balanced aspect ratio trees revisited
Amitabh Chaudhary, Michael T. Goodrich
Lecture Notes in Computer Science 3608, 2005, pp. 73-85
Improved combinatorial group testing for real-world problem sizes
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
Lecture Notes in Computer Science 3608, 2005, pp. 86-98
Parameterized counting algorithms for general graph covering problems
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Lecture Notes in Computer Science 3608, 2005, pp. 99-109
Approximating the online set multicover problems via randomized winnowing
Piotr Berman, Bhaskar DasGupta
Lecture Notes in Computer Science 3608, 2005, pp. 110-121
Max-stretch reduction for tree spanners
Kazuo Iwama, Andrzej Lingas, Masaki Okita
Lecture Notes in Computer Science 3608, 2005, pp. 122-133
Succinct representation of triangulations with a boundary
Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
Lecture Notes in Computer Science 3608, 2005, pp. 134-145
Line-segment intersection made in-place
Jan Vahrenhold
Lecture Notes in Computer Science 3608, 2005, pp. 146-157
Improved fixed-parameter algorithms for two feedback set problems
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
Lecture Notes in Computer Science 3608, 2005, pp. 158-168
Communication-aware processor allocation for supercomputers
Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
Lecture Notes in Computer Science 3608, 2005, pp. 169-181
Dynamic hotlinks
Karim Douïeb, Stefan Langerman
Lecture Notes in Computer Science 3608, 2005, pp. 182-194
The minimum-area spanning tree problem
Paz Carmi, Matthew J. Katz, Joseph S.B. Mitchell
Lecture Notes in Computer Science 3608, 2005, pp. 195-204
Hinged dissection of polypolyhedra
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
Lecture Notes in Computer Science 3608, 2005, pp. 205-217
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Shlomo Moran, Sagi Snir
Lecture Notes in Computer Science 3608, 2005, pp. 218-232
Linear time algorithms for generalized edge dominating set problems
André Berger, Ojas Parekh
Lecture Notes in Computer Science 3608, 2005, pp. 233-243
On geometric dilation and halving chords
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
Lecture Notes in Computer Science 3608, 2005, pp. 244-255
Orthogonal subdivisions with low stabbing numbers
Csaba D. Tóth
Lecture Notes in Computer Science 3608, 2005, pp. 256-268
Kinetic and dynamic data structures for convex hulls and upper envelopes
Giora Alexandron, Haim Kaplan, Micha Sharir
Lecture Notes in Computer Science 3608, 2005, pp. 269-281
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Victor Chepoi, Bertrand Estellon, Yann Vaxès
Lecture Notes in Computer Science 3608, 2005, pp. 282-293

Seiten 1 2 >