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=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Largest and smallest convex hulls for imprecise points
Maarten Löffler
,
M. van Kreveld
Algorithmica
56
(2), 2010, pp. 235-269
On the longest common rigid subsequence problem
Nikhil Bansal
,
Moshe Lewenstein
,
Bin Ma
,
Kaizhong Zhang
Algorithmica
56
(2), 2010, pp. 270-280
Recent advances in computation and combinatorial optimization
Xiaodong Hu
,
Jie Wang
Algorithmica
56
(3), 2010, pp. 281-282
A practical exact algorithm for the individual haplotyping problem MEC/GI
Jianxin Wang
,
Minzhu Xie
,
Jianer Chen
Algorithmica
56
(3), 2010, pp. 283-296
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Li-Pu Yeh
,
Biing-Feng Wang
,
Hsin-Hao Su
Algorithmica
56
(3), 2010, pp. 297-312
Structural identifiability in low-rank matrix factorization
Epameinondas Fritzilas
,
Martin Milanic̑
,
S. Rahmann
,
Yasmin A. Rios-Solis
Algorithmica
56
(3), 2010, pp. 313-332
A better constant-factor approximation for selected-internal Steiner minimum tree
Xianyue Li
,
Feng Zou
,
Yaochun Huang
,
Donghyun Kim
,
Weili Wu
Algorithmica
56
(3), 2010, pp. 333-341
Resource bounded frequency computations with three errors
Ulrich Hertrampf
,
Christoph Minnameier
Algorithmica
56
(3), 2010, pp. 342-363
Quantum separation of local search and fixed point computation
Xi Chen
,
Xiamoming Sun
,
Shang-Hua Teng
Algorithmica
56
(3), 2010, pp. 364-382
On independent vertex sets in subclasses of apple-free graphs
Andreas Brandstädt
,
Tilo Klembt
,
Vadim V. Lozin
,
Raffaele Mosca
Algorithmica
56
(4), 2010, pp. 383-393
A faster algorithm for computing the principal sequence of partitions of a graph
Vladimir Kolmogorov
Algorithmica
56
(4), 2010, pp. 394-412
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
Toshimasa Ishii
,
Yoko Akiyama
,
Hiroshi Nagamochi
Algorithmica
56
(4), 2010, pp. 413-436
An algorithm for minimum cost arc-connectivity orientations
Satoru Iwata
,
Yusuke Kobayashi
Algorithmica
56
(4), 2010, pp. 437-447
Approximation algorithms for treewidth
Eyal Amir
Algorithmica
56
(4), 2010, pp. 448-479
Capabilities and limits of compact error resilience methods for algorithmic self-assembly
Sudheer Sahu
,
John H. Reif
Algorithmica
56
(4), 2010, pp. 480-504
Bin packing with rejection revisited
Leah Epstein
Algorithmica
56
(4), 2010, pp. 505-528
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Algorithmica
56
(4), 2010, pp. 529-549
A timing assumption and two
t
-resilient protocols for implementing an eventual leader service in asynchronous shared memory systems
Antonio Fernández
,
Ernesto Jiménez
,
Michel Raynal
,
Gilles Trédan
Algorithmica
56
(4), 2010, pp. 550-576
\l_2^2
spreading metrics for vertex ordering problems
Moses Charikar
,
Mohammad Taghi Hajiaghayi
,
Howard Karloff
,
Satish Rao
Algorithmica
56
(4), 2010, pp. 577-604
Random matrices and codes for the erasure channel
Chris Studholme
,
Ian F. Blake
Algorithmica
56
(4), 2010, pp. 605-620
Seiten
<
1
2
3
4
5