1: Steiner Transitive-Closure Spanners of d-Dimensional Posets
2: Computing the diameter polynomially faster than APSP
3: Contractions, Removals and How to Certify 3-Connectivity in Linear Time
4: Dominating Set is Fixed Parameter Tractable in Claw-free Graphs
5: Computing multiway cut within the given excess over the largest minimum isolating cut
6: Almost Optimal Explicit Johnson-Lindenstrauss Transformations
7: Generating functions partitioning algorithm for computing power indices in weighted voting games