1. Fault-Tolerant Covering Problems in Metric Spaces

   • Santanu Bhowmick
   • Tanmay Inamdar
   • Kasturi Varadarajan

   OriginalPaper 29 September 2020 Pages: 413 - 446

   

2. The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games

   • Vittorio Bilò
   • Marios Mavronicolas

   OriginalPaper 19 September 2020 Pages: 447 - 530

   

3. Covert Computation in Self-Assembled Circuits

   • Angel A. Cantu
   • Austin Luchsinger
   • Tim Wylie

   OriginalPaper 02 September 2020 Pages: 531 - 552

   

4. On the Tree Augmentation Problem

   • Zeev Nutov

   OriginalPaper 15 September 2020 Pages: 553 - 575

   

5. Constrained Minimum Passage Time in Random Geometric Graphs

   • Ghurumuruhan Ganesan

   OriginalPaper 18 September 2020 Pages: 576 - 588

   

6. On the Complexity of Colouring Antiprismatic Graphs

   • Myriam Preissmann
   • Cléophée Robin
   • Nicolas Trotignon

   OriginalPaper 18 September 2020 Pages: 589 - 612

   

7. Non-Greedy Online Steiner Trees on Outerplanar Graphs

   • Akira Matsubayashi

   OriginalPaper 16 October 2020 Pages: 613 - 640

   

8. On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth

   • Therese Biedl
   • Saeed Mehrabi

   OriginalPaper 27 September 2020 Pages: 641 - 666

   

9. High Entropy Random Selection Protocols

   • Harry Buhrman
   • Matthias Christandl
   • Nikolay Vereshchagin

   OriginalPaper 03 October 2020 Pages: 667 - 694

10. Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location

    • Diodato Ferraioli
    • Carmine Ventre

    OriginalPaper Open access 03 October 2020 Pages: 695 - 725

    

11. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

    • Robert Ganian
    • Sebastian Ordyniak

    OriginalPaper Open access 21 October 2020 Pages: 726 - 752

    

12. Simultaneous Feedback Edge Set: A Parameterized Perspective

    • Akanksha Agrawal
    • Fahad Panolan
    • Meirav Zehavi

    OriginalPaper 10 October 2020 Pages: 753 - 774