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
[1]
Hilfe
Suche: Journal=Algorithmica AND YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Homogeneous string segmentation using trees and weighted independent sets
Peter Damaschke
Algorithmica
57
(4), 2010, pp. 621-640
Constructing labeling schemes through universal matrices
Amos Korman
,
David Peleg
,
Yoav Rodeh
Algorithmica
57
(4), 2010, pp. 641-652
Well supported approximate equilibria in bimatrix games
Spyros C. Kontogiannis
,
Paul G. Spirakis
Algorithmica
57
(4), 2010, pp. 653-667
Approximate shortest paths guided by a small index
Jörg Derungs
,
Riko Jacob
,
Peter Widmayer
Algorithmica
57
(4), 2010, pp. 668-688
Complexity results for throughput and latency optimization of replicated and data-parallel workflows
Anne Benoit
,
Yves Robert
Algorithmica
57
(4), 2010, pp. 689-724
An experimental study of new and known online packet buffering algorithms
Susanne Albers
,
Tobias Jacobs
Algorithmica
57
(4), 2010, pp. 725-746
Chordal deletion is fixed-parameter tractable
Dániel Marx
Algorithmica
57
(4), 2010, pp. 747-768
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Hans Kellerer
,
Vitaly A. Strusevich
Algorithmica
57
(4), 2010, pp. 769-795
Drawing colored graphs with constrained vertex positions and few bends per edge
Emilio Di Giacomo
,
Giuseppe Liotta
,
Francesco Trotta
Algorithmica
57
(4), 2010, pp. 796-818
Scheduling jobs on grid processors
Joan Boyar
,
Lene M. Favrholdt
Algorithmica
57
(4), 2010, pp. 819-847
Broadcasting on networks of workstations
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun Justin Wan
Algorithmica
57
(4), 2010, pp. 848-868
The Steiner ratio conjecture of Gilbert-Pollak may still be open
N. Innami
,
B.H. Kim
,
Y. Mashiko
,
K. Shiohama
Algorithmica
57
(4), 2010, pp. 869-872
Pricing for fairness: Distributed resource allocation for multiple objectives
Sung-woo Cho
,
Ashish Goel
Algorithmica
57
(4), 2010, pp. 873-892
An efficient algorithm for solving pseudo clique enumeration problem
Takeaki Uno
Algorithmica
56
(1), 2010, pp. 3-16
Minimum degree orderings
Hiroshi Nagamochi
Algorithmica
56
(1), 2010, pp. 17-34
Faster combinatorial algorithms for determinant and Pfaffian
Anna Urbańska
Algorithmica
56
(1), 2010, pp. 35-50
On mixing and edge expansion properties in randomized broadcasting
Thomas Sauerwald
Algorithmica
56
(1), 2010, pp. 51-88
A constant-competitive algorithm for online OVSF code assignment
F.Y.L. Chin
,
H.F. Ting
,
Y. Zhang
Algorithmica
56
(1), 2010, pp. 89-104
Integer representation and counting in the bit probe model
M. Ziaur Rahman
,
J. Ian Munro
Algorithmica
56
(1), 2010, pp. 105-127
Geometric representation of graphs in low dimension using axis parallel boxes
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Algorithmica
56
(2), 2010, pp. 129-140
Note on the structure of Kruskal's algorithm
Nicolas Broutin
,
Luc Devroye
,
Erin McLeish
Algorithmica
56
(2), 2010, pp. 141-159
Augmenting the connectivity of outerplanar graphs
A. García
,
F. Hurtado
,
M. Noy
,
J. Tejel
Algorithmica
56
(2), 2010, pp. 160-179
Fast dynamic transitive closure with lookahead
Piotr Sankowski
,
Marcin Mucha
Algorithmica
56
(2), 2010, pp. 180-197
Approximation algorithms for requirement cut on graphs
Viswanath Nagarajan
,
R. Ravi
Algorithmica
56
(2), 2010, pp. 198-213
Faster two dimensional scaled matching
Amihood Amir
,
Eran Chencinski
Algorithmica
56
(2), 2010, pp. 214-234
Seiten
<
1
2
3
4
5
>