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 YEAR=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
Yong Zhang
,
Francis Y.L. Chin
,
Hong Zhu
Algorithmica
54
(4), 2009, pp. 557-567
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
Seiten
<
1
2
3
4
>