| 0 | -- | 0 | Yann Disser, Martin Skutella. The Simplex Algorithm Is NP-Mighty |
| 0 | -- | 0 | Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk 0001. On Problems Equivalent to (min, +)-Convolution |
| 0 | -- | 0 | Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski. Entropy and Optimal Compression of Some General Plane Trees |
| 0 | -- | 0 | Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski. Improved Analysis of Deterministic Load-Balancing Schemes |
| 0 | -- | 0 | Hiroshi Hirai. A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications |
| 0 | -- | 0 | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion |
| 0 | -- | 0 | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke. k)-Competitive Algorithm for Generalized Caching |
| 0 | -- | 0 | Barun Gorain, Andrzej Pelc. Deterministic Graph Exploration with Advice |
| 0 | -- | 0 | Mikkel Abrahamsen, Bartosz Walczak. Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace |
| 0 | -- | 0 | Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie. Distribution-free Junta Testing |
| 0 | -- | 0 | Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi. Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems |
| 0 | -- | 0 | Daniel Lokshtanov, Amer E. Mouawad. The Complexity of Independent Set Reconfiguration on Bipartite Graphs |
| 0 | -- | 0 | Michael Elkin, Ofer Neiman. Efficient Algorithms for Constructing Very Sparse Spanners and Emulators |
| 0 | -- | 0 | Arnab Bhattacharyya 0001, Palash Dey, David P. Woodruff. 1-Heavy Hitters in Insertion Streams and Related Problems |
| 0 | -- | 0 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring |