| 2022 | Machine Learning Advised Ski Rental Problem with a Discount. | Arghya Bhattacharya, Rathish Das |
| 2022 | Counting and Sampling Orientations on Chordal Graphs. | Ivona Bezkov, Wenbo Sun |
| 2022 | The Complexity of L(p, q)-Edge-Labelling. | Gatan Berthe, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2022 | Vertex-Weighted Graphs: Realizable and Unrealizable Domains. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz |
| 2022 | Structural Parameterizations of Budgeted Graph Coloring. | Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman |
| 2022 | Approximating the Bundled Crossing Number. | Alan Arroyo, Stefan Felsner |
| 2022 | Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. | Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch |
| 2022 | Traversability, Reconfiguration, and Reachability in the Gadget Framework. | Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch |
| 2022 | Parameterized Complexity of Minimum Membership Dominating Set. | Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi |
| 2021 | Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. | Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara |
| 2021 | Cyclic Shift Problems on Graphs. | Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta |
| 2021 | Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. | Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender |
| 2021 | Physical Zero-Knowledge Proof for Ripple Effect. | Suthee Ruangwises, Toshiya Itoh |
| 2021 | Efficient Generation of a Card-Based Uniformly Distributed Random Derangement. | Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone |
| 2021 | APX-Hardness and Approximation for the k-Burning Number Problem. | Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh |
| 2021 | Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. | Ko Minamisawa, Ryuhei Uehara, Masao Hara |
| 2021 | On the Geometric Red-Blue Set Cover Problem. | Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit |
| 2021 | r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. | Soh Kumabe, Takanori Maehara |
| 2021 | Majority Spanning Trees, Cotrees and Their Applications. | Mohammad Kaykobad, Franz J. M. Salzborn |
| 2021 | Computing L(p, 1)-Labeling with Combined Parameters. | Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono |
| 2021 | Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. | Frank Gurski, Dominique Komander, Marvin Lindemann |
| 2021 | 2-Colored Point-Set Embeddings of Partial 2-Trees. | Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta |
| 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 | Compact Data Structures for Dedekind Groups and Finite Rings. | Bireswar Das, Shivdutt Sharma |
| 2021 | On Short Fastest Paths in Temporal Graphs. | Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth |