Algorithmica
Collection
Collection
- ISSN: 0178-4617
Published by Springer Nature
-
Constructing the Simplest Possible Phylogenetic Network from Triplets, Article
AlgorithmicaJanuary 2009 -
Approximation Algorithms for the Interval Constrained Coloring Problem Article
AlgorithmicaE. Althaus, S. Canzar (Stefan), K. Elbassioni, A. Karrenbauer and J. Mestre
January 2010 -
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Article
AlgorithmicaJ. Byrka (Jaroslaw), K. Buchin, M. Buchin, M. Nollenburg, Y. Okamoto, R.I. Silveira and A. Wolff
October 2010 -
Exact algorithms for cluster editing: Evaluation and experiments Article
Algorithmica, 60(2), 316-334.March 2011
-
Deterministic Discrepancy Minimization Article
Algorithmica, 67(4), 451-471.January 2013
-
On tree-constrained matchings and generalizations Article
Algorithmica, 98-109.S. Canzar (Stefan), K. Elbassioni, G.W. Klau (Gunnar) and J. Mestre
January 2013
-
Towards a Reverse Newman’s Theorem in interactive information complexity Article
Algorithmica, 76(3), 749-781.J. Brody (Joshua), H.M. Buhrman (Harry), M. Koucký (Michal), B. S. Loff Barreto (Bruno Serra), F. Speelman (Florian) and N.K. Vereshchagin (Nikolay Konstantinovich)
November 2016
-
The A Priori Traveling Repairman Problem Article
Algorithmica, 2818-2833.July 2017