Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1284

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

Scheduling independent multiprocessor tasks
A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis
Lecture Notes in Computer Science 1284, 1997, pp. 1-12
On local search for weighted k-set packing
Esther M. Arkin, Refael Hassin
Lecture Notes in Computer Science 1284, 1997, pp. 13-22
On-line machine covering
Yossi Azar, Leah Epstein
Lecture Notes in Computer Science 1284, 1997, pp. 23-36
Area-efficient static and incremental graph drawings
Therese C. Biedl, Michael Kaufmann
Lecture Notes in Computer Science 1284, 1997, pp. 37-52
Denesting by bounded degree radicals
Johannes Blömer
Lecture Notes in Computer Science 1284, 1997, pp. 53-63
A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
Ulrik Brandes, Dorothea Wagner
Lecture Notes in Computer Science 1284, 1997, pp. 64-77
Distance approximating trees for chordal and dually chordal graphs
Andreas Brandstädt, Victor Chepoi, Feodor Dragan
Lecture Notes in Computer Science 1284, 1997, pp. 78-91
Decomposition of integer programs and of generating sets
G. Cornuejols, R. Urbaniak, R. Weismantel, L. Wolsey
Lecture Notes in Computer Science 1284, 1997, pp. 92-103
Bounded degree spanning trees
Artur Czumaj, Willy-B. Strothmann
Lecture Notes in Computer Science 1284, 1997, pp. 104-117
Optimal adaptive broadcasting with a bounded fraction of faulty nodes
Krzysztof Diks, Andrzej Pelc
Lecture Notes in Computer Science 1284, 1997, pp. 118-129
Weighted graph separators and their applications
Hristo N. Djidjev
Lecture Notes in Computer Science 1284, 1997, pp. 130-143
A new exact algorithm for general orthogonal D-dimensional knapsack problems
Sándor P. Fekete, Jörg Schepers
Lecture Notes in Computer Science 1284, 1997, pp. 144-156
Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann
Lecture Notes in Computer Science 1284, 1997, pp. 157-170
Solving rectilinear Steiner tree problems exactly in theory and practice
Ulrich Föss̈meier, Michael Kaufmann
Lecture Notes in Computer Science 1284, 1997, pp. 171-185
Dynamically switching vertices in planar graphs
Daniele Frigioni, Giuseppe F. Italiano
Lecture Notes in Computer Science 1284, 1997, pp. 186-199
A new family of randomized algorithms for list accessing
Theodoulos Garefalakis
Lecture Notes in Computer Science 1284, 1997, pp. 200-216
On-line construction of two-dimensional suffix trees
Raffaele Giancarlo, Daniela Guaiana
Lecture Notes in Computer Science 1284, 1997, pp. 217-231
Scheduling multiclass queuing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule
Kevin D. Glazebrook, José Niño-Mora
Lecture Notes in Computer Science 1284, 1997, pp. 232-245
Optimal reconstruction of graphs under the additive model
Vladimir Grebinski, Gregory Kucherov
Lecture Notes in Computer Science 1284, 1997, pp. 246-258
Fixing variables in semidefinite relaxations
Christoph Helmberg
Lecture Notes in Computer Science 1284, 1997, pp. 259-270
Test sets of the knapsack problem and simultaneous diophantine approximation
Martin Henk, Robert Weismantel
Lecture Notes in Computer Science 1284, 1997, pp. 271-283
Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
Kazuo Iwama, Eiji Miyano
Lecture Notes in Computer Science 1284, 1997, pp. 284-295
Fault-tolerant real-time scheduling
Bala Kalyanasundaram, Kirk Pruhs
Lecture Notes in Computer Science 1284, 1997, pp. 296-307
Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead
Dmitry Kogan, Assaf Schuster
Lecture Notes in Computer Science 1284, 1997, pp. 308-325
Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems
Madhukar R. Korupolu, Vijaya Ramachandran
Lecture Notes in Computer Science 1284, 1997, pp. 326-340

Seiten 1 2 >