| No. |
Title |
Author |
Year |
| 1 |
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations |
Biton, Noy et al. |
2023 |
| 2 |
Improved Local Computation Algorithms for Constructing Spanners |
Arviv, Rubi et al. |
2023 |
| 3 |
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs |
Levi, Reut et al. |
2021 |
| 4 |
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n) |
Levi, Reut |
2021 |
| 5 |
Distributed Testing of Graph Isomorphism in the CONGEST Model |
Levi, Reut et al. |
2020 |
| 6 |
A Centralized Local Algorithm for the Sparse Spanning Graph Problem |
Lenzen, Christoph et al. |
2018 |
| 7 |
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error |
Fichtenberger, Hendrik et al. |
2018 |
| 8 |
Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem |
Lenzen, Christoph et al. |
2017 |
| 9 |
Sublinear Random Access Generators for Preferential Attachment Graphs |
Even, Guy et al. |
2017 |
| 10 |
Three Notes on Distributed Property Testing |
Even, Guy et al. |
2017 |
| 11 |
A Local Algorithm for Constructing Spanners in Minor-Free Graphs |
Levi, Reut et al. |
2016 |
| 12 |
Local Algorithms for Sparse Spanning Graphs |
Levi, Reut et al. |
2014 |
