3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2024
Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
Kevin Hua, Daniel Li, Jaewoo Park +1
We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least three connected component…
math.NT2019★ 3 cited
Central Limit Theorems for Compound Paths on the 2-Dimensional Lattice
Evan Fang, Jonathan Jenkins, Zack Lee +5
Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers , and later researchers showed that the distribution of the numb…