Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1851

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

Dynamic graph algorithms with applications
Mikkel Thorup, David R. Karger
Lecture Notes in Computer Science 1851, 2000, pp. 1-9
Coping with the NP-hardness of the graph bandwidth problem
Uriel Feige
Lecture Notes in Computer Science 1851, 2000, pp. 10-19
Toward complete genome data mining in computational biology
Esko Ukkonen
Lecture Notes in Computer Science 1851, 2000, pp. 20-21
A new trade-off for deterministic dictionaries
Rasmus Pagh
Lecture Notes in Computer Science 1851, 2000, pp. 22-31
Improved upper bounds for pairing heaps
John Iacono
Lecture Notes in Computer Science 1851, 2000, pp. 32-45
Maintaining center and median in dynamic trees
Stephen Alstrup, Jacob Holm, Mikkel Thorup
Lecture Notes in Computer Science 1851, 2000, pp. 46-56
Dynamic planar convex hull with optimal query time and O(\log n \cdot \log \log n) update time
Gerth Stlting Brodal, Riko Jacob
Lecture Notes in Computer Science 1851, 2000, pp. 57-70
A dynamic algorithm for maintaining graph partitions
Lyudmil G. Aleksandrov, Hristo N. Djidjev
Lecture Notes in Computer Science 1851, 2000, pp. 71-82
Data structures for maintaining set partitions
Michael A. Bender, Saurabh Sethia, Steven Skiena
Lecture Notes in Computer Science 1851, 2000, pp. 83-96
Fixed parameter algorithms for PLANAR DOMINATING SET and related problems
Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
Lecture Notes in Computer Science 1851, 2000, pp. 97-110
Embeddings of k-connected graphs of pathwidth k
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
Lecture Notes in Computer Science 1851, 2000, pp. 111-124
On graph powers for leaf-labeled trees
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Lecture Notes in Computer Science 1851, 2000, pp. 125-138
Recognizing weakly triangulated graphs by edge separability
Anne Berry, Jean-Paul Bordat, Pinar Heggernes
Lecture Notes in Computer Science 1851, 2000, pp. 139-149
Caching for web searching
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard Woeginger
Lecture Notes in Computer Science 1851, 2000, pp. 150-163
On-line scheduling with precedence constraints
Yossi Azar, Leah Epstein
Lecture Notes in Computer Science 1851, 2000, pp. 164-174
Scheduling jobs before shut-down
Vincenzo Liberatore
Lecture Notes in Computer Science 1851, 2000, pp. 175-188
Resource augmentation in load balancing
Yossi Azar, Leah Epstein, Rob van Stee
Lecture Notes in Computer Science 1851, 2000, pp. 189-199
Fair versus Unrestricted Bin Packing
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Lecture Notes in Computer Science 1851, 2000, pp. 200-213
A d/2 approximation for maximum weight independent set in d-claw free graphs
Piotr Berman
Lecture Notes in Computer Science 1851, 2000, pp. 214-219
Approximation algorithms for the Label-Cover_{MAX} and Red-Blue Set Cover problems
David Peleg
Lecture Notes in Computer Science 1851, 2000, pp. 220-230
Approximation algorithms for Maximum Linear Arrangement
Refael Hassin, Shlomi Rubinstein
Lecture Notes in Computer Science 1851, 2000, pp. 231-236
Approximation algorithms for clustering to minimize the sum of diameters
Srinivas R. Doddi, Madhav V. Marathe, S.S. Ravi, David Scot Taylor, Peter Widmayer
Lecture Notes in Computer Science 1851, 2000, pp. 237-250
Robust matchings and maximum clustering
Refael Hassin, Shlomi Rubinstein
Lecture Notes in Computer Science 1851, 2000, pp. 251-258
The hospitals/residents problem with ties
Robert W. Irving, David Manlove, Sandy Scott
Lecture Notes in Computer Science 1851, 2000, pp. 259-271
Incremental maintenance of the 5-edge-connectivity classes of a graph
Yefim Dinitz, Ronit Nossenson
Lecture Notes in Computer Science 1851, 2000, pp. 272-285

Seiten 1 2 >