1. Constructing Antidictionaries of Long Texts in Output-Sensitive Space

   • Lorraine A.K. Ayad
   • Golnaz Badkobeh
   • Solon P. Pissis

   OriginalPaper Open access 14 December 2020 Pages: 777 - 797

   

2. Approximability of open k-monopoly problems

   • Sounaka Mishra
   • B. Arjuna Krishna
   • Shijin Rajakrishnan

   OriginalPaper 14 January 2021 Pages: 798 - 814

   

3. Minimum Reload Cost Graph Factors

   • Julien Baste
   • Didem Gözüpek
   • Dimitrios M. Thilikos

   OriginalPaper 18 January 2021 Pages: 815 - 838

   

4. On the Complexity of the Clone Membership Problem

   • Emil Jeřábek

   OriginalPaper 20 January 2021 Pages: 839 - 868

   

5. Computing the Number of Affine Equivalent Classes on \(\mathcal {R}(s,n)/\mathcal {R}(k,n)\)

   • Xiao Zeng
   • Guowu Yang

   OriginalPaper 09 February 2021 Pages: 869 - 883

   

6. The subset sum game revisited

   • Astrid Pieterse
   • Gerhard J. Woeginger

   OriginalPaper Open access 13 February 2021 Pages: 884 - 900