Kaufmann, M., Sibeyn, J. F., & Suel, T. (1995). Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes. In P., Spirakis (Ed.), Algorithms - ESA'95: 3rd Annual European Symposium (pp. 75-88). Berlin, Germany: Springer.