| 33 | -- | 0 | Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie. Total Completion Time Scheduling Under Scenarios |
| 34 | -- | 0 | Jingnan Xie, Harry B. Hunt III, Richard Edwin Stearns. Decision Problems Concerning L Systems |
| 35 | -- | 0 | Takashi Horiyama, Kazuhisa Seto, Ryu Suzuki. The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs |
| 36 | -- | 0 | Sunny Kumar Sharma, Vijay Kumar Bhat, Latif Hanna, Maryam Al-Kandari. Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension |
| 37 | -- | 0 | Kangyi Tian, Mingyu Xiao 0001, Boting Yang. Improved Parameterized Algorithms for Cluster Vertex Deletion |
| 38 | -- | 0 | S. Anil Kumar, N. S. Narayanaswamy. A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem |
| 39 | -- | 0 | Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem |
| 40 | -- | 0 | Pallavi Mishra, Rachna Bhatia, Predrag S. Stanimirovic, D. K. Gupta 0001, Rakesh P. Badoni. Unveiling Order in Chaos: A Systematic Approach Based on Graph Theory in Enumerating Sudoku Grids of Rank n |