Dynamic updates of succinct triangulations, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00001187
Succinct representation of triangulations with a boundary, WADS, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00090707
Compact representations of separable graphs, 2003. ,
Resizable Arrays in Optimal Time and Space, WADS, pp.37-48, 1999. ,
DOI : 10.1007/3-540-48447-7_4
Compact encodings of planar graphs via canonical orderings and multiple parentheses, Automata, Languages and Programming, pp.118-129, 1998. ,
DOI : 10.1007/BFb0055046
Space-efficient static trees and graphs, 30th Annual Symposium on Foundations of Computer Science, pp.549-554, 1989. ,
DOI : 10.1109/SFCS.1989.63533
Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-776, 2001. ,
DOI : 10.1137/S0097539799364092
Representing dynamic binary trees succinctly, SODA, pp.529-536, 2001. ,