March 6, 2020, 10:54 p.m.
We have 3 STOC 2020 papers!
3 papers authored by people from our institute have been accepted to STOC 2020 (one of the most prestigiuos conferences in CS):
- Unbounded lower bound for k-server against weak adversaries Marcin Bieńkowski (University of Wroclaw), Jarosław Byrka (University of Wroclaw), Christian Coester (CWI), Łukasz Jeż (University of Wroclaw)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree Jarosław Byrka (University of Wroclaw), Fabrizio Grandoni (IDSIA, Switzerland), Afrouz Jabal Ameli (IDSIA, Switzerland)
- All non-trivial variants of 3-LDT are equivalent Bartłomiej Dudek (University of Wrocław), Paweł Gawrychowski (University of Wrocław), Tatiana Starikovskaya (Ecole Normale Superieure)
