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=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
Seiten 1
2
>