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 Volume=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalization of a suffix tree for RNA structural pattern matching
Tetsuo Shibuya
Algorithmica
39
(1), 2004, pp. 1-19
A general model for authenticated data structures
Charles Martel
,
Glen Nuckolls
,
Premkumar Devanbu
,
Michael Gertz
,
April Kwong
,
Stuart G. Stubblebine
Algorithmica
39
(1), 2004, pp. 21-41
Approximation schemes for scheduling on uniformly related and identical parallel machines
Leah Epstein
,
Jiȓí Sgall
Algorithmica
39
(1), 2004, pp. 43-57
Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme
Klaus Jansen
Algorithmica
39
(1), 2004, pp. 59-81
Algorithms for computing the
QR
decomposition of a set of matrices with common columns
Petko Yanev
,
Paolo Foschi
,
Erricos John Kontoghiorghes
Algorithmica
39
(1), 2004, pp. 83-93
Algorithms for
P_4
-comparability graph recognition and acyclic
P_4
-transitive orientation
Stavros D. Nikolopoulos
,
Leonidas Palios
Algorithmica
39
(2), 2004, pp. 95-126
Movement planning in the presence of flows
John H. Reif
,
Zheng Sun
Algorithmica
39
(2), 2004, pp. 127-153
Minimizing makespan in batch machine scheduling
Chung Keung Poon
,
Pixing Zhang
Algorithmica
39
(2), 2004, pp. 155-174
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
Esther M. Arkin
,
Refael Hassin
,
Shlomi Rubinstein
,
Maxim Sviridenko
Algorithmica
39
(2), 2004, pp. 175-187
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Ravindra K. Ahuja
,
Dorit S. Hochbaum
,
James B. Orlin
Algorithmica
39
(3), 2004, pp. 189-208
Simple on-line algorithms for the maximum disjoint paths problem
Petr Kolman
,
Christian Scheideler
Algorithmica
39
(3), 2004, pp. 209-233
Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
David R. Wood
Algorithmica
39
(3), 2004, pp. 235-253
Solving systems of difference constraints incrementally with bidirectional search
Jianjun Zhou
,
Martin Müller
Algorithmica
39
(3), 2004, pp. 255-274
Three-dimensional layers of maxima
Adam L. Buchsbaum
,
Michael T. Goodrich
Algorithmica
39
(4), 2004, pp. 275-286
Maximum cardinality search for computing minimal triangulations of graphs
Anne Berry
,
Jean R.S. Blair
,
Pinar Heggernes
,
Barry W. Peyton
Algorithmica
39
(4), 2004, pp. 287-298
Online and offline algorithms for the time-dependent TSP with time zones
Björn Brodén
,
Mikael Hammar
,
Bengt J. Nilsson
Algorithmica
39
(4), 2004, pp. 299-319
Automated generation of search tree algorithms for hard graph modification problems
Jens Gramm
,
Jiong Guo
,
Falk Hüffner
,
Rolf Niedermeier
Algorithmica
39
(4), 2004, pp. 321-347