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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum dispersion and geometric maximum weight cliques
Sándor P. Fekete
,
Henk Meijer
Algorithmica
38
(3), 2004, pp. 501-511
Minimizing mean completion time in a batch processing system
Xiaotie Deng
,
Haodi Feng
,
Pixing Zhang
,
Yuzhong Zhang
,
Hong Zhu
Algorithmica
38
(4), 2004, pp. 513-528
Minimum
k
arborescences with bandwidth constraints
Mao-cheng Cai
,
Xiaotie Deng
,
Lusheng Wang
Algorithmica
38
(4), 2004, pp. 529-537
Disk embeddings of planar graphs
Zhi-Zhong Chen
,
Xin He
Algorithmica
38
(4), 2004, pp. 539-576
Computing a
(1+\epsilon)
-approximate geometric minimum-diameter spanning tree
Michael J. Spriggs
,
J. Mark Keil
,
Sergei Bespamyatnikh
,
Michael Segal
,
Jack Snoeyink
Algorithmica
38
(4), 2004, pp. 577-589
Erratum to ''Dynamical sources in information theory: Fundamental intervals and word prefixes''
Fréderic Chazal
,
Véronique Maume-Deschamps
,
Brigitte Vallée
Algorithmica
38
(4), 2004, pp. 591-596
Algorithms for minimizing response time in broadcast scheduling
Rajiv Gandhi
,
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun (Justin) Wan
Algorithmica
38
(4), 2004, pp. 597-608
Seiten
<
1
2