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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for bounded degree phylogenetic roots
Zhi-Zhong Chen
Algorithmica
51
(1), 2008, pp. 1-23
Distribution-free connectivity testing for sparse graphs
Shirley Halevy
,
Eyal Kushilevitz
Algorithmica
51
(1), 2008, pp. 24-48
Tight results on minimum entropy set cover
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
Algorithmica
51
(1), 2008, pp. 49-60
Synchronous vs. asynchronous unison
Christian Boulinier
,
Franck Petit
,
Vincent Villain
Algorithmica
51
(1), 2008, pp. 61-80
Treewidth lower bounds with brambles
Hans L. Bodlaender
,
Alexander Grigoriev
,
Arie M.C.A. Koster
Algorithmica
51
(1), 2008, pp. 81-98
The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
Iyad A. Kanj
,
Luay Nakhleh
,
Ge Xia
Algorithmica
51
(2), 2008, pp. 99-128
Inferring (biological) signal transduction networks viatransitive reductions of directed graphs
Réka Albert
,
Bhaskar DasGupta
,
Riccardo Dondi
,
Eduardo Sontag
Algorithmica
51
(2), 2008, pp. 129-159
Property-preserving data reconstruction
Nir Ailon
,
Bernard Chazelle
,
Seshadhri Comandur
,
Ding Liu
Algorithmica
51
(2), 2008, pp. 160-182
Grouping techniques for scheduling problems: Simpler and faster
Aleksei V. Fishkin
,
Klaus Jansen
,
Monaldo Mastrolilli
Algorithmica
51
(2), 2008, pp. 183-199
Unique sink orientations of grids
Bernd Gärtner
,
Walter D., Jr. Morris
,
Leo Rüst
Algorithmica
51
(2), 2008, pp. 200-235
Generating cut conjunctions in graphs and related problems
Leonid Khachiyan
,
Endre Boros
,
Konrad Borys
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Algorithmica
51
(3), 2008, pp. 239-263
Embedding of cycles in twisted cubes with edge-pancyclic
Jianxi Fan
,
Xiaohua Jia
,
Xiaola Lin
Algorithmica
51
(3), 2008, pp. 264-282
Space efficient algorithms for ordered tree comparison
Lusheng Wang
,
Kaizhong Zhang
Algorithmica
51
(3), 2008, pp. 283-297
Improved approximate string matching using compressed suffix data structures
Tak-Wah Lam
,
Wing-Kin Sung
,
Swee-Seong Wong
Algorithmica
51
(3), 2008, pp. 298-314
A network game with attackers and a defender
Marios Mavronicolas
,
Vicky Papadopoulou
,
Anna Philippou
,
Paul Spirakis
Algorithmica
51
(3), 2008, pp. 315-341
A
(2-c \frac{1}{\sqrt N})
-approximation algorithm forthestable marriage problem
Kazuo Iwama
,
Shuichi Miyazaki
,
Naoya Yamauchi
Algorithmica
51
(3), 2008, pp. 342-356
A primal-dual algorithm for the computation of market equilibrium with logarithmic utility functions
Li-Sha Huang
Algorithmica
51
(3), 2008, pp. 357-366
Competitive analysis of scheduling algorithms for aggregated links
Wojciech Jawor
,
Marek Chrobak
,
Christoph Dürr
Algorithmica
51
(4), 2008, pp. 367-386
Mantaining dynamic matrices for fully dynamic transitive closure
Camil Demetrescu
,
Giuseppe F. Italiano
Algorithmica
51
(4), 2008, pp. 387-427
An
O(n^3(\log\log n /\log n)^{5/4})
time algorithm for all pairs shortest path
Yijie Han
Algorithmica
51
(4), 2008, pp. 428-434
An algorithm for simultaneous backbone threading and side-chain packing
Guojun Li
,
Zhijie Liu
,
Jun-Tao Guo
,
Ying Xu
Algorithmica
51
(4), 2008, pp. 435-450
Preemptive scheduling on uniform parallel machines with controllable job processing times
Natalia V. Shakhlevich
,
Vitaly A. Strusevich
Algorithmica
51
(4), 2008, pp. 451-473