Fault-Tolerant Covering Problems in Metric Spaces Santanu BhowmickTanmay InamdarKasturi Varadarajan OriginalPaper 29 September 2020 Pages: 413 - 446
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games Vittorio BilòMarios Mavronicolas OriginalPaper 19 September 2020 Pages: 447 - 530
Covert Computation in Self-Assembled Circuits Angel A. CantuAustin LuchsingerTim Wylie OriginalPaper 02 September 2020 Pages: 531 - 552
Constrained Minimum Passage Time in Random Geometric Graphs Ghurumuruhan Ganesan OriginalPaper 18 September 2020 Pages: 576 - 588
On the Complexity of Colouring Antiprismatic Graphs Myriam PreissmannCléophée RobinNicolas Trotignon OriginalPaper 18 September 2020 Pages: 589 - 612
Non-Greedy Online Steiner Trees on Outerplanar Graphs Akira Matsubayashi OriginalPaper 16 October 2020 Pages: 613 - 640
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth Therese BiedlSaeed Mehrabi OriginalPaper 27 September 2020 Pages: 641 - 666
High Entropy Random Selection Protocols Harry BuhrmanMatthias ChristandlNikolay Vereshchagin OriginalPaper 03 October 2020 Pages: 667 - 694
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location Diodato FerraioliCarmine Ventre OriginalPaper Open access 03 October 2020 Pages: 695 - 725
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Robert GanianSebastian Ordyniak OriginalPaper Open access 21 October 2020 Pages: 726 - 752
Simultaneous Feedback Edge Set: A Parameterized Perspective Akanksha AgrawalFahad PanolanMeirav Zehavi OriginalPaper 10 October 2020 Pages: 753 - 774