research
∙
06/09/2023
Optimal distance query reconstruction for graphs without long induced cycles
Let G=(V,E) be an n-vertex connected graph of maximum degree Δ. Given ac...
share
research
∙
03/12/2023
Reconstructing Graphs from Connected Triples
We introduce a new model of indeterminacy in graphs: instead of specifyi...
research
∙
10/20/2021
Improved pyrotechnics : Closer to the burning graph conjecture
Can every connected graph burn in ⌈√(n)⌉ steps? While this conjecture re...
research
∙
08/04/2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models
Given any task Π, Brandt's speedup theorem (PODC 2019) provides a mechan...
research
∙
03/23/2020
Efficient Bayesian Inference of General Gaussian Models on Large Phylogenetic Trees
Phylogenetic comparative methods correct for shared evolutionary history...
research
∙
12/19/2019
