1: Distributed Symmetry Breaking in Hypergraphs
2: Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods
3: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity
4: Reconfiguration over tree decompositions
5: Tighter Bounds for Makespan Minimization on Unrelated Machines
6: An Efficient Local Search for Partial Latin Square Extension Problem
7: Introduction to Dynamic Unary Encoding
8: Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems