1. Alstrup, S., Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198–207 (2000)
2. Ando, K., Enomoto, H., Saito, A.: Contractible edges in 3-connected graphs. J. Comb. Theory, Ser. B 42, 87–93 (1987)
3. Brandes, U.: Eager st-ordering. In: ESA, pp. 247–256 (2002)
4. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)
5. Elmasry, A., Mehlhorn, K., Schmidt, J.M.: Every DFS-tree of a 3-connected graph contains a contractible edge. Available at the second author’s web-page, February 2010