| 1757 | -- | 1780 | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis. Binary Search in Graphs Revisited |
| 1781 | -- | 1799 | Niv Buchbinder, Danny Segev, Yevgeny Tkach. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals |
| 1800 | -- | 1817 | Mong-Jen Kao, Hai-Lun Tu, D. T. Lee. O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities |
| 1818 | -- | 1843 | Franz J. Brandenburg. Characterizing and Recognizing 4-Map Graphs |
| 1844 | -- | 1858 | Viresh Patel, Guus Regts. Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph |
| 1859 | -- | 1880 | Elisabet Burjons, Dennis Komm, Marcel Schöngens. The k-Server Problem with Advice in d Dimensions and on the Sphere |
| 1881 | -- | 1900 | Lena Schlipf, Jens M. Schmidt. Edge-Orders |
| 1901 | -- | 1920 | Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari. Deterministic Leader Election Takes Θ(D+log n) Bit Rounds |
| 1921 | -- | 1937 | Xiaocheng Hu, Cheng Sheng 0001, Yufei Tao. Building an Optimal Point-Location Structure in O( sort (n)) I/Os |
| 1938 | -- | 1964 | Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen. Online Dominating Set |
| 1965 | -- | 1987 | Zengfeng Huang, Pan Peng. Dynamic Graph Stream Algorithms in o(n) Space |
| 1988 | -- | 2015 | Shay Golan, Tsvi Kopelowitz, Ely Porat. Streaming Pattern Matching with d Wildcards |
| 2016 | -- | 2045 | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon. When Can Graph Hyperbolicity be Computed in Linear Time? |
| 2046 | -- | 2071 | Michael A. Bekos, Henry Förster, Michael Kaufmann 0001. On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings |
| 2072 | -- | 2091 | Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner. Succinct Summing over Sliding Windows |
| 2092 | -- | 2121 | Oguz Kaya, Yves Robert. Computing Dense Tensor Decompositions with Optimal Dimension Trees |