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: Journal=Algorithmica AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On two class-constrained versions of the multiple knapsack problem
H. Shachnai
,
T. Tamir
Algorithmica
29
(3), 2001, pp. 442-467
A randomized algorithm for approximate string matching
M.J. Atallah
,
F. Chyzak
,
P. Dumas
Algorithmica
29
(3), 2001, pp. 468-486
Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
J.H. Reif
Algorithmica
29
(3), 2001, pp. 487-510
Simple algorithms for multimessage multicasting with forwarding
T.F. Gonzalez
Algorithmica
29
(4), 2001, pp. 511-533
Parallel algorithms for series parallel graphs and graphs with treewidth two
H.L. Bodlaender
,
B. van Antwerpen-de Fluiter
Algorithmica
29
(4), 2001, pp. 534-559
Algorithms for the on-line Travelling Salesman
G. Ausiello
,
E. Feuerstein
,
S. Leonardi
,
L. Stougie
,
M. Talamo
Algorithmica
29
(4), 2001, pp. 560-581
Equivalence of
\varepsilon
-approximate separation and optimization in fixed dimensions
S.N. Kabadi
,
Y.P. Aneja
Algorithmica
29
(4), 2001, pp. 582-594
Efficient algorithms for integer programs with two variables per constraint
R. Bar-Yehuda
,
D. Rawitz
Algorithmica
29
(4), 2001, pp. 595-609
Reactive local search for the maximum clique problem
R. Battiti
,
M. Protasi
Algorithmica
29
(4), 2001, pp. 610-637
Steiner minimal trees with one polygonal obstacle
J.F. Weng
,
J. MacGregor Smith
Algorithmica
29
(4), 2001, pp. 638-648
Seiten
<
1
2
3
4