| 2021 | Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space. | Dhrumil Patel, Rahul Shah |
| 2021 | Illuminating the x-Axis by α-Floodlights. | Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski |
| 2021 | MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2021 | On the Extended TSP Problem. | Julin Mestre, Sergey Pupyrev, Seeun William Umboh |
| 2021 | Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. | Claire Mathieu, Hang Zhou |
| 2021 | Approximate Maximum Halfspace Discrepancy. | Michael Matheny, Jeff M. Phillips |
| 2021 | Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees. | Anna Malafiejska, Michal Malafiejski, Krzysztof M. Ocetkiewicz, Krzysztof Pastuszak |
| 2021 | Impatient PPSZ - A Faster Algorithm for CSP. | Shibo Li, Dominik Scheder |
| 2021 | Tight Competitive Analyses of Online Car-Sharing Problems. | Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama |
| 2021 | Fine-Grained Meta-Theorems for Vertex Integrity. | Michael Lampis, Valia Mitsou |
| 2021 | Interval Query Problem on Cube-Free Median Graphs. | Soh Kumabe |
| 2021 | Essentially Tight Kernels For (Weakly) Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2021 | Γ-Graphic Delta-Matroids and Their Applications. | Donggyu Kim, Duksang Lee, Sang-il Oum |
| 2021 | Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. | Tali Kaufman, David Mass |
| 2021 | Clustering with Neighborhoods. | Hongyao Huang, Georgiy Klimenko, Benjamin Raichel |
| 2021 | Anonymity-Preserving Space Partitions. | rsula Hbert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan |
| 2021 | Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. | Atsuya Hasegawa, Franois Le Gall |
| 2021 | Multimodal Transportation with Ridesharing of Personal Vehicles. | Qian-Ping Gu, Jiajian Leo Liang |
| 2021 | Augmenting Graphs to Minimize the Radius. | Joachim Gudmundsson, Yuan Sha, Fan Yao |
| 2021 | Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. | Luciano Gual, Stefano Leucci, Isabella Ziccardi |
| 2021 | Filling Crosswords Is Very Hard. | Laurent Gourvs, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | The VC-Dimension of Limited Visibility Terrains. | Matt Gibson-Lopez, Zhongxiu Yang |
| 2021 | Lower Bounds for Induced Cycle Detection in Distributed Computing. | Franois Le Gall, Masayuki Miyamoto |
| 2021 | Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. | Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen |
| 2021 | On the Kernel and Related Problems in Interval Digraphs. | Mathew C. Francis, Pavol Hell, Dalu Jacob |