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
Hilfe
Suche: Series=LNCS AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tiling an interval of the discrete line
Olivier Bodini
,
Eric Rivals
Lecture Notes in Computer Science
4009
, 2006, pp. 117-128
Common substrings in random strings
Eric Blais
,
Mathieu Blanchette
Lecture Notes in Computer Science
4009
, 2006, pp. 129-140
An improved algorithm for the macro-evolutionary phylogeny problem
Behshad Behzadi
,
Martin Vingron
Lecture Notes in Computer Science
4009
, 2006, pp. 177-187
Property matching and weighted matching
Amihood Amir
,
Eran Chencinski
,
Costas Iliopoulos
,
Tsvi Kopelowitz
,
Hui Zhang
Lecture Notes in Computer Science
4009
, 2006, pp. 188-199
Faster two dimensional scaled matching
Amihood Amir
,
Eran Chencinski
Lecture Notes in Computer Science
4009
, 2006, pp. 200-210
Local alignment of RNA sequences with arbitrary scoring schemes
Rolf Backofen
,
Danny Hermelin
,
Gad M. Landau
,
Oren Weimann
Lecture Notes in Computer Science
4009
, 2006, pp. 246-257
Reducing the space requirement of LZ-index
Diego Arroyuelo
,
Gonzalo Navarro
,
Kunihiko Sadakane
Lecture Notes in Computer Science
4009
, 2006, pp. 318-329
Faster algorithms for computing longest common increasing subsequences
Gerth Stlting Brodal
,
Kanela Kaligosi
,
Irit Katriel
,
Martin Kutz
Lecture Notes in Computer Science
4009
, 2006, pp. 330-341
Approximate matching in weighted sequences
Amihood Amir
,
Costas Iliopoulos
,
Oren Kapah
,
Ely Porat
Lecture Notes in Computer Science
4009
, 2006, pp. 365-376
Efficient algorithms for regular expression constrained sequence alignment
Yun-Sheng Chung
,
Chin Lung Lu
,
Chuan Yi Tang
Lecture Notes in Computer Science
4009
, 2006, pp. 389-400
In-place randomized slope selection
Henrik Blunck
,
Jan Vahrenhold
Lecture Notes in Computer Science
3998
, 2006, pp. 30-41
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
Evgeny Dantsin
,
Edward A. Hirsch
,
Alexander Wolpert
Lecture Notes in Computer Science
3998
, 2006, pp. 60-68
Gathering algorithms on paths under interference constraints
Jean-Claude Bermond
,
Ricardo Corrêa
,
Minli Yu
Lecture Notes in Computer Science
3998
, 2006, pp. 115-126
Black hole search in asynchronous rings using tokens
S. Dobrev
,
R. Královic̑
,
N. Santoro
,
W. Shi
Lecture Notes in Computer Science
3998
, 2006, pp. 139-150
Fair cost-sharing methods for scheduling jobs on parallel machines
Yvonne Bleischwitz
,
Burkhard Monien
Lecture Notes in Computer Science
3998
, 2006, pp. 175-186
Inapproximability results for orthogonal rectangle packing problems with rotations
Miroslav Chlebík
,
Janka Chlebíková
Lecture Notes in Computer Science
3998
, 2006, pp. 199-210
On the minimum common integer partition problem
Xin Chen
,
Lan Liu
,
Zheng Liu
,
Tao Jiang
Lecture Notes in Computer Science
3998
, 2006, pp. 236-247
Matching subsequences in trees
Philip Bille
,
Inge Li Grtz
Lecture Notes in Computer Science
3998
, 2006, pp. 248-259
Distance approximating trees: Complexity and algorithms
Feodor F. Dragan
,
Chenyu Yan
Lecture Notes in Computer Science
3998
, 2006, pp. 260-271
How to pack directed acyclic graphs into small blocks
Yuichi Asahiro
,
Tetsuya Furukawa
,
Keiichi Ikegami
,
Eiji Miyano
Lecture Notes in Computer Science
3998
, 2006, pp. 272-283
On-line coloring of
H
-free bipartite graphs
H.J. Broersma
,
A. Capponi
,
D. Paulusma
Lecture Notes in Computer Science
3998
, 2006, pp. 284-295
Distributed approximation algorithms for planar graphs
Andrzej Czygrinow
,
Michaƚ Hańćkowiak
,
Edyta Szymańska
Lecture Notes in Computer Science
3998
, 2006, pp. 296-307
Fixed-parameter tractability results for feedback set problems in tournaments
Michael Dom
,
Jiong Guo
,
Falk Hüffner
,
Rolf Niedermeier
,
Anke Truß
Lecture Notes in Computer Science
3998
, 2006, pp. 320-331
Fixed-parameter tractable generalizations of cluster editing
Peter Damaschke
Lecture Notes in Computer Science
3998
, 2006, pp. 344-355
Amortized rigidness in dynamic Cartesian trees
Iwona Bialynicka-Birula
,
Roberto Grossi
Lecture Notes in Computer Science
3884
, 2006, pp. 80-91
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>