| 2651 | -- | 2677 | Florent Foucaud, Benjamin Gras 0002, Anthony Perez 0001, Florian Sikora. On the Complexity of Broadcast Domination and Multipacking in Digraphs |
| 2678 | -- | 2696 | Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings |
| 2697 | -- | 2718 | Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions |
| 2719 | -- | 2753 | Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith. Online Node- and Edge-Deletion Problems with Advice |
| 2754 | -- | 2802 | Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche. Finding Temporal Paths Under Waiting Time Constraints |
| 2803 | -- | 2832 | Susanne Albers, Maximilian Janke. Scheduling in the Random-Order Model |
| 2833 | -- | 2858 | Susanne Albers, Arindam Khan 0001, Leon Ladewig. Best Fit Bin Packing with Random Order Revisited |
| 2859 | -- | 2894 | Iqra Altaf Gillani, Amitabha Bagchi. A Queueing Network-Based Distributed Laplacian Solver |
| 2895 | -- | 2913 | Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças. A New Lower Bound for Deterministic Truthful Scheduling |
| 2914 | -- | 2951 | Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad. On Girth and the Parameterized Complexity of Token Sliding and Token Jumping |
| 2952 | -- | 2988 | Leah Epstein, Elena Kleiman. Selfish Vector Packing |
| 2989 | -- | 3014 | Dror Rawitz, Adi Rosén. Online Budgeted Maximum Coverage |