| 2021 | A Card-Minimal Three-Input AND Protocol Using Two Shuffles. | Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki, Daiki Miyahara, Takaaki Mizuki |
| 2021 | The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs. | Ruo-Wei Hung, Ming-Jung Chiu |
| 2021 | Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). | Sen Huang, Mingyu Xiao, Xiaoyu Chen |
| 2021 | On the d-Claw Vertex Deletion Problem. | Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng |
| 2021 | Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata. | Stefan Hoffmann |
| 2021 | Approximate the Lower-Bounded Connected Facility Location Problem. | Lu Han, Chenchen Wu, Yicheng Xu |
| 2021 | Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. | Neelima Gupta, Sapna Grover, Rajni Dabas |
| 2021 | Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract). | Sambhav Gupta, Eddie Cheng, Lszl Liptk |
| 2021 | Hardness and Approximation Results of Roman {3}-Domination in Graphs. | Pooja Goyal, B. S. Panda |
| 2021 | Disconnected Matchings. | Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vincius Fernandes dos Santos, Jayme Luiz Szwarcfiter |
| 2021 | Colouring Graphs with No Induced Six-Vertex Path or Diamond. | Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel |
| 2021 | The Concentration of the Maximum Degree in the Duplication-Divergence Models. | Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski |
| 2021 | On the Probe Problem for (r, ℓ )-Well-Coveredness. | Lurbio Faria, Uverton S. Souza |
| 2021 | Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. | Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal |
| 2021 | Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance. | Longteng Duan, Zifan Gong, Minming Li, Chenhao Wang, Xiaoying Wu |
| 2021 | Finding Cheapest Deadline Paths. | Wei Ding |
| 2021 | On the Approximation Hardness of Geodetic Set and Its Variants. | Tom Davot, Lucas Isenmann, Jocelyn Thiebaut |
| 2021 | Spy Game: FPT-Algorithm and Results on Graph Products. | Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio |
| 2021 | Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. | Cheng-Hung Chiang, Meng-Tsung Tsai |
| 2021 | Most Pseudo-copy Languages Are Not Context-Free. | Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han, Sang-Ki Ko |
| 2021 | Constructing Tri-CISTs in Shuffle-Cubes. | Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang |
| 2021 | A New Measure for Locally t-Diagnosable Under PMC Model. | Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin |
| 2021 | On the Hardness of Opinion Dynamics Optimization with L | T.-H. Hubert Chan, Chui Shan Lee |
| 2021 | A Study for Conditional Diagnosability of Pancake Graphs. | Nai-Wen Chang, Hsuan-Jung Wu, Sun-Yuan Hsieh |
| 2021 | Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored. | Ching-Lueh Chang |