Graphs & Applications
Publications of Nicolas BONICHON

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2000]


2008

  1. O. Bernardi and N. Bonichon. Catalan's intervals and realizers of triangulations. JCT-A, submitted. Date?

  2. O. Beaumont, N. Bonichon, and L. Eyraud-Dubois. Scheduling divisible workload on heterogeneous platforms under bounded multi-port model. In International Heterogeneity in Computing Workshop, submitted. Date?



2007

  1. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected planar graphs. Algorithmica, 47(4):399-420, 2007.

  2. O. Bernardi and N. Bonichon. Catalan's intervals and realizers of triangulations (extended abstract). In Proceedings of FPSAC'07, page Accepted, 2007.



2006

  1. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Short labels by traversal and jumping. In 13th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume Lecture Notes in Computer Science 4056. Springer, July 2006. 143-156.

  2. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Adjacency labeling for bounded degree trees and applications. In 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, July 2006. Dedicated to Jarik Nesetril on the occasion of his 60th birthday.

  3. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Short labels by traversal and jumping. Research Report RR-1389-06, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, March 2006.

  4. N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, 22:1-18, 2006.



2005

  1. Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Edge partition of toroidal graphs into forests in linear time. In Elsevier, editor, 7th International Conference on Graph Theory (ICGT), volume 22, pages 421-425. Electronical Notes in Discrete Mathematics, September 2005.

  2. N. Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths. Discrete Mathematics, 298:104-114, 2005. FPSAC'02 Special Issue.

  3. N. Bonichon, C. Gavoille, and N. Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. Journal of Graph Algorithms and Applications, 9(2):185 -- 204, 2005.



2004

  1. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected planar graphs - (extended abstract). In Graph Drawing: 12th International Symposium, GD 2004, volume 3383 of LNCS, pages 60-70, 2004.

  2. N. Bonichon, B. Le Saëc, and M. Mosbah. Orthogonal drawings based on the stratification of planar graphs. Discrete Mathematics, 276(1-3):43-57, 2004. Special issue: 6th International Conference on Graph Theory - Edited by J.-L. Fouquet, I. Rusu.

  3. N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer. Planar graphs, via well-orderly maps and trees. In 30th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 3353 of Lecture Notes in Computer Science, pages 270-284. Springer-Verlag, 2004.



2003

  1. N. Bonichon, C. Gavoille, and N. Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. In 29th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 2880 of Lecture Notes in Computer Science, pages 81-92. Springer-Verlag, June 2003.

  2. N. Bonichon, C. Gavoille, and N. Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. Research Report RR-1295-03, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, March 2003.

  3. N. Bonichon, C. Gavoille, and N. Hanusse. 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-Verlag, February 2003. Appears also as RR-1279-02 (2002), and a revised version is available here.

  4. N. Bonichon and M. Mosbah. Watermelon uniform random generation with applications. Theoretical Computer Science, 307(2):241-256, 2003.



2002

  1. N. Bonichon, C. Gavoille, and N. Hanusse. 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. Extended abstract published in STACS '03, and a revised version is available here.

  2. N. Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths. In Proceedings of FPSAC'02, pages 123-132, 2002.

  3. N. Bonichon. Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. PhD thesis, LaBRI, Université Bordeaux I, Talence, France, 2002.

  4. N. Bonichon, B. Le Saëc, and M. Mosbah. Wagner's theorem on realizers. In Proceedings of International Colloquium on Automata, Languages and Programming 2002 (ICALP'02), volume 2380 of Lecture Notes in Computer Science, pages 1043-1053. Springer-Verlag, 2002.

  5. N. Bonichon, B. Le Saëc, and M. Mosbah. 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-Verlag, 2002.



2000

  1. N. Bonichon, B. Le Saëc, and M. Mosbah. Orthogonal drawings based on the stratification of planar graphs. In Elsevier, editor, 6th International Conference on Graph Theory (ICGT), pages 139-142. Electronical Notes in Discrete Mathematics, August 2000.

  2. N. Bonichon, B. Le Saëc, and M. Mosbah. Orthogonal drawings based on the stratification of planar graphs. Technical Report RR-1246-00, LaBRI, 2000.



11 janvier 2008 (25)
[home page of the team]