L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Dynamic updates of succinct triangulations, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001187

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representation of triangulations with a boundary, WADS, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090707

D. Blanford, G. Blelloch, and I. Kash, Compact representations of separable graphs, 2003.

A. Brodnik, S. Carlsson, E. Demaine, J. Munro, and R. Sedgewick, Resizable Arrays in Optimal Time and Space, WADS, pp.37-48, 1999.
DOI : 10.1007/3-540-48447-7_4

R. Chuang, A. Garg, X. He, M. Kao, and H. Lu, Compact encodings of planar graphs via canonical orderings and multiple parentheses, Automata, Languages and Programming, pp.118-129, 1998.
DOI : 10.1007/BFb0055046

G. Jacobson, Space-efficient static trees and graphs, 30th Annual Symposium on Foundations of Computer Science, pp.549-554, 1989.
DOI : 10.1109/SFCS.1989.63533

J. Munro and V. Raman, Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-776, 2001.
DOI : 10.1137/S0097539799364092

J. Munro, V. Raman, and A. Storm, Representing dynamic binary trees succinctly, SODA, pp.529-536, 2001.