J. Barbay, L. Castelli-aleardi, M. He, and J. I. Munro, Succinct representation of labeled graphs, Proceedings of the 18th International Symposium on Algorithms and Computation, pp.316-328, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00712915

J. Barbay, M. He, J. I. Munro, and S. S. Rao, Succinct indexes for strings, binary relations and multi-labeled trees, Manuscript

J. Barbay, M. He, J. I. Munro, and S. S. Rao, Succinct indexes for strings, binary relations and multi-labeled trees, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.680-689, 2007.

D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman et al., Representing Trees of Higher Degree, Algorithmica, vol.43, issue.4, pp.275-292, 2005.
DOI : 10.1007/s00453-004-1146-6

F. Bernhart and P. C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979.
DOI : 10.1016/0095-8956(79)90021-2

D. K. Blandford, G. E. Blelloch, and I. A. Kash, Compact representations of separable graphs, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.679-688, 2003.

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representation of triangulations with a boundary, Proceedings of the 9th Workshop on Algorithms and Data Structures, pp.134-145, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090707

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representations of planar maps, Theoretical Computer Science, vol.408, issue.2-3, pp.174-187, 2008.
DOI : 10.1016/j.tcs.2008.08.016
URL : https://hal.archives-ouvertes.fr/inria-00337821

Y. Chiang, C. Lin, and H. Lu, Orderly Spanning Trees with Applications, SIAM Journal on Computing, vol.34, issue.4, pp.924-945, 2005.
DOI : 10.1137/S0097539702411381
URL : http://arxiv.org/abs/cs/0102006

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

F. R. Chung, F. T. Leighton, and A. L. Rosenberg, Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.1, pp.33-58, 1987.
DOI : 10.1137/0608002

D. R. Clark and J. I. Munro, Efficient suffix trees on secondary storage, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.383-391, 1996.

A. Farzan and J. I. Munro, Succinct Representations of Arbitrary Graphs, 16th Annual European Symposium on Algorithms, pp.393-404, 2008.
DOI : 10.1007/978-3-540-87744-8_33

C. Gavoille and N. Hanusse, On compact encoding of pagenumber k graphs
URL : https://hal.archives-ouvertes.fr/hal-00402218

M. He, Succinct Indexes, 2007.

M. He, J. I. Munro, and S. S. Rao, Succinct ordinal trees based on tree covering, Proceedings of the 34st International Colloquium on Automata, Languages and Programming, pp.509-520, 2007.

M. Isenburg and J. Snoeyink, Face fixer, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.263-270, 2000.
DOI : 10.1145/344779.344919

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. Jansson, K. Sadakane, and W. Sung, Ultra-succinct representation of ordered trees, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.575-584, 2007.

R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, pp.177-189, 1979.
DOI : 10.1137/0136016

H. Lu and C. Yeh, Balanced parentheses strike back, ACM Transactions on Algorithms, vol.4, issue.3, pp.1-13, 2008.
DOI : 10.1145/1367064.1367068
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.49

J. I. Munro, R. Raman, V. Raman, and S. S. Rao, Succinct Representations of Permutations, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pp.345-356, 2003.
DOI : 10.1007/3-540-45061-0_29

J. I. 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. I. Munro and S. S. Rao, Succinct Representations of Functions, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp.1006-1015, 2004.
DOI : 10.1007/978-3-540-27836-8_84

R. Raman, V. Raman, and S. R. Satti, -ary trees, prefix sums and multisets, ACM Transactions on Algorithms, vol.3, issue.4, pp.1-4325, 2007.
DOI : 10.1145/1290672.1290680
URL : https://hal.archives-ouvertes.fr/hal-01087676

A. L. Rosenberg, The DIOGENES design methodology: toward automatic physical layout, Proceedings of the international workshop on Parallel algorithms & architectures, pp.335-348, 1986.

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.138-148, 1990.

R. E. Tarjan, Sorting Using Networks of Queues and Stacks, Journal of the ACM, vol.19, issue.2, pp.341-346, 1972.
DOI : 10.1145/321694.321704

K. Yamanaka and S. Nakano, A compact encoding of plane triangulations with efficient query supports, 2nd Annual Workshop on Algorithms and Computation, pp.120-131, 2008.

M. Yannakakis, Embedding planar graphs in four pages, Journal of Computer and System Sciences, vol.38, issue.1, pp.36-67, 1989.
DOI : 10.1016/0022-0000(89)90032-9