Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3998

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

Reliable and efficient geometric computing
Kurt Mehlhorn
Lecture Notes in Computer Science 3998, 2006, pp. 1-2
Beware of the model: Reflections on algorithmic research
Franco P. Preparata
Lecture Notes in Computer Science 3998, 2006, pp. 3-4
On search problems in complexity theory and in logic
Pavel Pudlák
Lecture Notes in Computer Science 3998, 2006, pp. 5-5
Covering a set of points with a minimum number of lines
Magdalene Grantson, Christos Levcopoulos
Lecture Notes in Computer Science 3998, 2006, pp. 6-17
Approximation algorithms for capacitated rectangle stabbing
Guy Even, Dror Rawitz, Shimon (Moni) Shahar
Lecture Notes in Computer Science 3998, 2006, pp. 18-29
In-place randomized slope selection
Henrik Blunck, Jan Vahrenhold
Lecture Notes in Computer Science 3998, 2006, pp. 30-41
Quadratic programming and combinatorial minimum weight product problems
Walter Kern, Gerhard Woeginger
Lecture Notes in Computer Science 3998, 2006, pp. 42-49
Counting all solutions of minimum weight exact satisfiability
Stefan Porschen
Lecture Notes in Computer Science 3998, 2006, pp. 50-59
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
Lecture Notes in Computer Science 3998, 2006, pp. 60-68
Network discovery and verification with distance queries
Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús̑ Mihal̆ák
Lecture Notes in Computer Science 3998, 2006, pp. 69-80
Deciding the FIFO stability of networks in polynomial time
Maik Weinard
Lecture Notes in Computer Science 3998, 2006, pp. 81-92
Heterogenous networks can be unstable at arbitrarily low injection rates
Dimitrios Koukopoulos, Stavros D. Nikolopoulos
Lecture Notes in Computer Science 3998, 2006, pp. 93-104
Provisioning a virtual private network under the presence of non-communicating groups
Friedrich Eisenbrand, Edda Happ
Lecture Notes in Computer Science 3998, 2006, pp. 105-114
Gathering algorithms on paths under interference constraints
Jean-Claude Bermond, Ricardo Corrêa, Minli Yu
Lecture Notes in Computer Science 3998, 2006, pp. 115-126
On the hardness of range assignment problems
Bernhard Fuchs
Lecture Notes in Computer Science 3998, 2006, pp. 127-138
Black hole search in asynchronous rings using tokens
S. Dobrev, R. Královic̑, N. Santoro, W. Shi
Lecture Notes in Computer Science 3998, 2006, pp. 139-150
On broadcast scheduling with limited energy
Christian Gunia
Lecture Notes in Computer Science 3998, 2006, pp. 151-162
A near optimal scheduler for on-demand data broadcasts
Hing-Fung Ting
Lecture Notes in Computer Science 3998, 2006, pp. 163-174
Fair cost-sharing methods for scheduling jobs on parallel machines
Yvonne Bleischwitz, Burkhard Monien
Lecture Notes in Computer Science 3998, 2006, pp. 175-186
Tighter approximation bounds for LPT scheduling in two special cases
Annamária Kovács
Lecture Notes in Computer Science 3998, 2006, pp. 187-198
Inapproximability results for orthogonal rectangle packing problems with rotations
Miroslav Chlebík, Janka Chlebíková
Lecture Notes in Computer Science 3998, 2006, pp. 199-210
Approximate hierarchical facility location and applications to the shallow Steiner tree and range assignment problems
Erez Kantor, David Peleg
Lecture Notes in Computer Science 3998, 2006, pp. 211-222
An approximation algorithm for a bottleneck Traveling Salesman Problem
Ming-Yang Kao, Manan Sanghi
Lecture Notes in Computer Science 3998, 2006, pp. 223-235
On the minimum common integer partition problem
Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
Lecture Notes in Computer Science 3998, 2006, pp. 236-247
Matching subsequences in trees
Philip Bille, Inge Li Grtz
Lecture Notes in Computer Science 3998, 2006, pp. 248-259

Seiten 1 2 >