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.
In-place algorithms for computing (layers of) maxima
Henrik Blunck
,
Jan Vahrenhold
Algorithmica
57
(1), 2010, pp. 1-21
Collective tree spanners in graphs with bounded parameters
Feodor F. Dragan
,
Chenyu Yan
Algorithmica
57
(1), 2010, pp. 22-43
Transactional contention management as a non-clairvoyant scheduling problem
Hagit Attiya
,
Leah Eppstein
,
Hadas Shachnai
,
Tami Tamir
Algorithmica
57
(1), 2010, pp. 44-61
A universal online caching algorithm based on pattern matching
Gopal Pandurangan
,
Wojciech Szpankowski
Algorithmica
57
(1), 2010, pp. 62-73
Deciding
k
-colorability of
P_5
-free graphs in polynomial time
Chính T. Hoàng
,
Marcin Kamiński
,
Vadim Lozin
,
Joe Sawada
,
Xiao Shu
Algorithmica
57
(1), 2010, pp. 74-81
Secure overlay network design
Li (Erran) Li
,
Mohammad Mahdian
,
Vahab S. Mirrokni
Algorithmica
57
(1), 2010, pp. 82-96
A top-down approach to search-trees: Improved algorithmics for 3-HITTING SET
Henning Fernau
Algorithmica
57
(1), 2010, pp. 97-118
Continuous lunches are free plus the design of optimal optimization algorithms
Anne Auger
,
Olivier Teytaud
Algorithmica
57
(1), 2010, pp. 121-146
Stability in the self-organized evolution of networks
Madeleine Theile
,
Thomas Jansen
Algorithmica
57
(1), 2010, pp. 147-169
Analysis of evolutionary algorithms for the longest common subsequence problem
Thomas Jansen
,
Dennis Weyland
Algorithmica
57
(1), 2010, pp. 170-186
Evolutionary algorithms and matroid optimization problems
Joachim Reichel
,
Martin Skutella
Algorithmica
57
(1), 2010, pp. 187-206
Computing median and antimedian sets in median graphs
Kannan Balakrishnan
,
Bos̑tjan Bres̑ar
,
Manoj Changat
,
Sandi Klavz̑ar
,
Matjaz̑ Kovs̑e
,
Ajitha R. Subhamathi
Algorithmica
57
(2), 2010, pp. 207-216
Design and analysis of online batching systems
Regant Y.S. Hung
,
Hing-Fung Ting
Algorithmica
57
(2), 2010, pp. 217-231
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
Mingen Lin
,
Yang Yang
,
Jinhui Xu
Algorithmica
57
(2), 2010, pp. 232-251
On the planar piecewise quadratic 1-center problem
J. Puerto
,
A.M. Rodríguez-Chía
,
A. Tamir
Algorithmica
57
(2), 2010, pp. 252-283
Aggregation of partial rankings,
p
-ratings and top-
m
lists
Nir Ailon
Algorithmica
57
(2), 2010, pp. 284-300
On the convergence of multicast games in directed networks
Angelo Fanelli
,
Michele Flammini
,
Luca Moscardelli
Algorithmica
57
(2), 2010, pp. 301-324
Approximating tree edit distance through string edit distance
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
Algorithmica
57
(2), 2010, pp. 325-348
Algorithms for data migration
E. Anderson
,
J. Hall
,
J. Hartline
,
M. Hobbes
,
A. Karlin
,
J. Saia
,
R. Swaminathan
,
J. Wilkes
Algorithmica
57
(2), 2010, pp. 349-380
Planar polyline drawings via graph transformations
Huaming Zhang
Algorithmica
57
(2), 2010, pp. 381-397
Fixed-parameter approximation: Conceptual framework and approximability results
Liming Cai
,
Xiuzhen Huang
Algorithmica
57
(2), 2010, pp. 398-412
New approximation bounds for LPT scheduling
Annamária Kovács
Algorithmica
57
(2), 2010, pp. 413-433
Boundary labeling with octilinear leaders
Michael A. Bekos
,
Michael Kaufmann
,
Martin Nöllenburg
,
Antonios Symvonis
Algorithmica
57
(3), 2010, pp. 436-461
Confluently persistent tries for efficient version control
Erik D. Demaine
,
Stefan Langerman
,
Eric Price
Algorithmica
57
(3), 2010, pp. 462-483
On metric clustering to minimize the sum of radii
Matt Gibson
,
Gaurav Kanade
,
Erik Krohn
,
Imran A. Pirwani
,
Kasturi Varadarajan
Algorithmica
57
(3), 2010, pp. 484-498
Seiten 1
2
>