| 2021 | 2-Colored Point-Set Embeddings of Partial 2-Trees. Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta |
| 2021 | A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. Tetsuo Asano |
| 2021 | APX-Hardness and Approximation for the k-Burning Number Problem. Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh |
| 2021 | Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. Haitao Wang, Yiming Zhao |
| 2021 | An Improvement of Reed's Treewidth Approximation. Mahdi Belbasi, Martin Fürer |
| 2021 | Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. Ahmad Biniaz |
| 2021 | Compact Data Structures for Dedekind Groups and Finite Rings. Bireswar Das, Shivdutt Sharma |
| 2021 | Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist |
| 2021 | Computing L(p, 1)-Labeling with Combined Parameters. Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono |
| 2021 | Cyclic Shift Problems on Graphs. Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta |
| 2021 | Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara |
| 2021 | Efficient Generation of a Card-Based Uniformly Distributed Random Derangement. Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone |
| 2021 | Faster Multi-sided One-Bend Boundary Labelling. Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal |
| 2021 | Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender |
| 2021 | Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. Frank Gurski, Dominique Komander, Marvin Lindemann |
| 2021 | Majority Spanning Trees, Cotrees and Their Applications. Mohammad Kaykobad, Franz J. M. Salzborn |
| 2021 | Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. Ko Minamisawa, Ryuhei Uehara, Masao Hara |
| 2021 | Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni |
| 2021 | On Compatible Matchings. Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber |
| 2021 | On Short Fastest Paths in Temporal Graphs. Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth |
| 2021 | On the Geometric Red-Blue Set Cover Problem. Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit |
| 2021 | Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. Alessio Conte, Etsuji Tomita |
| 2021 | Physical Zero-Knowledge Proof for Ripple Effect. Suthee Ruangwises, Toshiya Itoh |
| 2021 | The Bike Sharing Problem. Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov |
| 2021 | Upward Point Set Embeddings of Paths and Trees. Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr |
| 2021 | WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
| 2021 | r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. Soh Kumabe, Takanori Maehara |