Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3341

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

Puzzles, art, and magic with algorithms
Erik D. Demaine
Lecture Notes in Computer Science 3341, 2004, pp. 1-1
The ABCs of AVDs: Geometric retrieval made simple
David M. Mount
Lecture Notes in Computer Science 3341, 2004, pp. 2-2
Pareto optimality in house allocation problems
David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
Lecture Notes in Computer Science 3341, 2004, pp. 3-15
Property-preserving data reconstruction
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
Lecture Notes in Computer Science 3341, 2004, pp. 16-27
On the monotone circuit complexity of quadratic Boolean functions
Kazuyuki Amano, Akira Maruoka
Lecture Notes in Computer Science 3341, 2004, pp. 28-40
Generalized function matching
Amihood Amir, Igor Nor
Lecture Notes in Computer Science 3341, 2004, pp. 41-52
Approximate distance oracles for graphs with dense clusters
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Lecture Notes in Computer Science 3341, 2004, pp. 53-64
Multicriteria global minimum cuts
Amitai Armon, Uri Zwick
Lecture Notes in Computer Science 3341, 2004, pp. 65-76
Polyline fitting of planar points under min-sum criteria
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
Lecture Notes in Computer Science 3341, 2004, pp. 77-88
A generalization of magic squares with applications to digital halftoning
Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
Lecture Notes in Computer Science 3341, 2004, pp. 89-100
Voronoi diagrams with a transportation network on the Euclidean plane
Sang Won Bae, Kyung-Yong Chwa
Lecture Notes in Computer Science 3341, 2004, pp. 101-112
Structural alignment of two RNA sequences with Lagrangian relaxation
Markus Bauer, Gunnar W. Klau
Lecture Notes in Computer Science 3341, 2004, pp. 113-123
Poly-APX- and PTAS-completeness in standard and differential approximation
Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
Lecture Notes in Computer Science 3341, 2004, pp. 124-136
Efficient algorithms for k maximum sums
Fredrik Bengtsson, Jingsen Chen
Lecture Notes in Computer Science 3341, 2004, pp. 137-148
Equipartitions of measures by 2-fans
Sergey Bereg
Lecture Notes in Computer Science 3341, 2004, pp. 149-158
Augmenting the edge-connectivity of a spider tree
Davide Bilò, Guido Proietti
Lecture Notes in Computer Science 3341, 2004, pp. 159-171
On Nash equilibria for multicast transmissions in ad-hoc wireless networks
Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
Lecture Notes in Computer Science 3341, 2004, pp. 172-183
Structural similarity in graphs - A relaxation approach for role assignment
Ulrik Brandes, Jürgen Lerner
Lecture Notes in Computer Science 3341, 2004, pp. 184-195
Flexibility of Steiner trees in uniform orientation metrics
Marcus Brazil, Pawel Winter, Martin Zachariasen
Lecture Notes in Computer Science 3341, 2004, pp. 196-208
Random access to advice strings and collapsing results
Jin-Yi Cai, Osamu Watanabe
Lecture Notes in Computer Science 3341, 2004, pp. 209-220
Bounding the payment of approximate truthful mechanisms
Gruia Calinescu
Lecture Notes in Computer Science 3341, 2004, pp. 221-233
The polymatroid Steiner problems
Gruia Calinescu, Alexander Zelikovsky
Lecture Notes in Computer Science 3341, 2004, pp. 234-245
Geometric optimization problems over sliding windows
Timothy M. Chan, Bashir S. Sadjad
Lecture Notes in Computer Science 3341, 2004, pp. 246-258
On-line windows scheduling of temporary items
Wun-Tat Chan, Prudence W.H. Wong
Lecture Notes in Computer Science 3341, 2004, pp. 259-270
Generalized geometric approaches for leaf sequencing problems in radiation therapy
Danny Z. Chen, Xiaobo S. Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu
Lecture Notes in Computer Science 3341, 2004, pp. 271-281

Seiten 1 2 3 4 >