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=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tile complexity of approximate squares
Harish Chandran
,
Nikhil Gopalkrishnan
,
John Reif
Algorithmica
66
(1), 2013, pp. 1-17
Approximate shortest paths avoiding a failed vertex: Near optimal data structures for undirected unweighted graphs
Surender Baswana
,
Neelesh Khanna
Algorithmica
66
(1), 2013, pp. 18-50
Engineering a new algorithm for distributed shortest paths on dynamic networks
Serafino Cicerone
,
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Vinicio Maurizio
Algorithmica
66
(1), 2013, pp. 51-86
Maximum matching in regular and almost regular graphs
Raphael Yuster
Algorithmica
66
(1), 2013, pp. 87-92
Isotonic regression via partitioning
Quentin F. Stout
Algorithmica
66
(1), 2013, pp. 93-112
Greedy
\Delta
-approximation algorithm for covering with arbitrary constraints and submodular cost
Christos Koufogiannakis
,
Neal E. Young
Algorithmica
66
(1), 2013, pp. 113-152
Negative interactions in irreversible self-assembly
David Doty
,
Lila Kari
,
Benoît Masson
Algorithmica
66
(1), 2013, pp. 153-172
Fast maximal cliques enumeration in sparse graphs
Lijun Chang
,
Jeffrey Xu Yu
,
Lu Qin
Algorithmica
66
(1), 2013, pp. 173-186
Donation center location problem
Chien-Chung Huang
,
Zoya Svitkina
Algorithmica
66
(1), 2013, pp. 187-210
A lower bound of
1+\varphi
for truthful scheduling mechanisms
Elias Koutsoupias
,
Angelina Vidali
Algorithmica
66
(1), 2013, pp. 211-223
On the largest empty axis-parallel box amidst
n
points
Adrian Dumitrescu
,
Minghui Jiang
Algorithmica
66
(2), 2013, pp. 225-248
Improved bounds for finger search on a RAM
Alexis Kaporis
,
Christos Makris
,
Spyros Sioutas
,
Athanasios Tsakalidis
,
Kostas Tsichlas
,
Christos Zaroliagis
Algorithmica
66
(2), 2013, pp. 249-286
List factoring and relative worst order analysis
Martin R. Ehmsen
,
Jens S. Kohrt
,
Kim S. Larsen
Algorithmica
66
(2), 2013, pp. 287-309
Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
Vladimir Pestov
Algorithmica
66
(2), 2013, pp. 310-328
Constructing the
\mbox R^{\ast}
consensus tree of two trees in subcubic time
Jesper Jansson
,
Wing-Kin Sung
Algorithmica
66
(2), 2013, pp. 329-345
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
Satoru Iwata
,
Mizuyo Takamatsu
Algorithmica
66
(2), 2013, pp. 346-368
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
Ching-Chi Lin
,
Gen-Huey Chen
,
Gerard J. Chang
Algorithmica
66
(2), 2013, pp. 369-396
Smoothed analysis of partitioning algorithms for Euclidean functionals
Markus Bläser
,
Bodo Manthey
,
B.V. Raghavendra Rao
Algorithmica
66
(2), 2013, pp. 397-418
Fast phylogeny reconstruction through learning of ancestral sequences
Radu Mihaescu
,
Cameron Hill
,
Satish Rao
Algorithmica
66
(2), 2013, pp. 419-449
PASS approximation: A framework for analyzing and designing heuristics
Uriel Feige
,
Nicole Immorlica
,
Vahab S. Mirrokni
,
Hamid Nazerzadeh
Algorithmica
66
(2), 2013, pp. 450-478
How to use spanning trees to navigate in graphs
Feodor F. Dragan
,
Yang Xiang
Algorithmica
66
(3), 2013, pp. 479-511
Efficient coordination mechanisms for unrelated machine scheduling
Ioannis Caragiannis
Algorithmica
66
(3), 2013, pp. 512-540
Recognizing
d
-interval graphs and
d
-track interval graphs
Minghui Jiang
Algorithmica
66
(3), 2013, pp. 541-563
Approximate guarding of monotone and rectilinear polygons
Erik A. Krohn
,
Bengt J. Nilsson
Algorithmica
66
(3), 2013, pp. 564-594
Median trajectories
Kevin Buchin
,
Maike Buchin
,
Marc van Kreveld
,
Maarten Löffler
,
Rodrigo I. Silveira
,
Carola Wenk
,
Lionov Wiratma
Algorithmica
66
(3), 2013, pp. 595-614
Seiten 1
2
>