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=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Labeling schemes for tree representation
Reuven Cohen
,
Pierre Fraigniaud
,
David Ilcinkas
,
Amos Korman
,
David Peleg
Algorithmica
53
(1), 2009, pp. 1-15
Consistent sets of secondary structures in proteins
Piotr Berman
,
Jieun Jeong
Algorithmica
53
(1), 2009, pp. 16-34
Algorithms for maximum independent set in convex bipartite graphs
José Soares
,
Marco A. Stefanes
Algorithmica
53
(1), 2009, pp. 35-49
Cache-oblivious R-trees
Lars Arge
,
Mark de Berg
,
Herman Haverkort
Algorithmica
53
(1), 2009, pp. 50-68
Approximation algorithms for multi-criteria Traveling Salesman Problems
Bodo Manthey
,
L. Shankar Ram
Algorithmica
53
(1), 2009, pp. 69-88
Approximating buy-at-bulk and shallow-light
k
-Steiner trees
Mohammad Taghi Hajiaghayi
,
Guy Kortsarz
,
Mohammad R. Salavatipour
Algorithmica
53
(1), 2009, pp. 89-103
Non-cooperative tree creation
Martin Hoefer
Algorithmica
53
(1), 2009, pp. 104-131
Stackelberg strategies for selfish routing in general multicommodity networks
George Karakostas
,
Stavros G. Kolliopoulos
Algorithmica
53
(1), 2009, pp. 132-153
A PTAS for cutting out polygons with lines
Sergey Bereg
,
Ovidiu Daescu
,
Minghui Jiang
Algorithmica
53
(2), 2009, pp. 157-171
On dynamic bin packing: An improved lower bound and resource augmentation analysis
Joseph Wun-Tat Chan
,
Prudence W.H. Wong
,
Fencol C.C. Yung
Algorithmica
53
(2), 2009, pp. 172-206
A detachment algorithm for inferring a graph from path frequency
Hiroshi Nagamochi
Algorithmica
53
(2), 2009, pp. 207-224
Edge pricing of multicommodity networks for selfish users with elastic demands
George Karakostas
,
Stavros G. Kolliopoulos
Algorithmica
53
(2), 2009, pp. 225-249
A simplicial approach for discrete fixed point theorems
Xi Chen
,
Xiaotie Deng
Algorithmica
53
(2), 2009, pp. 250-262
Approximation algorithms for soft-capacitated facility location in capacitated network design
Xujin Chen
,
Bo Chen
Algorithmica
53
(3), 2009, pp. 263-297
Fast algorithms for the density finding problem
D.T. Lee
,
Tien-Ching Lin
,
Hsueh-I Lu
Algorithmica
53
(3), 2009, pp. 298-313
Real two dimensional scaled matching
Amihood Amir
,
Ayelet Butman
,
Moshe Lewenstein
,
Ely Porat
Algorithmica
53
(3), 2009, pp. 314-336
Approximability of minimum AND-circuits
Jan Arpe
,
Bodo Manthey
Algorithmica
53
(3), 2009, pp. 337-357
Nondeterministic graph searching: From pathwidth to treewidth
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
Algorithmica
53
(3), 2009, pp. 358-373
Sorting networks of logarithmic depth, further simplified
Joel Seiferas
Algorithmica
53
(3), 2009, pp. 374-384
Variable sized online interval coloring with bandwidth
Leah Epstein
,
Thomas Erlebach
,
Asaf Levin
Algorithmica
53
(3), 2009, pp. 385-401
Minimum weakly fundamental cycle bases are hard to find
Romeo Rizzi
Algorithmica
53
(3), 2009, pp. 402-424
An approximation algorithm and dynamic programming for reduction in heterogeneous environments
Pangfeng Liu
,
May-Chen Kuo
,
Da-Wei Wang
Algorithmica
53
(3), 2009, pp. 425-453
Kinetic collision detection for convex fat objects
Mohammad Ali Abam
,
Mark de Berg
,
Sheung-Hung Poon
,
Bettina Speckmann
Algorithmica
53
(4), 2009, pp. 457-473
Dynamic connectivity for axis-parallel rectangles
Peyman Afshani
,
Timothy M. Chan
Algorithmica
53
(4), 2009, pp. 474-487
Single machine precedence constrained scheduling is avertex cover problem
Christoph Ambühl
,
Monaldo Mastrolilli
Algorithmica
53
(4), 2009, pp. 488-503
Seiten 1
2
>