Graphs & Applications
Publications of Yon DOURISBOURE

(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.


[ 2005 | 2004 | 2003 | 2002 | 2001]


2005

  1. Yon Dourisboure and Cyril Gavoille. Tree-decompositions with bags of small diameter. Discrete Math, 2005. to appear.

  2. Yon Dourisboure. Compact routing schemes for generalised chordal graphs. Journal of Graph Algorithms and Applications, 2005. to appear.



2004

  1. Yon Dourisboure. Compact routing schemes for tree-length \delta graphs and for k-chordal graphs. In 18-th International Symposium on DIStributed Computing (DISC 2004), volume 3274 of Lecture Notes in Computer Science, pages 365-378. Springer, October 2004.

  2. Yon Dourisboure and Cyril Gavoille. Sparse additive spanners for bounded tree-length graphs. In 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 3104 of Lecture Notes in Computer Science, pages 123-137. Springer, June 2004.



2003

  1. Yon Dourisboure and Cyril Gavoille. Tree-decomposition of graphs with small diameter bags. In European conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2003), pages 100-104. ITI, September 2003.

  2. Yon Dourisboure. Routage compact et longueur arborescente. PhD thesis, Université Bordeaux 1, 2003.



2002

  1. Yon Dourisboure and Cyril Gavoille. Improved compact routing scheme for chordal graphs. In 16-th International Symposium on DIStributed Computing (DISC 2002), volume 2508 of Lecture Notes in Computer Science, pages 252-264. Springer-Verlag, October 2002.

  2. Yon Dourisboure. An additive stretched routing scheme for chordal graphs. In 28-th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '02), volume 2573 of Lecture Notes in Computer Science, pages 150-163. Springer-Verlag, June 2002.



2001

  1. Yon Dourisboure and Cyril Gavoille. Interval routing for generalized Hypercube-like graphs. In 3e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 61-68. INRIA, May 2001.



10 janvier 2008 (9)
[home page of the team]