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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Why neighbor-joining works
Radu Mihaescu
,
Dan Levy
,
Lior Pachter
Algorithmica
54
(1), 2009, pp. 1-24
Small area drawings of outerplanar graphs
Giuseppe Di Battista
,
Fabrizio Frati
Algorithmica
54
(1), 2009, pp. 25-53
Combinatorial algorithms for data migration to minimize average completion time
Rajiv Gandhi
,
Julián Mestre
Algorithmica
54
(1), 2009, pp. 54-71
Casting an object with a core
Hee-Kap Ahn
,
Sang Won Bae
,
Siu-Wing Cheng
,
Kkyung-Yong Chwa
Algorithmica
54
(1), 2009, pp. 72-88
Resource allocation in bounded degree trees
Reuven Bar-Yehuda
,
Michael Beder
,
Yuval Cohen
,
Dror Rawitz
Algorithmica
54
(1), 2009, pp. 89-106
On locating disjoint segments with maximum sum of densities
Hsiao-Fei Liu
,
Kun-Mao Chao
Algorithmica
54
(1), 2009, pp. 107-117
Many-to-many communication in radio networks
Bogdan S. Chlebus
,
Dariusz R. Kowalski
,
Tomasz Radzik
Algorithmica
54
(1), 2009, pp. 118-139
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Ken-ichi Kawarabayashi
Algorithmica
54
(2), 2009, pp. 142-180
On two techniques of combining branching and treewidth
Fedor V. Fomin
,
Serge Gaspers
,
Saket Saurabh
,
Alexey A. Stepanov
Algorithmica
54
(2), 2009, pp. 181-207
Efficient Prüfer-like coding and counting labelled hypertrees
Saswara Shannigrahi
,
Sudebkumar Prasant Pal
Algorithmica
54
(2), 2009, pp. 208-225
Faster deterministic communication in radio networks
Ferdinando Cicalese
,
Fredrik Manne
,
Qin Xin
Algorithmica
54
(2), 2009, pp. 226-242
Runtime analysis of a simple Ant Colony Optimization algorithm
Frank Neumann
,
Carsten Witt
Algorithmica
54
(2), 2009, pp. 243-255
Negation-limited complexity of parity and inverters
Kazuo Iwama
,
Hiroki Morizuma
,
Jun Tarui
Algorithmica
54
(2), 2009, pp. 256-267
Models of greedy algorithms for graph problems
Sashka Davis
,
Russell Impagliazzo
Algorithmica
54
(3), 2009, pp. 269-317
Minimum-cost load-balancing partitions
Boris Aronov
,
Paz Carmi
,
Matthew J. Katz
Algorithmica
54
(3), 2009, pp. 318-336
Optimal external memory planar point enclosure
Lars Arge
,
Vasilis Samoladas
,
Ke Yi
Algorithmica
54
(3), 2009, pp. 337-352
Smallest bipartite bridge-connectivity augmentation
Pei-Chi Huang
,
Hsin-Wen Wei
,
Wan-Chen Lu
,
Wei-Kuan Shih
,
Tsan-sheng Hsu
Algorithmica
54
(3), 2009, pp. 353-378
Speeding up HMM decoding and training by exploiting sequence repetitions
Yury Lifshits
,
Shay Mozes
,
Oren Weimann
,
Michal Ziv-Ukelson
Algorithmica
54
(3), 2009, pp. 379-399
A note on multiflows and treewidth
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
Algorithmica
54
(3), 2009, pp. 400-412
I/O-efficient algorithms for graphs of bounded treewidth
Anil Maheshwari
,
Norbert Zeh
Algorithmica
54
(3), 2009, pp. 413-469
Improved parameterized set splitting algorithms: A probabilistic approach
Jianer Chen
,
Songiian Lu
Algorithmica
54
(4), 2009, pp. 472-489
An improved algorithm for online unit clustering
Hamid Zarrabi-Zadeh
,
Timothy M. Chan
Algorithmica
54
(4), 2009, pp. 490-500
Approximation algorithms for reconstructing the duplication history of tandem repeats
Zhi-Zhong Chen
,
Lusheng Wang
,
Zhanyong Wang
Algorithmica
54
(4), 2009, pp. 501-529
On counting 3-D matchings of size
k
Yunlong Liu
,
Jianer Chen
,
Jianxin Wang
Algorithmica
54
(4), 2009, pp. 530-543
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
Noga Alon
,
Shai Gutner
Algorithmica
54
(4), 2009, pp. 544-556
Seiten 1
2
>