1. Bonichon, N., Gavoille, C., Hanusse, N.: An information upper bound of planar graphs using triangulation. Research Report RR-1279-02, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, September 2002
2. Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 499–510. Springer, February 2003
3. Bodirsky, M., Gröpl, C., Kang, M.: Generating labeled planar graphs uniformly at random. In: 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, pages 1095–1107, 2003
4. Bender, E.A., Gao, Z., Wormald, N.C.: The number of labeled 2-connected planar graphs. The Electronic Journal of Combinatorics 9(1), R43 (2002)
5. Bonichon, N., Le Saëc, B., Mosbah, M.: Optimal area algorithm for planar polyline drawings. In: 28th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 2573 of LNCS, pages 35–46. Springer, 2002