1. The Inverse Voronoi Problem in Graphs II: Trees

   • Édouard Bonnet
   • Sergio Cabello
   • Hebert Pérez-Rosés

   OriginalPaper 15 October 2020 Pages: 1165 - 1200

   

2. Towards a Polynomial Kernel for Directed Feedback Vertex Set

   • Benjamin Bergougnoux
   • Eduard Eiben
   • M. S. Ramanujan

   OriginalPaper Open access 04 November 2020 Pages: 1201 - 1221

   

3. Budget Feasible Mechanisms on Matroids

   • Stefano Leonardi
   • Gianpiero Monaco
   • Qiang Zhang

   OriginalPaper Open access 13 November 2020 Pages: 1222 - 1237

   

4. Matching Cut in Graphs with Large Minimum Degree

   • Chi-Yeh Chen
   • Sun-Yuan Hsieh
   • Sheng-Lung Peng

   OriginalPaper Open access 23 November 2020 Pages: 1238 - 1255

   

5. The Price of Defense

   • Marios Mavronicolas
   • Loizos Michael
   • Paul G. Spirakis

   OriginalPaper 04 January 2021 Pages: 1256 - 1315

   

6. Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers

   • Hugo A. Akitaya
   • Esther M. Arkin
   • Vera Sacristán

   OriginalPaper 02 January 2021 Pages: 1316 - 1351

   

7. Travelling on Graphs with Small Highway Dimension

   • Yann Disser
   • Andreas Emil Feldmann
   • Jochen Könemann

   OriginalPaper 12 February 2021 Pages: 1352 - 1370

   

8. Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities

   • Marc Bury
   • Michele Gentili
   • Mara Sorella

   OriginalPaper 04 January 2021 Pages: 1371 - 1392

   

9. Packing Arc-Disjoint Cycles in Tournaments

   • Stéphane Bessy
   • Marin Bougeret
   • Meirav Zehavi

   OriginalPaper 04 January 2021 Pages: 1393 - 1420

   

10. Computing the Largest Bond and the Maximum Connected Cut of a Graph

    • Gabriel L. Duarte
    • Hiroshi Eto
    • Uéverton S. Souza

    OriginalPaper 08 January 2021 Pages: 1421 - 1458

    

11. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between

    • Fionn Mc Inerney
    • Nicolas Nisse
    • Stéphane Pérennes

    OriginalPaper 08 February 2021 Pages: 1459 - 1492

    

12. Popular Matchings in Complete Graphs

    • Ágnes Cseh
    • Telikepalli Kavitha

    OriginalPaper Open access 25 January 2021 Pages: 1493 - 1523

    

13. Approximating the Canadian Traveller Problem with Online Randomization

    • Erik D. Demaine
    • Yamming Huang
    • Kunihiko Sadakane

    OriginalPaper 08 January 2021 Pages: 1524 - 1543

    

14. A Fast Algorithm for the Product Structure of Planar Graphs

    • Pat Morin

    OriginalPaper 04 January 2021 Pages: 1544 - 1558

    

15. Obtaining a Proportional Allocation by Deleting Items

    • Britta Dorn
    • Ronald de Haan
    • Ildikó Schlotter

    OriginalPaper Open access 26 March 2021 Pages: 1559 - 1603