Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Series=LNCS AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Recognizing weakly triangulated graphs by edge separability
Anne Berry
,
Jean-Paul Bordat
,
Pinar Heggernes
Lecture Notes in Computer Science
1851
, 2000, pp. 139-149
On-line scheduling with precedence constraints
Yossi Azar
,
Leah Epstein
Lecture Notes in Computer Science
1851
, 2000, pp. 164-174
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 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
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
Locating sources to meet flow demands in undirected networks
Kouji Arata
,
Satoru Iwata
,
Kazuhisa Makino
,
Satoru Fujishige
Lecture Notes in Computer Science
1851
, 2000, pp. 300-313
Computing the penetration depth of two convex polytopes in 3D
Pankaj K. Agarwal
,
Leonidas J. Guibas
,
Sariel Har-Peled
,
Alexander Rabinovitch
,
Micha Sharir
Lecture Notes in Computer Science
1851
, 2000, pp. 328-338
Efficient expected-case algorithms for planar point location
Sunil Arya
,
Siu-Wing Cheng
,
David M. Mount
,
H. Ramesh
Lecture Notes in Computer Science
1851
, 2000, pp. 353-366
On external-memory MST, SSSP, and multi-way planar graph separation
Lars Arge
,
Gerth Stlting Brodal
,
Laura Toma
Lecture Notes in Computer Science
1851
, 2000, pp. 433-447
I/O-space trade-offs
Lars Arge
,
Jakob Pagter
Lecture Notes in Computer Science
1851
, 2000, pp. 448-461
On the complexities of the optimal rounding problems of sequences and matrices
Tetsuo Asano
,
Tomomi Matsui
,
Takeshi Tokuyama
Lecture Notes in Computer Science
1851
, 2000, pp. 476-489
On the complexity of the sub-permutation problem
Shlomo Ahal
,
Yuri Rabinovich
Lecture Notes in Computer Science
1851
, 2000, pp. 490-503
Parallel attribute-efficient learning of monotone Boolean functions
Peter Damaschke
Lecture Notes in Computer Science
1851
, 2000, pp. 504-512
Optimal adaptive fault diagnosis of hypercubes
Andreas Björklund
Lecture Notes in Computer Science
1851
, 2000, pp. 527-534
Least adaptive optimal search with unreliable tests
Ferdinando Cicalese
,
Daniele Mundici
,
Ugo Vaccaro
Lecture Notes in Computer Science
1851
, 2000, pp. 549-562
Identifying and filtering near-duplicate documents
Andrei Z. Broder
Lecture Notes in Computer Science
1848
, 2000, pp. 1-10
Algorithmic aspects of speech recognition: A synopsis
Adam L. Buchsbaum
,
Raffaele Giancarlo
Lecture Notes in Computer Science
1848
, 2000, pp. 27-32
Parametric multiple sequence alignment and phylogeny construction
David Fernández-Baca
,
Timo Seppäläinen
,
Giora Slutzki
Lecture Notes in Computer Science
1848
, 2000, pp. 69-83
Approximating the maximum isomorphic agreement subtree is hard
Paola Bonizzoni
,
Gianluca Della Vedova
,
Giancarlo Mauri
Lecture Notes in Computer Science
1848
, 2000, pp. 119-128
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>