Journal: Algorithmica

Volume 49, Issue 1

1 -- 11Alexander Grigoriev, Hans Leo Bodlaender. Algorithms for Graphs Embeddable with Few Crossings per Edge
13 -- 36Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp. The Complexity of the Single Individual SNP Haplotyping Problem
37 -- 50Nir Halman. Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
51 -- 68Leah Epstein, Asaf Levin. SONET ADMs Minimization with Divisible Paths
69 -- 77Daniil Ryabko. Sample Complexity for Computational Classification Problems