| 1521 | -- | 0 | . Special Issue on Algorithms and Computation (ISAAC 2021) |
| 1522 | -- | 1559 | Mathew C. Francis, Pavol Hell, Dalu Jacob. On the Kernel and Related Problems in Interval Digraphs |
| 1560 | -- | 1585 | Susanne Albers, Waldo Gálvez, Maximilian Janke. Machine Covering in the Random-Order Model |
| 1586 | -- | 1623 | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen. Algorithms and Complexity on Indexing Founder Graphs |
| 1624 | -- | 1651 | Luciano Gualà, Stefano Leucci 0001, Isabella Ziccardi. Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees |
| 1652 | -- | 1678 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous. Clique-Based Separators for Geometric Intersection Graphs |
| 1679 | -- | 1705 | Joyce Bacic, Saeed Mehrabi 0001, Michiel Smid. Shortest Beer Path Queries in Outerplanar Graphs |
| 1706 | -- | 1735 | Tomohiro Koana, Christian Komusiewicz, Frank Sommer. Essentially Tight Kernels for (Weakly) Closed Graphs |
| 1736 | -- | 1737 | Meng He, Anna Lubiw, Mohammad R. Salavatipour. Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021) |
| 1738 | -- | 1753 | David Eppstein. A Stronger Lower Bound on Parametric Minimum Spanning Trees |
| 1754 | -- | 1785 | Joe Sawada, Aaron Williams. Constructing the first (and coolest) fixed-content universal cycle |
| 1786 | -- | 1804 | Ioana O. Bercea, Guy Even. Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations |
| 1805 | -- | 1823 | Pawel Gawrychowski, Przemyslaw Uznanski. Better Distance Labeling for Unweighted Planar Graphs |