7 citations · 7 across the 1 of their papers we have counts for
3 papers
cs.NI2019
Periodic Bandits and Wireless Network Selection
Shunhao Oh, Anuja Meetoo Appavoo, Seth Gilbert
Bandit-style algorithms have been studied extensively in stochastic and adversarial settings. Such algorithms have been shown to be useful in multiplayer settings, e.g. to solve th…
cs.CG2018
A Reallocation Algorithm for Online Split Packing of Circles
Shunhao Oh, Seth Gilbert
The Split Packing algorithm \cite{splitpacking_ws, splitpackingsoda, splitpacking} is an offline algorithm that packs a set of circles into triangles and squares up to critical den…
cs.CG2017★ 7 cited
Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
Shunhao Oh, Hon Wai Leong
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of poss…