1. Length-weighted \(\lambda \)-rearrangement distance

   • Alexsandro Oliveira Alexandrino
   • Guilherme Henrique Santos Miranda
   • Zanoni Dias

   OriginalPaper 18 November 2020 Pages: 579 - 602

   

2. Minimum constellation covers: hardness, approximability and polynomial cases

   • Santiago Valdés Ravelo

   OriginalPaper 30 January 2021 Pages: 603 - 624

   

3. The simple grid polygon exploration problem

   • Qi Wei
   • Jie Sun
   • Yonggong Ren

   OriginalPaper 03 February 2021 Pages: 625 - 639

   

4. Designing emergency flood evacuation plans using robust optimization and artificial intelligence

   • Soheyl Khalilpourazari
   • Seyed Hamid Reza Pasandideh

   OriginalPaper 06 February 2021 Pages: 640 - 677

   

5. Some mixed graphs with H-rank 4, 6 or 8

   • Jinling Yang
   • Ligong Wang
   • Xiuwen Yang

   OriginalPaper 08 February 2021 Pages: 678 - 693

   

6. On maximum \(P_3\)-packing in claw-free subcubic graphs

   • Wenying Xi
   • Wensong Lin

   OriginalPaper 09 February 2021 Pages: 694 - 709

   

7. The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation

   • Tınaz Ekim
   • Mordechai Shalom
   • Oylum Şeker

   OriginalPaper 26 February 2021 Pages: 710 - 735

   

8. On the computational complexity of finding a sparse Wasserstein barycenter

   • Steffen Borgwardt
   • Stephan Patterson

   OriginalPaper 03 March 2021 Pages: 736 - 761

   

9. Digraphs that contain at most t distinct walks of a given length with the same endpoints

   • Zhenhua Lyu

   OriginalPaper 04 March 2021 Pages: 762 - 779