8 citations · 31 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CG2011
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
Kyle Fox
Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques de…
cs.DS2011★ 6 cited
Upper Bounds for Maximally Greedy Binary Search Trees
Kyle Fox
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der…