- Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
On the Advantage of Overlapping Clusters for Minimizing Conductance. Algorithmica 69(4): 844-863 (2014) - M. Reza Khani, Mohammad R. Salavatipour:
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. Algorithmica 69(2): 443-460 (2014) - Po-Shen Loh, Rasmus Pagh:
Thresholds for Extreme Orientability. Algorithmica 69(3): 522-539 (2014) - Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. Algorithmica 69(3): 641-657 (2014) - George B. Mertzios:
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. Algorithmica 69(3): 540-581 (2014) - David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
On the Least Trimmed Squares Estimator. Algorithmica 69(1): 148-183 (2014) - Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk:
Inclusion/Exclusion Meets Measure and Conquer. Algorithmica 69(3): 685-740 (2014) - Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang:
Cache-Oblivious Hashing. Algorithmica 69(4): 864-883 (2014) - Romeo Rizzi, David Cariolaro:
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. Algorithmica 69(3): 494-500 (2014) - C. Seshadhri, Jan Vondrák:
Is Submodularity Testable? Algorithmica 69(1): 1-25 (2014) - Marcel Wild:
Counting or Producing All Fixed Cardinality Transversals. Algorithmica 69(1): 117-129 (2014) - Editor's Note. Algorithmica 69(3): 493 (2014)