Publications of year 2001
Publications of year 2001
Thesis
  1. David Coudert. Algorithmic and optimisation of optical communication networks. Theses, Université Nice Sophia Antipolis, December 2001. [WWW ] [PDF ] 
    @phdthesis{coudert:tel-00008087,
TITLE = {{Algorithmic and optimisation of optical communication networks}},
AUTHOR = {Coudert, David},
URL = {https://tel.archives-ouvertes.fr/tel-00008087},
SCHOOL = {{Universit{\'e} Nice Sophia Antipolis}},
YEAR = {2001},
MONTH = Dec,
TYPE = {Theses},
PDF = {https://tel.archives-ouvertes.fr/tel-00008087/document},
HAL_ID = {tel-00008087},
HAL_VERSION = {v1},

}

     
Conference's articles
  1. Jean-Claude Bermond, Lilian Chacon, David Coudert, and Francois Tillerot. Cycle Covering. In 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics, Vall de Nuria, Spain, pages 21-34, June 2001. Carleton Scientific. [WWW ] [PDF ] 
    @inproceedings{bermond:inria-00429183,
TITLE = {{Cycle Covering}},
AUTHOR = {Bermond, Jean-Claude and Chacon, Lilian and Coudert, David and Tillerot, Francois},
URL = {https://hal.inria.fr/inria-00429183},
BOOKTITLE = {{8th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
ADDRESS = {Vall de Nuria, Spain},
PUBLISHER = {{Carleton Scientific}},
SERIES = {Proceedings in Informatics},
PAGES = {21-34},
YEAR = {2001},
MONTH = Jun,
FILE = {https://hal.inria.fr/inria-00429183/file/BCCT-SIROCCO01.pdf},
PDF = {https://hal.inria.fr/inria-00429183/document},
HAL_ID = {inria-00429183},
HAL_VERSION = {v1},
X-PROCEEDINGS = {yes},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-INVITED-CONFERENCE = {no},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  2. Jean-Claude Bermond, David Coudert, Lilian Chacon, and Francois Tillerot. A note on cycle covering. In ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Greece, pages 310-311, 2001. ACM. [WWW ] [PDF ] 
    @inproceedings{bermond:inria-00429182,
TITLE = {{A note on cycle covering}},
AUTHOR = {Bermond, Jean-Claude and Coudert, David and Chacon, Lilian and Tillerot, Francois},
URL = {https://hal.inria.fr/inria-00429182},
BOOKTITLE = {{ACM Symposium on Parallel Algorithms and Architectures (SPAA)}},
ADDRESS = {Hersonissos, Greece},
PUBLISHER = {{ACM}},
PAGES = {310-311},
YEAR = {2001},
DOI = {10.1145/378580.378716},
FILE = {https://hal.inria.fr/inria-00429182/file/art2spaa.pdf},
PDF = {https://hal.inria.fr/inria-00429182/document},
HAL_ID = {inria-00429182},
HAL_VERSION = {v1},
X-PROCEEDINGS = {yes},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-INVITED-CONFERENCE = {no},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  3. David Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In 3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Saint Jean de Luz, France, pages 47-53, May 2001. [WWW ] [PDF ] 
    @inproceedings{coudert:inria-00429185,
TITLE = {{Chemins disjoints de poids minimum pour la s{\'e}curisation de r{\'e}seaux de t{\'e}l{\'e}communications}},
AUTHOR = {Coudert, David},
URL = {https://hal.inria.fr/inria-00429185},
BOOKTITLE = {{3eme Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications (AlgoTel)}},
ADDRESS = {Saint Jean de Luz, France},
PAGES = {47-53},
YEAR = {2001},
MONTH = May,
FILE = {https://hal.inria.fr/inria-00429185/file/dcoudert\_papier20.pdf},
PDF = {https://hal.inria.fr/inria-00429185/document},
HAL_ID = {inria-00429185},
HAL_VERSION = {v1},
X-PROCEEDINGS = {yes},
X-INTERNATIONAL-AUDIENCE = {no},
X-EDITORIAL-BOARD = {yes},
X-INVITED-CONFERENCE = {no},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  4. David Coudert and Xavier Munoz. How Graph Theory can help Communications Engineering. In D.K. Gautam, editor, Broad band optical fiber communications technology (BBOFCT), Jalgaon, India, pages 47-61, December 2001. [WWW ] [PDF ] 
    @inproceedings{coudert:inria-00429187,
TITLE = {{How Graph Theory can help Communications Engineering}},
AUTHOR = {Coudert, David and Munoz, Xavier},
URL = {https://hal.inria.fr/inria-00429187},
BOOKTITLE = {{Broad band optical fiber communications technology (BBOFCT)}},
ADDRESS = {Jalgaon, India},
EDITOR = {D.K. Gautam},
PAGES = {47-61},
YEAR = {2001},
MONTH = Dec,
FILE = {https://hal.inria.fr/inria-00429187/file/CM-BBOFCT01.pdf},
PDF = {https://hal.inria.fr/inria-00429187/document},
HAL_ID = {inria-00429187},
HAL_VERSION = {v1},
X-PROCEEDINGS = {yes},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-INVITED-CONFERENCE = {no},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
Internal reports
  1. Jean-Claude Bermond, David Coudert, and Min-Li Yu. On DRC-Covering of K_n by Cycles. Research Report RR-4299, INRIA, October 2001. [WWW ] [PDF ] 
    @techreport{bermond:inria-00072288,
TITLE = {{On DRC-Covering of K\_n by Cycles}},
AUTHOR = {Bermond, Jean-Claude and Coudert, David and Yu, Min-Li},
URL = {https://hal.inria.fr/inria-00072288},
TYPE = {Research Report},
NUMBER = {RR-4299},
INSTITUTION = {{INRIA}},
YEAR = {2001},
MONTH = Oct,
PDF = {https://hal.inria.fr/inria-00072288/document},
HAL_ID = {inria-00072288},
HAL_VERSION = {v1},

}

     


Disclaimer:

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 person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.



Last modified: Sun May 16 15:20:24 2021
Author: dcoudert.

This document was translated from BibTEX by bibtex2html