| 2021 | Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes. | Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uverton S. Souza, Luiz Satoru Ochi |
| 2021 | New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem. | Jiangkun Li, Peng Zhang |
| 2021 | Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l | Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang |
| 2021 | Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number. | Yunlong Liu, Yixuan Li, Jingui Huang |
| 2021 | Two-Stage Stochastic Max-Weight Independent Set Problems. | Min Li, Qian Liu, Yang Zhou |
| 2021 | Two-Stage Submodular Maximization Under Curvature. | Yanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Hong Chang, Xiaoyan Zhang |
| 2021 | Delay-Constrained Minimum Shortest Path Trees and Related Problems. | Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang |
| 2021 | Cycle-Connected Mixed Graphs and Related Problems. | Junran Lichen |
| 2021 | On the k-colored Rainbow Sets in Fixed Dimensions. | Vahideh Keikha, Hamidreza Keikha, Ali Mohades |
| 2021 | Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers. | Sai Ji, Min Li, Mei Liang, Zhenning Zhang |
| 2021 | An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem. | Sai Ji, Yukun Cheng, Jingjing Tan, Zhongrui Zhao |
| 2021 | Routing Among Convex Polygonal Obstacles in the Plane. | R. Inkulu, Pawan Kumar |
| 2021 | Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. | Weizhi Hong, Zhao Zhang, Yingli Ran |
| 2021 | Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. | Michael A. Henning, Arti Pandey, Vikash Tripathi |
| 2021 | Directed Width Parameters on Semicomplete Digraphs. | Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht |
| 2021 | The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. | Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu |
| 2021 | Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. | Pooja Goyal, B. S. Panda |
| 2021 | A Multi-pass Streaming Algorithm for Regularized Submodular Maximization. | Qinqin Gong, Suixiang Gao, Fengmin Wang, Ruiqi Yang |
| 2021 | Sublinear-Time Reductions for Big Data Computing. | Xiangyu Gao, Jian-Zhong Li, Dongjing Miao |
| 2021 | On Various Open-End Bin Packing Game. | Ling Gai, Weiwei Zhang, Wenchang Luo, Yukun Cheng |
| 2021 | On Structural Parameterizations of the Offensive Alliance Problem. | Ajinkya Gaikwad, Soumen Maity |
| 2021 | The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. | Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester |
| 2021 | Generalized Self-profit Maximization in Attribute Networks. | Liman Du, Wenguo Yang, Suixiang Gao |
| 2021 | Complexity and Approximation Results on the Shared Transportation Problem. | Tom Davot, Rodolphe Giroudeau, Jean-Claude Knig |
| 2021 | The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making. | Chunsheng Cui, Baiqiu Li, Liu Wang |