| 1673 | -- | 1689 | Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks |
| 1690 | -- | 1714 | R. Krithika 0001, Diptapriyo Majumdar, Venkatesh Raman 0001. Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels |
| 1715 | -- | 1735 | Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz. Finger Search in Grammar-Compressed Strings |
| 1736 | -- | 1762 | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti. Space Efficient Linear Time Algorithms for BFS, DFS and Applications |
| 1763 | -- | 1797 | Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambudha Roy, Yogish Sabharwal. Set Cover Problems with Small Neighborhood Covers |
| 1798 | -- | 1825 | Yongjie Yang, Jiong Guo. Parameterized Complexity of Voter Control in Multi-Peaked Elections |
| 1826 | -- | 1879 | Matthias Niewerth, Thomas Schwentick. Reasoning About XML Constraints Based on XML-to-Relational Mappings |
| 1880 | -- | 1909 | Akanksha Agrawal, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. Parameterised Algorithms for Deletion to Classes of DAGs |
| 1910 | -- | 1951 | Diptapriyo Majumdar, Venkatesh Raman 0001, Saket Saurabh 0001. Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators |
| 1952 | -- | 2005 | Sylvie Davies. Primitivity, Uniform Minimality, and State Complexity of Boolean Operations |
| 2006 | -- | 2034 | Spyros Angelopoulos 0001, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén. Online Bin Packing with Advice of Small Size |
| 2035 | -- | 2047 | Sanaz Soltani, Mohammadreza Razzazi, Hossein Ghasemalizadeh. The Most Points Connected-Covering Problem with Two Disks |