| 1731 | -- | 1763 | Naoto Ohsaka. On the Parameterized Intractability of Determinant Maximization |
| 1764 | -- | 1829 | Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray. Sublinear Time Eigenvalue Approximation via Random Sampling |
| 1830 | -- | 1861 | Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid 0001, Ulrich Schmid 0001. The Time Complexity of Consensus Under Oblivious Message Adversaries |
| 1862 | -- | 1887 | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann. Minimal Roman Dominating Functions: Extensions and Enumeration |
| 1888 | -- | 1920 | Telikepalli Kavitha. Stable Matchings, One-Sided Ties, and Approximate Popularity |
| 1921 | -- | 1947 | Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner. Finding Optimal Solutions with Neighborly Help |
| 1948 | -- | 1978 | Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski. Pattern Masking for Dictionary Matching: Theory and Practice |
| 1979 | -- | 2025 | Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar. Linear Space Data Structures for Finite Groups with Constant Query-Time |
| 2026 | -- | 2040 | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov. Diverse Pairs of Matchings |
| 2041 | -- | 2066 | Asaf Levin. The Near Exact Bin Covering Problem |
| 2067 | -- | 0 | . Editor's Note: Special Issue with GECCO 2021 |