20 citations · 75 across the 28 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.GR2009★ 2 cited
Tame combing and almost convexity conditions
Sean Cleary, Susan Hermiller, Melanie Stein +1
We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally…
cs.DS2009
Rotation Distance is Fixed-Parameter Tractable
Sean Cleary, Katherine St. John
Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing ro…