| Publication | Date of Publication | Type |
|---|
| Testing \(C_k\)-freeness in bounded-arboricity graphs | 2026-01-14 | Paper |
| Improved local computation algorithms for constructing spanners | 2025-01-14 | Paper |
| Distributed CONGEST algorithm for finding Hamiltonian paths in Dirac graphs and generalizations | 2024-12-03 | Paper |
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs
(available as arXiv preprint) | 2023-11-20 | Paper |
Distributed Testing of Graph Isomorphism in the CONGEST Model.
(available as arXiv preprint) | 2023-10-31 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs
ACM Transactions on Algorithms | 2022-02-22 | Paper |
scientific article; zbMATH DE number 7376014 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-28 | Paper |
A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error
(available as arXiv preprint) | 2021-07-28 | Paper |
Testing bounded arboricity
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Property testing of planarity in the \textsf{CONGEST} model
Distributed Computing | 2021-03-12 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs.
(available as arXiv preprint) | 2020-05-27 | Paper |
Local algorithms for sparse spanning graphs
Algorithmica | 2020-02-28 | Paper |
Property testing of planarity in the \textsf{CONGEST} model
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| scientific article; zbMATH DE number 7075933 (Why is no real title available?) | 2019-07-03 | Paper |
A quasi-polynomial time partition oracle for graphs with an excluded minor
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Non-local probes do not help with many graph problems
(available as arXiv preprint) | 2018-08-16 | Paper |
Distance in the Forest Fire Model How far are you from Eve?
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A local algorithm for constructing spanners in minor-free graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
| Testing bounded arboricity | 2018-03-15 | Paper |
Local computation algorithms for graphs of non-constant degrees
Algorithmica | 2017-05-02 | Paper |
Constructing near spanning trees with few local inspections
Random Structures & Algorithms | 2017-04-18 | Paper |
Local algorithms for sparse spanning graphs
(available as arXiv preprint) | 2017-03-22 | Paper |
Testing similar means
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Testing properties of collections of distributions
Theory of Computing | 2014-10-06 | Paper |
Testing Similar Means
Automata, Languages, and Programming | 2013-08-12 | Paper |
A quasi-polynomial time partition oracle for graphs with an excluded minor
Lecture Notes in Computer Science | 2013-08-06 | Paper |
