| 2973 | -- | 2992 | Cristina G. Fernandes, Rafael Crivellari Saliba Schouery. Approximation Algorithms for the Max-Buying Problem with Limited Supply |
| 2993 | -- | 3022 | Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes. On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems |
| 3023 | -- | 3049 | Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks |
| 3050 | -- | 3077 | Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi. Bounded-Hop Communication Networks |
| 3078 | -- | 3131 | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano. Metastability of Logit Dynamics for Coordination Games |
| 3132 | -- | 3157 | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey. Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions |
| 3158 | -- | 3176 | Wenchang Luo, Yao Xu, Boyuan Gu, Weitian Tong, Randy Goebel, Guohui Lin. Algorithms for Communication Scheduling in Data Gathering Network with Data Compression |
| 3177 | -- | 3191 | Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid. Spanning Trees in Multipartite Geometric Graphs |
| 3192 | -- | 3206 | Peyman Afshani, Konstantinos Tsakalidis. Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges |
| 3207 | -- | 3224 | Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind. Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation |
| 3225 | -- | 3252 | Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu. Improved Bounds in Stochastic Matching and Optimization |
| 3253 | -- | 3269 | Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi. Finding Pairwise Intersections Inside a Query Range |
| 3270 | -- | 3292 | Takuro Fukunaga. Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs |
| 3293 | -- | 3315 | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin. Batch Coloring of Graphs |
| 3316 | -- | 3334 | Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams |
| 3335 | -- | 3364 | Jiawei Qian, Seeun William Umboh, David P. Williamson. Online Constrained Forest and Prize-Collecting Network Design |
| 3365 | -- | 3396 | Raphael Reitzig, Sebastian Wild. Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks |
| 3397 | -- | 3427 | Karl Bringmann, Tobias Friedrich 0001, Anton Krohmer. De-anonymization of Heterogeneous Random Graphs in Quasilinear Time |
| 3428 | -- | 3430 | Ildikó Schlotter, Katarína Cechlárová. Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? |
| 3431 | -- | 3436 | Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese. Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems |