1: Fast Dynamic Pointer Following via Link-Cut Trees
2: Online Edge Coloring of Paths and Trees with a Fixed Number of Colors
3: Distinguishing Views in Symmetric Networks: A Tight Lower Bound
4: Lessons from the Congested Clique Applied to MapReduce
5: AND-compression of NP-complete problems: Streamlined proof and minor observations
6: Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network
7: Alternative Algorithms for Lyndon Factorization
8: Planar 3-dimensional assignment problems with Monge-like cost arrays
9: Single machine scheduling problems with uncertain parameters and the OWA criterion
10: Complexity of the robust weighted independent set problems on interval graphs
11: Approximability of the robust representatives selection problem