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=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the competitive ratio for online facility location
Dimitris Fotakis
Algorithmica
50
(1), 2008, pp. 1-57
An optimal algorithm for the minimum disc cover problem
Min-Te Sun
,
Chih-Wei Yi
,
Chuan-Kai Yang
,
Ten-Hwang Lai
Algorithmica
50
(1), 2008, pp. 58-71
Average case analysis of bounded space bin packing algorithms
Nir Naaman
,
Raphael Rom
Algorithmica
50
(1), 2008, pp. 72-97
Cost-sharing mechanisms for network design
Anupam Gupta
,
Aravind Srinivasan
,
Éva Tardos
Algorithmica
50
(1), 2008, pp. 98-119
Symbolic graphs: Linear solutions to connectivity related problems
Raffaella Gentilini
,
Carla Piazza
,
Alberto Policriti
Algorithmica
50
(1), 2008, pp. 120-158
On enumerating minimal dicuts and strongly connected subgraphs
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Algorithmica
50
(1), 2008, pp. 159-172
Introduction to special issue
Frank Dehne
,
Jörg-Rüdiger Sack
Algorithmica
50
(2), 2008, pp. 173-174
Improved approximation bounds for planar point pattern matching
Minkyoung Cho
,
David M. Mount
Algorithmica
50
(2), 2008, pp. 175-207
Dynamic hotlinks
Karim Douïeb
,
Stefan Langerman
Algorithmica
50
(2), 2008, pp. 208-222
Max-stretch reduction for tree spanners
Kazuo Iwama
,
Andrzej Lingas
,
Masaki Okita
Algorithmica
50
(2), 2008, pp. 223-235
All-pairs shortest paths with real weights in
O(n^3 /\log n)
time
Timothy M. Chan
Algorithmica
50
(2), 2008, pp. 236-243
Linear time algorithms for generalized edge dominating set problems
André Berger
,
Ojas Parekh
Algorithmica
50
(2), 2008, pp. 244-254
Optimally adaptive integration of univariate Lipschitz functions
Ilya Baran
,
Erik D. Demaine
,
Dmitriy A. Katz
Algorithmica
50
(2), 2008, pp. 255-278
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
Michael A. Bender
,
David P. Bunde
,
Erik D. Demaine
,
Sándor P. Fekete
,
Vitus J. Leung
,
Henk Meijer
,
Cynthia A. Phillips
Algorithmica
50
(2), 2008, pp. 279-298
The swap edges of a multiple-sources routing tree
Bang Ye Wu
,
Chih-Yuan Hsiao
,
Kun-Mao Chao
Algorithmica
50
(3), 2008, pp. 299-311
Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
Patchrawat ``Patch'' Uthaisombut
Algorithmica
50
(3), 2008, pp. 312-328
On the stability of dynamic diffusion load balancing
Petra Berenbrink
,
Tom Friedetzky
,
Russell Martin
Algorithmica
50
(3), 2008, pp. 329-350
New linear-time algorithms for edge-coloring planar graphs
Richard Cole
,
Łukasz Kowalik
Algorithmica
50
(3), 2008, pp. 351-368
From constrained to unconstrained maximum agreement subtree in linear time
V. Berry
,
Z.S. Peng
,
H.F. Ting
Algorithmica
50
(3), 2008, pp. 369-385
Delineating boundaries for imprecise regions
Iris Reinbacher
,
Marc Benkert
,
Marc van Kreveld
,
Joseph S.B. Mitchell
,
Jack Snoeyink
,
Alexander Wolff
Algorithmica
50
(3), 2008, pp. 386-414
Random bichromatic matchings
Nayantara Bhatnagar
,
Dana Randall
,
Vijay V. Vazirani
,
Eric Vigoda
Algorithmica
50
(4), 2008, pp. 418-445
Eliminating cycles in the discrete torus
Béla Bollobás
,
Guy Kindler
,
Imre Leader
,
Ryan O'Donnell
Algorithmica
50
(4), 2008, pp. 446-454
Incremental medians via online bidding
Marek Chrobak
,
Claire Kenyon
,
John Noga
,
Neal E. Young
Algorithmica
50
(4), 2008, pp. 455-478
Algorithms for modular counting of roots of multivariate polynomials
Parikshit Gopalan
,
Venkatesan Guruswami
,
Richard J. Lipton
Algorithmica
50
(4), 2008, pp. 479-496
Gaussian laws for the main parameters of the Euclid algorithms
Loïck Lhote
,
Brigitte Vallée
Algorithmica
50
(4), 2008, pp. 497-554
Seiten 1
2
>