| 6 | -- | 0 | Yi-Jun Chang, Hsin-Hao Su. Narrowing the LOCAL-CONGEST gaps in sparse networks via expander decompositions |
| 7 | -- | 0 | Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, Antonio Russo 0004. Byzantine-tolerant distributed grow-only sets: specification and applications |
| 8 | -- | 0 | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf. Constant-round spanners and shortest paths in congested clique and MPC |
| 9 | -- | 0 | Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan. Distributed MIS in O(log log n) Awake Complexity |
| 10 | -- | 0 | Younan Gao, Andrzej Pelc. Gathering teams of bounded memory agents on a line |
| 11 | -- | 0 | Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro. Universal pattern formation by oblivious robots under sequential schedulers |
| 12 | -- | 0 | Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin. Content-oblivious leader election on rings |
| 13 | -- | 0 | Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf. Improved all-pairs approximate shortest paths in congested clique |
| 14 | -- | 0 | Asaf Petruschka, Shay Sapir, Elad Tzalik. Connectivity Labeling in Faulty Colored Graphs |
| 15 | -- | 0 | Andreas Padalkin, Christian Scheideler. Polylogarithmic time algorithms for shortest path forests in programmable matter |