Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Series=LNCS AND YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A computational model for RNA multiple structural alignment
Eugene Davydov
,
Serafim Batzoglou
Lecture Notes in Computer Science
3109
, 2004, pp. 254-269
Computational design of new and recombinant selenoproteins
Rolf Backofen
,
Anke Busch
Lecture Notes in Computer Science
3109
, 2004, pp. 270-284
A combinatorial shape matching algorithm for rigid protein docking
Vicky Choi
,
Navin Goyal
Lecture Notes in Computer Science
3109
, 2004, pp. 285-296
New results for the 2-interval pattern problem
Guillaume Blin
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
3109
, 2004, pp. 311-322
Performing local similarity searches with variable length seeds
Miklós Csŭrös
Lecture Notes in Computer Science
3109
, 2004, pp. 373-387
Reversal distance without hurdles and fortresses
Anne Bergeron
,
Julia Mixtacki
,
Jens Stoye
Lecture Notes in Computer Science
3109
, 2004, pp. 388-399
A fast set intersection algorithm for sorted sequences
Ricardo Baeza-Yates
Lecture Notes in Computer Science
3109
, 2004, pp. 400-408
Faster two dimensional pattern matching with rotations
Amihood Amir
,
Oren Kapah
,
Dekel Tsur
Lecture Notes in Computer Science
3109
, 2004, pp. 409-419
Compressed index for a dynamic collection of texts
Ho-Leung Chan
,
Wing-Kai Hon
,
Tak-Wah Lam
Lecture Notes in Computer Science
3109
, 2004, pp. 445-456
External geometric data structures
Lars Arge
Lecture Notes in Computer Science
3106
, 2004, pp. 1-1
Progress on maximum weight triangulation
Francis Y.L. Chin
,
Jianbo Qian
,
Cao An Wang
Lecture Notes in Computer Science
3106
, 2004, pp. 53-61
Coloring octrees
Udo Adamy
,
Michael Hoffmann
,
József Solymosi
,
Milos̑ Stojaković
Lecture Notes in Computer Science
3106
, 2004, pp. 62-71
Q
-ary Ulam-Rényi game with weighted constrained lies
Ferdinando Cicalese
,
Christian Deppe
,
Daniele Mundici
Lecture Notes in Computer Science
3106
, 2004, pp. 82-91
Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study
Ying Du
,
Danny Z. Chen
,
Xiaodong Wu
Lecture Notes in Computer Science
3106
, 2004, pp. 112-121
On the arrangement of cliques in chordal graphs with respect to the cuts
L. Sunil Chandran
,
N.S. Narayanaswamy
Lecture Notes in Computer Science
3106
, 2004, pp. 151-160
New results on on-demand broadcasting with deadline via job scheduling with cancellation
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3106
, 2004, pp. 210-218
Maximization of the size and the weight of schedules of degradable intervals
Fabien Baille
,
Evripidis Bampis
,
Christian Laforest
Lecture Notes in Computer Science
3106
, 2004, pp. 219-228
Efficient algorithms for approximating a multi-dimensional voxel terrain by a unimodal terrain
Danny Z. Chen
,
Jinhee Chun
,
Naoki Katoh
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3106
, 2004, pp. 238-248
Algorithms for point set matching with
k
-differences
Tatsuya Akutsu
Lecture Notes in Computer Science
3106
, 2004, pp. 249-258
Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon
Hee-Kap Ahn
,
Peter Brass
,
Otfried Cheong
,
Hyeon-Suk Na
,
Chan-Su Shin
,
Antoine Vigneron
Lecture Notes in Computer Science
3106
, 2004, pp. 259-267
The Traveling Salesman Problem with few inner points
Vladimir G. Deĭneko
,
Michael Hoffmann
,
Yoshio Okamoto
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
3106
, 2004, pp. 268-277
Algorithms for the on-line quota Traveling Salesman Problem
Giorgio Ausiello
,
Marc Demange
,
Luigi Laura
,
Vangelis Paschos
Lecture Notes in Computer Science
3106
, 2004, pp. 290-299
New bounds on the number of edges in a
k
-map graph
Zhi-Zhong Chen
Lecture Notes in Computer Science
3106
, 2004, pp. 319-328
Positive non-interference in elementary and trace nets
Nadia Busi
,
Roberto Gorrieri
Lecture Notes in Computer Science
3099
, 2004, pp. 1-16
Reachability set generation for Petri nets: Can brute force be smart?
Gianfranco Ciardo
Lecture Notes in Computer Science
3099
, 2004, pp. 17-34
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>