Algorithms for Graphs Embeddable with Few Crossings per Edge Alexander GrigorievHans L. Bodlaender OriginalPaper 02 August 2007 Pages: 1 - 11
The Complexity of the Single Individual SNP Haplotyping Problem Rudi CilibrasiLeo van IerselJohn Tromp OriginalPaper 03 August 2007 Pages: 13 - 36
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems Nir Halman OriginalPaper Pages: 37 - 50
Sample Complexity for Computational Classification Problems Daniil Ryabko OriginalPaper Pages: 69 - 77