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=J. Algorithms AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Amin Coja-Oghlan
,
Sven O. Krumke
,
Till Nierhoff
Journal of Algorithms
61
(1), 2006, pp. 1-19
Improved bounds for the unsplittable flow problem
Petr Kolman
,
Christian Scheideler
Journal of Algorithms
61
(1), 2006, pp. 20-44
Reconstructing noisy polynomial evaluation in residue rings
Simon R. Blackburn
,
Domingo Gomez-Perez
,
Jaime Gutierrez
,
Igor E. Shparlinski
Journal of Algorithms
61
(2), 2006, pp. 47-59
Distance and routing labeling schemes for non-positively curved plane graphs
Victor Chepoi
,
Feodor F. Dragan
,
Yann Vaxès
Journal of Algorithms
61
(2), 2006, pp. 60-88
The RPR
^2
rounding technique for semidefinite programs
Uriel Feige
,
Michael Langberg
Journal of Algorithms
60
(1), 2006, pp. 1-23
Graph minimum linear arrangement by multilevel weighted edge contractions
Ilya Safro
,
Dorit Ron
,
Achi Brandt
Journal of Algorithms
60
(1), 2006, pp. 24-41
The load rebalancing problem
Gagan Aggarwal
,
Rajeev Motwani
,
An Zhu
Journal of Algorithms
60
(1), 2006, pp. 42-59
Scheduling policies for CIOQswitches
Alex Kesselman
,
Adi Rosén
Journal of Algorithms
60
(1), 2006, pp. 60-83
Space efficient algorithms for directed series-parallel graphs
Andreas Jakoby
,
Maciej Liśkiewicz
,
Rüdiger Reischuk
Journal of Algorithms
60
(2), 2006, pp. 85-114
Broadcasting algorithms in radio networks with unknown topology
Artur Czumaj
,
Wojciech Rytter
Journal of Algorithms
60
(2), 2006, pp. 115-143
Algorithms for non-uniform size data placement on parallel disks
Srinivas Kashyap
,
Samir Khuller
Journal of Algorithms
60
(2), 2006, pp. 144-167
Approximations for minimum and min-max vehicle routing problems
Esther M. Arkin
,
Refael Hassin
,
Asaf Levin
Journal of Algorithms
59
(1), 2006, pp. 1-18
Maintaining time-decaying stream aggregates
Edith Cohen
,
Martin J. Strauss
Journal of Algorithms
59
(1), 2006, pp. 19-36
A linear time approximation scheme for the single machine scheduling problem with controllable processing times
Monaldo Mastrolilli
Journal of Algorithms
59
(1), 2006, pp. 37-52
Semi-matchings for bipartite graphs and load balancing
Nicholas J.A. Harvey
,
Richard E. Ladner
,
László Lovász
,
Tami Tamir
Journal of Algorithms
59
(1), 2006, pp. 53-78
On generalized gossiping and broadcasting
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun (Justin) Wan
Journal of Algorithms
59
(2), 2006, pp. 81-106
Efficient algorithms for a constrained
k
-tree core problem in a tree network
Biing-Feng Wang
,
Shietung Peng
,
Hong-Yi Yu
,
Shan-Chyun Ku
Journal of Algorithms
59
(2), 2006, pp. 107-124
Computing bounded-degree phylogenetic roots of disconnected graphs
Zhi-Zhong Chen
,
Tatsuie Tsukiji
Journal of Algorithms
59
(2), 2006, pp. 125-148
An algorithmic sign-reversing involution for special rim-hook tableaux
Bruce E. Sagan
,
Jaejin Lee
Journal of Algorithms
59
(2), 2006, pp. 149-161
On finding approximate optimal paths in weighted regions
Zheng Sun
,
John H. Reif
Journal of Algorithms
58
(1), 2006, pp. 1-32
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Anne Berry
,
Jean-Paul Bordat
,
Pinar Heggernes
,
Geneviève Simonet
,
Yngve Villanger
Journal of Algorithms
58
(1), 2006, pp. 33-66
Polynomial time recognition of unit circular-arc graphs
Guillermo Durán
,
Agustín Gravano
,
Ross M. McConnell
,
Jeremy Spinrad
,
Alan Tucker
Journal of Algorithms
58
(1), 2006, pp. 67-78
Partial alphabetic trees
Arye Barkan
,
Haim Kaplan
Journal of Algorithms
58
(2), 2006, pp. 81-103
External selection
Jop F. Sibeyn
Journal of Algorithms
58
(2), 2006, pp. 104-117
A new kind of graph coloring
Igor E. Zverovich
Journal of Algorithms
58
(2), 2006, pp. 118-133
Seiten 1
2
>