BACK TO MASCOTTE PUBLICATION INDEX

Publications of J. Bond

Articles in journal or book chapters
  1. J.-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. The power of small coalitions in graphs. Discrete Applied Mathematics, Editor's Choice, 127(3):399-414, 2003. [PDF ] [bibtex-entry]

  2. J.-C. Bermond, J. Bond, C. Martin, A. Pekec, and F. S. Roberts. Optimal orientation of annular networks. JOIN, 1(1):21-46, 2000. [PDF ] [bibtex-entry]

  3. J.-C. Bermond, K. Berrada, and J. Bond. Extensions of networks with given diameter. Discrete Math., 75(1-3):31--40, 1989.
    Note: Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988). [bibtex-entry]

  4. J.-C. Bermond, J. Bond, and D. Sotteau. On regular packings and coverings. Annals of Discrete mathematics, 34:81--100, 1987. [PDF ] [bibtex-entry]

  5. J.-C. Bermond, J. Bond, M. Paoli, and C. Peyrat. Graphs and interconnection networks: diameter and vulnerability. In Surveys in combinatorics (Southampton, 1983), volume 82 of London Math. Soc. Lecture Note Ser., pages 1--30. Cambridge Univ. Press, Cambridge, 1983. [bibtex-entry]

Conference articles
  1. J.-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. Tight bounds on the size of 2-monopolies. In Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6, pages 170--179, 1997. Carleton U. Press. [bibtex-entry]

  2. J.-C. Bermond, J. Bond, and S. Djelloul. Dense bus networks of diameter 2. In Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994, DIMACS Ser., volume 21, pages 9--18, 1995. Annals New York Academy of Sciences. [PDF ] [bibtex-entry]

  3. J.-C. Bermond and J. Bond. Combinatorial designs and hypergraphs of diameter one. In Proceedings of the firts China-US International Conference, Jinan, China, June 1986, volume 576, pages 51--62, 1990. Annals of the New York Academy of Sciences. [bibtex-entry]

  4. J.-C. Bermond, J. Bond, and C. Peyrat. Interconnection networks with each node on two buses in Parallel Algorithms and Architectures. In Proceedings InTernational Workshop on Parallel Algorithms and Architectures, pages 155--167, April 1986. North Holland. [bibtex-entry]

  5. J.-C. Bermond, J. Bond, and J.-F. Saclé. Large hypergraphs of diameter $1$. In Graph theory and combinatorics (Cambridge, 1983), London, pages 19--28, 1984. Academic Press. [bibtex-entry]


BACK TO MASCOTTE PUBLICATION INDEX




Last modified: Thu Oct 10 14:10:01 2013


This document was translated from BibTEX by bibtex2html