Let G=(V,E) be an n-vertex connected graph of maximum degree Δ.
Given ac...
We introduce a new model of indeterminacy in graphs: instead of specifyi...
Can every connected graph burn in ⌈√(n)⌉ steps? While this
conjecture re...
Given any task Π, Brandt's speedup theorem (PODC 2019) provides a
mechan...
Phylogenetic comparative methods correct for shared evolutionary history...
Inferring concerted changes among biological traits along an evolutionar...