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=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved bounds for wireless localization
Tobias Christ
,
Michael Hoffmann
,
Yoshio Okamoto
,
Takeaki Uno
Algorithmica
57
(3), 2010, pp. 499-516
A preemptive algorithm for maximizing disjoint paths on trees
Yossi Azar
,
Uriel Feige
,
Daniel Glasner
Algorithmica
57
(3), 2010, pp. 517-537
On covering problems of Rado
Sergey Bereg
,
Adrian Dumitrescu
,
Minghui Jiang
Algorithmica
57
(3), 2010, pp. 538-561
Kinetic facility location
Bastian Degener
,
Joachim Gehweiler
,
Christiane Lammersen
Algorithmica
57
(3), 2010, pp. 562-584
On sorting, heaps, and minimum spanning trees
Gonzalo Navarro
,
Rodrigo Paredes
Algorithmica
57
(4), 2010, pp. 585-620
Homogeneous string segmentation using trees and weighted independent sets
Peter Damaschke
Algorithmica
57
(4), 2010, pp. 621-640
Constructing labeling schemes through universal matrices
Amos Korman
,
David Peleg
,
Yoav Rodeh
Algorithmica
57
(4), 2010, pp. 641-652
Well supported approximate equilibria in bimatrix games
Spyros C. Kontogiannis
,
Paul G. Spirakis
Algorithmica
57
(4), 2010, pp. 653-667
Approximate shortest paths guided by a small index
Jörg Derungs
,
Riko Jacob
,
Peter Widmayer
Algorithmica
57
(4), 2010, pp. 668-688
Complexity results for throughput and latency optimization of replicated and data-parallel workflows
Anne Benoit
,
Yves Robert
Algorithmica
57
(4), 2010, pp. 689-724
An experimental study of new and known online packet buffering algorithms
Susanne Albers
,
Tobias Jacobs
Algorithmica
57
(4), 2010, pp. 725-746
Chordal deletion is fixed-parameter tractable
Dániel Marx
Algorithmica
57
(4), 2010, pp. 747-768
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Hans Kellerer
,
Vitaly A. Strusevich
Algorithmica
57
(4), 2010, pp. 769-795
Drawing colored graphs with constrained vertex positions and few bends per edge
Emilio Di Giacomo
,
Giuseppe Liotta
,
Francesco Trotta
Algorithmica
57
(4), 2010, pp. 796-818
Scheduling jobs on grid processors
Joan Boyar
,
Lene M. Favrholdt
Algorithmica
57
(4), 2010, pp. 819-847
Broadcasting on networks of workstations
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun Justin Wan
Algorithmica
57
(4), 2010, pp. 848-868
The Steiner ratio conjecture of Gilbert-Pollak may still be open
N. Innami
,
B.H. Kim
,
Y. Mashiko
,
K. Shiohama
Algorithmica
57
(4), 2010, pp. 869-872
Pricing for fairness: Distributed resource allocation for multiple objectives
Sung-woo Cho
,
Ashish Goel
Algorithmica
57
(4), 2010, pp. 873-892
Seiten
<
1
2