| 2021 | The Bike Sharing Problem. | Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov |
| 2021 | Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. | Alessio Conte, Etsuji Tomita |
| 2021 | Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. | Thomas Byrne, Sndor P. Fekete, Jrg Kalcsics, Linda Kleist |
| 2021 | Faster Multi-sided One-Bend Boundary Labelling. | Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal |
| 2021 | Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. | Ahmad Biniaz |
| 2021 | An Improvement of Reed's Treewidth Approximation. | Mahdi Belbasi, Martin Frer |
| 2021 | A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. | Tetsuo Asano |
| 2021 | Upward Point Set Embeddings of Paths and Trees. | Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr |
| 2021 | On Compatible Matchings. | Oswin Aichholzer, Alan Arroyo, Zuzana Masrov, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber |
| 2021 | Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. | Haitao Wang, Yiming Zhao |
| 2020 | Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks. | Louxin Zhang |
| 2020 | Faster Privacy-Preserving Computation of Edit Distance with Moves. | Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto |
| 2020 | Space Efficient Separator Algorithms for Planar Graphs. | Osamu Watanabe |
| 2020 | Efficient Enumeration of Non-isomorphic Ptolemaic Graphs. | Dat Hoang Tran, Ryuhei Uehara |
| 2020 | Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. | Hirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato |
| 2020 | Train Scheduling: Hardness and Algorithms. | Christian Scheffer |
| 2020 | On the Maximum Edge-Pair Embedding Bipartite Matching. | Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath |
| 2020 | Partitioning a Graph into Complementary Subgraphs. | Julliano Rosa Nascimento, Uverton S. Souza, Jayme Luiz Szwarcfiter |
| 2020 | Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. | Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato |
| 2020 | Packing and Covering with Segments. | Joseph S. B. Mitchell, Supantha Pandit |
| 2020 | Packing Trees into 1-Planar Graphs. | Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath |
| 2020 | Dispersion of Mobile Robots on Grids. | Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2020 | Trichotomy for the Reconfiguration Problem of Integer Linear Systems. | Kei Kimura, Akira Suzuki |
| 2020 | Maximum Bipartite Subgraph of Geometric Intersection Graphs. | Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy |