| 0 | -- | 0 | Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan. Exponential Separations in the Energy Complexity of Leader Election |
| 0 | -- | 0 | Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu. nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph |
| 0 | -- | 0 | Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha. Dynamic Beats Fixed: On Phase-based Algorithms for File Migration |
| 0 | -- | 0 | Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth. Recognizing Weak Embeddings of Graphs |
| 0 | -- | 0 | Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem |
| 0 | -- | 0 | Sandy Heydrich, Andreas Wiese. Faster Approximation Schemes for the Two-Dimensional Knapsack Problem |
| 0 | -- | 0 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001. Spanning Circuits in Regular Matroids |
| 0 | -- | 0 | Marek Cygan, Lukasz Kowalik, Arkadiusz Socala. Improving TSP Tours Using Dynamic Programming over Tree Decompositions |
| 0 | -- | 0 | Boris Klemz, Günter Rote. Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity |
| 0 | -- | 0 | Mark Bun, Jelani Nelson, Uri Stemmer. Heavy Hitters and the Structure of Local Privacy |
| 0 | -- | 0 | Ulrich Brenner, Anna Hermann. Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times |