1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2018
Generalized Leapfrogging Samplesort: A Class of Worst-Case Complexity and Average-Case Complexity Sorting Algorithms
Eliezer A. Albacea
The original Leapfrogging Samplesort operates on a sorted sample of size and an unsorted part of size . We generalize this to a sorted sample of size and an unsorted p…
cs.GR2015★ 1 cited
A Hybrid Graph-drawing Algorithm for Large, Naturally-clustered, Disconnected Graphs
Toni-Jan Keith P. Monserrat, Jaderick P. Pabico, Eliezer A. Albacea
In this paper, we present a hybrid graph-drawing algorithm (GDA) for layouting large, naturally-clustered, disconnected graphs. We called it a hybrid algorithm because it is an imp…