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=69
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Is submodularity testable?
C. Seshadhri
,
Jan Vondrák
Algorithmica
69
(1), 2014, pp. 1-25
Robust algorithms for preemptive scheduling
Leah Epstein
,
Asaf Levin
Algorithmica
69
(1), 2014, pp. 26-57
Shortest path problems on a polyhedral surface
Atlas F. Cook IV
,
Carola Wenk
Algorithmica
69
(1), 2014, pp. 58-77
Approximating fixation probabilities in the generalized Moran process
Josep Díaz
,
Leslie Ann Goldberg
,
George B. Mertzios
,
David Richerby
,
Maria Serna
,
Paul G. Spirakis
Algorithmica
69
(1), 2014, pp. 78-91
Compact navigation and distance oracles for graphs with small treewidth
Arash Farzan
,
Shahin Kamali
Algorithmica
69
(1), 2014, pp. 92-116
Counting or producing all fixed cardinality transversals
Marcel Wild
Algorithmica
69
(1), 2014, pp. 117-129
Augmenting edge-connectivity between vertex subsets
Toshimasa Ishii
,
Kazuhisa Makino
Algorithmica
69
(1), 2014, pp. 130-147
On the least trimmed squares estimator
David M. Mount
,
Nathan S. Netanyahu
,
Christine D. Piatko
,
Ruth Silverman
,
Angela Y. Wu
Algorithmica
69
(1), 2014, pp. 148-183
Analysis of agglomerative clustering
Marcel R. Ackermann
,
Johannes Blömer
,
Daniel Kuntze
,
Christian Sohler
Algorithmica
69
(1), 2014, pp. 184-215
Enumerating minimal subset feedback vertex sets
Fedor V. Fomin
,
Pinar Heggernes
,
Dieter Kratsch
,
Charis Papadopoulos
,
Yngve Villanger
Algorithmica
69
(1), 2014, pp. 216-231
Efficient fully-compressed sequence representations
Jérémy Barbay
,
Francisco Claude
,
Travis Gagie
,
Gonzalo Navarro
,
Yakov Nekrich
Algorithmica
69
(1), 2014, pp. 232-268
The parameterized complexity of the shared center problem
Zhi-Zhong Chen
,
Wenji Ma
,
Lusheng Wang
Algorithmica
69
(2), 2014, pp. 269-293
Necklaces, convolutions, and
X+Y
David Bremner
,
Timothy M. Chan
,
Erik D. Demaine
,
Jeff Erickson
,
Ferran Hurtado
,
John Iacono
,
Stefan Langerman
,
Mihai Pȃtraşcu
,
Perouz Taslakian
Algorithmica
69
(2), 2014, pp. 294-314
Opaque sets
Adrian Dumitrescu
,
Minghui Jiang
,
János Pach
Algorithmica
69
(2), 2014, pp. 315-334
On the complexity of strongly connected components in directed hypergraphs
Xavier Allamigeon
Algorithmica
69
(2), 2014, pp. 335-369
New algorithms for facility location problems on the real line
Danny Z. Chen
,
Haitao Wang
Algorithmica
69
(2), 2014, pp. 370-383
Substring range reporting
Philip Bille
,
Inge Li Grtz
Algorithmica
69
(2), 2014, pp. 384-396
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Algorithmica
69
(2), 2014, pp. 397-409
Outlier respecting points approximation
Danny Z. Chen
,
Haitao Wang
Algorithmica
69
(2), 2014, pp. 410-430
On minimum witnesses for Boolean matrix multiplication
Keren Cohen
,
Raphael Yuster
Algorithmica
69
(2), 2014, pp. 431-442
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
M. Reza Khani
,
Mohammad R. Salavatipour
Algorithmica
69
(2), 2014, pp. 443-460
Limitations of incremental dynamic programming
Stasys Jukna
Algorithmica
69
(2), 2014, pp. 461-492
Polynomial time complexity of edge colouring graphs with bounded colour classes
Romeo Rizzi
,
David Cariolaro
Algorithmica
69
(3), 2014, pp. 494-500
Detecting fixed patterns in chordal graphs in polynomial time
Rémy Belmonte
,
Petr A. Golovach
,
Pinar Heggernes
,
Pim van 't Hof
,
Marcin Kamiński
,
Daniël Paulusma
Algorithmica
69
(3), 2014, pp. 501-521
Thresholds for extreme orientability
Po-Shen Loh
,
Rasmus Pagh
Algorithmica
69
(3), 2014, pp. 522-539
Seiten 1
2
>