| 0 | -- | 0 | Talya Eden, Reut Levi, Dana Ron. Testing Bounded Arboricity |
| 0 | -- | 0 | Maria-Florina Balcan, Nika Haghtalab, Colin White. k-center Clustering under Perturbation Resilience |
| 0 | -- | 0 | Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman. Ramsey Spanning Trees and Their Applications |
| 0 | -- | 0 | Pawel Gawrychowski, Shay Mozes, Oren Weimann. Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search |
| 0 | -- | 0 | Saleh Soltan, Mihalis Yannakakis, Gil Zussman. Doubly Balanced Connected Graph Partitioning |
| 0 | -- | 0 | Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. A Linear-Time Algorithm for Seeds Computation |
| 0 | -- | 0 | Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen. Linear-time String Indexing and Analysis in Small Space |
| 0 | -- | 0 | T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang. A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics |
| 0 | -- | 0 | Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001. Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems |
| 0 | -- | 0 | Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein. Fully Dynamic MIS in Uniformly Sparse Graphs |
| 0 | -- | 0 | Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach. Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems |
| 0 | -- | 0 | Miriam Backens, Leslie Ann Goldberg. Holant Clones and the Approximability of Conservative Holant Problems |