1: 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
2: Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut
3: Faster generation of random spanning trees
4: Contraction of Timetable Networks with Realistic Transfers
5: Reconstruction on Trees: Exponential Moment Bounds for Linear Estimators
6: Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier