Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4168

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

Path hitting in acyclic graphs
Ojas Parekh, Danny Segev
Lecture Notes in Computer Science 4168, 2006, pp. 564-575
Minimum transversals in Posi-modular systems
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
Lecture Notes in Computer Science 4168, 2006, pp. 576-587
An LP-designed algorithm for constraint satisfaction
Alexander D. Scott, Gregory B. Sorkin
Lecture Notes in Computer Science 4168, 2006, pp. 588-599
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev, Gil Segev
Lecture Notes in Computer Science 4168, 2006, pp. 600-611
Balancing applied to maximum network flow problems
Robert Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao
Lecture Notes in Computer Science 4168, 2006, pp. 612-623
Out-of-order event processing in kinetic data structures
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
Lecture Notes in Computer Science 4168, 2006, pp. 624-635
Kinetic algorithms via self-adjusting computation
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
Lecture Notes in Computer Science 4168, 2006, pp. 636-647
Parallel machine scheduling through column generation: Minimax objective functions
J.M. van den Akker, J.A. Hoogeveen, J.W. van Kempen
Lecture Notes in Computer Science 4168, 2006, pp. 648-659
Reporting flock patterns
Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle
Lecture Notes in Computer Science 4168, 2006, pp. 660-671
On exact algorithms for treewidth
Hans L. Bodlaender, Fedor V. Fomin, Arie M.C.A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
Lecture Notes in Computer Science 4168, 2006, pp. 672-683
An improved construction for counting Bloom filters
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
Lecture Notes in Computer Science 4168, 2006, pp. 684-695
An MINLP solution method for a water network problem
Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
Lecture Notes in Computer Science 4168, 2006, pp. 696-707
Skewed binary search trees
Gerth Stlting Brodal, Gabriel Moruz
Lecture Notes in Computer Science 4168, 2006, pp. 708-719
Algorithmic aspects of proportional symbol maps
S. Cabello, H. Haverkort, M. van Kreveld, B. Speckmann
Lecture Notes in Computer Science 4168, 2006, pp. 720-731
Does path cleaning help in dynamic all-pairs shortest paths?
C. Demetrescu, P. Faruolo, G.F. Italiano, M. Thorup
Lecture Notes in Computer Science 4168, 2006, pp. 732-743
Multiline addressing by network flow
Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
Lecture Notes in Computer Science 4168, 2006, pp. 744-755
The engineering of a compression boosting library: Theory vs. practice in BWT compression
Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
Lecture Notes in Computer Science 4168, 2006, pp. 756-767
The price of resiliency: A case study on sorting with memory faults
Umberto Ferraro-Petrillo, Irene Finocchi, Giuseppe F. Italiano
Lecture Notes in Computer Science 4168, 2006, pp. 768-779
How branch mispredictions affect Quicksort
Kanela Kaligosi, Peter Sanders
Lecture Notes in Computer Science 4168, 2006, pp. 780-791
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces
Michal Meyerovitch
Lecture Notes in Computer Science 4168, 2006, pp. 792-803
Engineering highway hierarchies
Peter Sanders, Dominik Schultes
Lecture Notes in Computer Science 4168, 2006, pp. 804-816
Univariate polynomial real root isolation: Continued fractions revisited
Elias P. Tsigaridas, Ioannis Z. Emiris
Lecture Notes in Computer Science 4168, 2006, pp. 817-828
Exact and efficient construction of planar Minkowski sums using the convolution method
Ron Wein
Lecture Notes in Computer Science 4168, 2006, pp. 829-840

Seiten < 1 2 3