Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=2004

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

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
An efficient exact algorithm for the minimum ultrametric tree problem
Hsin-Fu Chen, Maw-Shang Chang
Lecture Notes in Computer Science 3341, 2004, pp. 282-293
On the range maximum-sum segment query problem
Kuan-Yu Chen, Kun-Mao Chao
Lecture Notes in Computer Science 3341, 2004, pp. 294-305
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
Xujin Chen, Wenan Zang
Lecture Notes in Computer Science 3341, 2004, pp. 306-317
Efficient job scheduling algorithms with multi-type contentions
Zhenming Chen, Vikas Singh, Jinhui Xu
Lecture Notes in Computer Science 3341, 2004, pp. 318-329
Superimposing Voronoi complexes for shape deformation
Chao Chen, Ho-Lun Cheng
Lecture Notes in Computer Science 3341, 2004, pp. 330-341
On partial lifting and the elliptic curve discrete logarithm problem
Qi Cheng, Ming-Deh Huang
Lecture Notes in Computer Science 3341, 2004, pp. 342-351
Guarding art galleries by guarding witnesses
Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
Lecture Notes in Computer Science 3341, 2004, pp. 352-363
On p-norm based locality measures of space-filling curves
H.K. Dai, H.C. Su
Lecture Notes in Computer Science 3341, 2004, pp. 364-376
Composability of infinite-state activity automata
Zhe Dang, Oscar H. Ibarra, Jianwen Su
Lecture Notes in Computer Science 3341, 2004, pp. 377-388
Error compensation in leaf root problems
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Lecture Notes in Computer Science 3341, 2004, pp. 389-401
On compact and efficient routing in certain graph classes
Feodor F. Dragan, Irina Lomonosov
Lecture Notes in Computer Science 3341, 2004, pp. 402-414
Randomized insertion and deletion in point quad trees
Amalia Duch
Lecture Notes in Computer Science 3341, 2004, pp. 415-426
Cutting out polygons with lines and rays
Ovidiu Daescu, Jun Luo
Lecture Notes in Computer Science 3341, 2004, pp. 669-680

Seiten < 1 2 3 4 5 6 7 8 9 10 11 12 >