1. Lecture Notes in Computer Science;S Alamdari,2013
2. Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks 59(3), 267–274 (2012)
3. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Alg. Appl. 14(1), 19–51 (2010)
4. Bläsius, T., Friedrich, T., Katzmann, M., Krohmer, A.: Hyperbolic embeddings for near-optimal greedy routing. ALENEX 2018, 199–208 (2018)
5. Lecture Notes in Computer Science;N Bonichon,2016