| 3245 | -- | 3390 | Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay. Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation |
| 3391 | -- | 3421 | Spyros Angelopoulos 0001, Giorgio Lucarelli, Nguyen Kim Thang. Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems |
| 3422 | -- | 3463 | Piotr Krysta, David Manlove, Baharak Rastegari, Jinshan Zhang 0002. Size Versus Truthfulness in the House Allocation Problem |
| 3464 | -- | 3493 | Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter, Alessandra Tappini. NodeTrix Planarity Testing with Small Clusters |
| 3494 | -- | 3518 | Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun, Antonis Thomas, Jialin Zhang, Zhijie Zhang. The Complexity of Optimization on Grids |
| 3519 | -- | 3533 | Timothy M. Chan, John Hershberger 0001, Simon Pratt. Two Approaches to Building Time-Windowed Geometric Data Structures |
| 3534 | -- | 3585 | Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan. Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities |
| 3586 | -- | 3629 | Geevarghese Philip, Varun Rajan, Saket Saurabh 0001, Prafullkumar Tale. Subset Feedback Vertex Set in Chordal and Split Graphs |
| 3630 | -- | 3654 | Pawel Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemyslaw Uznanski. Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams |
| 3655 | -- | 3691 | Tomasz Kociumaka, Marcin Pilipczuk. Deleting Vertices to Graphs of Bounded Genus |
| 3692 | -- | 3706 | David Bryant, Céline Scornavacca. An $$O(n \log n)$$ O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees |
| 3707 | -- | 3724 | Megha Khosla, Avishek Anand. A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs |
| 3725 | -- | 3745 | Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott. A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State |
| 3746 | -- | 3764 | Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley. Non-clairvoyantly Scheduling to Minimize Convex Functions |
| 3765 | -- | 3802 | Eldar Fischer, Oded Lachish, Yadu Vasudev. Improving and Extending the Testing of Distributions for Shape-Restricted Properties |
| 3803 | -- | 3841 | R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi. The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue |