Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3111

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

Design and analysis of dynamic multithreaded algorithms
Charles E. Leiserson
Lecture Notes in Computer Science 3111, 2004, pp. 1-2
Cache-oblivious algorithms and data structures
Gerth Stlting Brodal
Lecture Notes in Computer Science 3111, 2004, pp. 3-13
Getting the best response for your erg
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard Woeginger
Lecture Notes in Computer Science 3111, 2004, pp. 14-25
Auctions with budget constraints
Nir Andelman, Yishay Mansour
Lecture Notes in Computer Science 3111, 2004, pp. 26-38
Tight approximability results for test set problems in bioinformatics
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
Lecture Notes in Computer Science 3111, 2004, pp. 39-50
Robust subgraphs for trees and paths
Refael Hassin, Danny Segev
Lecture Notes in Computer Science 3111, 2004, pp. 51-63
Collective tree spanners of graphs
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
Lecture Notes in Computer Science 3111, 2004, pp. 64-76
Optimally competitive list batching
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Lecture Notes in Computer Science 3111, 2004, pp. 77-89
The relative worst order ratio applied to seat reservation
Joan Boyar, Paul Medvedev
Lecture Notes in Computer Science 3111, 2004, pp. 90-101
Online maintenance of k-medians and k-covers on a line
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
Lecture Notes in Computer Science 3111, 2004, pp. 102-113
Matching polyhedral terrains using overlays of envelopes
Vladlen Koltun, Carola Wenk
Lecture Notes in Computer Science 3111, 2004, pp. 114-126
Independent set of intersection graphs of convex objects in 2D
Pankaj K. Agarwal, Nabil H. Mustafa
Lecture Notes in Computer Science 3111, 2004, pp. 127-137
Maximizing the area of overlap of two unions of disks under rigid motion
Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
Lecture Notes in Computer Science 3111, 2004, pp. 138-149
Construction of the nearest neighbor embracing graph of a point set
M.Y. Chan, Danny Chen, Francis Y.L. Chin, Cao An Wang
Lecture Notes in Computer Science 3111, 2004, pp. 150-160
Connectivity of graphs under edge flips
Norbert Zeh
Lecture Notes in Computer Science 3111, 2004, pp. 161-173
Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexity
Miroslav Chlebík, Janka Chlebíková
Lecture Notes in Computer Science 3111, 2004, pp. 174-186
A simple linear-time modular decomposition algorithm for graphs, using order extension
Michel Habib, Fabien de Montgolfier, Christophe Paul
Lecture Notes in Computer Science 3111, 2004, pp. 187-198
Railway delay management: Exploring its algorithmic complexity
Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer
Lecture Notes in Computer Science 3111, 2004, pp. 199-211
Layered heaps
Amr Elmasry
Lecture Notes in Computer Science 3111, 2004, pp. 212-222
Melding priority queues
Ran Mendelson, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Lecture Notes in Computer Science 3111, 2004, pp. 223-235
An algorithm for cyclic edge connectivity of cubic graphs
Zdenȇk Dvoȓák, Jan Kára, Daniel Král', Ondȓej Pangrác
Lecture Notes in Computer Science 3111, 2004, pp. 236-247
Subexponential-time framework for optimal embeddings of graphs in integer lattices
Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
Lecture Notes in Computer Science 3111, 2004, pp. 248-259
New algorithms for enumerating all maximal cliques
Kazuhisa Makino, Takeaki Uno
Lecture Notes in Computer Science 3111, 2004, pp. 260-272
The multi-multiway cut problem
Adi Avidor, Michael Langberg
Lecture Notes in Computer Science 3111, 2004, pp. 273-284
The bottleneck problem with minimum quantity commitments
Andrew Lim, Zhou Xu
Lecture Notes in Computer Science 3111, 2004, pp. 285-297

Seiten 1 2 >