| 831 | -- | 853 | Alberto Rojas Anríquez, Maya Stein. t-Free Graphs Without Short Odd Cycles |
| 854 | -- | 878 | Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri. Trade-Offs in Dynamic Coloring for Bipartite and General Graphs |
| 879 | -- | 901 | Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner. Gapped Indexing for Consecutive Occurrences |
| 902 | -- | 928 | Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai 0001, Pawel Rzazewski. Parameterized Inapproximability of Independent Set in H-Free Graphs |
| 929 | -- | 964 | Sebastian Forster, Tijn de Vos. Faster Cut Sparsification of Weighted Graphs |
| 965 | -- | 975 | Sariel Har-Peled, Mitchell Jones. Few Cuts Meet Many Point Sets |
| 976 | -- | 991 | Miroslaw Kowaluk, Andrzej Lingas. Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs |
| 992 | -- | 1028 | Riccardo Dondi, Manuel Lafond. On the Tractability of Covering a Graph with 2-Clubs |
| 1029 | -- | 1066 | Seth Gilbert, Peter Robinson 0002, Suman Sourav. Leader Election in Well-Connected Graphs |
| 1067 | -- | 1090 | Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski. The Complexity of Two Colouring Games |
| 1091 | -- | 1110 | Maël Dumas, Anthony Perez 0001, Ioan Todinca. A Cubic Vertex-Kernel for Trivially Perfect Editing |