| 0 | -- | 0 | Rezaul Alam Chowdhury, Vijaya Ramachandran. Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs |
| 0 | -- | 0 | Merav Parter, David Peleg. Fault-Tolerant Approximate BFS Structures |
| 0 | -- | 0 | Stephan Held, Sophie Theresa Spirkl. Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two |
| 0 | -- | 0 | Nikhil R. Devanur, Zhiyi Huang 0002. Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms |
| 0 | -- | 0 | Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen. 6-free Graphs |
| 0 | -- | 0 | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001. Linear Time Parameterized Algorithms for Subset Feedback Vertex Set |
| 0 | -- | 0 | T.-H. Hubert Chan, Shaofeng H.-C. Jiang. Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics |
| 0 | -- | 0 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos. Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors |
| 0 | -- | 0 | Ran Duan, Seth Pettie, Hsin-Hao Su. Scaling Algorithms for Weighted Matching in General Graphs |
| 0 | -- | 0 | David Eppstein. The Parametric Closure Problem |