Articles in journal or book's chapters |
-
David Coudert and Guillaume Ducoffe.
Revisiting Decomposition by Clique Separators.
SIAM Journal on Discrete Mathematics,
32(1):682 - 694,
January 2018.
[WWW
] [PDF
]
@article{coudert:hal-01753324, TITLE = {{Revisiting Decomposition by Clique Separators}}, AUTHOR = {Coudert, David and Ducoffe, Guillaume}, URL = {https://hal.inria.fr/hal-01753324}, JOURNAL = {{SIAM Journal on Discrete Mathematics}}, PUBLISHER = {{Society for Industrial and Applied Mathematics}}, VOLUME = {32}, NUMBER = {1}, PAGES = {682 - 694}, YEAR = {2018}, MONTH = Jan, DOI = {10.1137/16M1059837}, FILE = {https://hal.inria.fr/hal-01753324/file/decomposition\_by\_clique\_separators.pdf}, PDF = {https://hal.inria.fr/hal-01753324/document}, HAL_ID = {hal-01753324}, HAL_VERSION = {v1}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-SCIENTIFIC-POPULARIZATION = {no}, }
-
David Coudert,
Guillaume Ducoffe,
Nicolas Nisse,
and Mauricio Soto.
On distance-preserving elimination orderings in graphs: Complexity and algorithms.
Discrete Applied Mathematics,
243:140-153,
March 2018.
[WWW
] [PDF
]
@article{coudert:hal-01741277, TITLE = {{On distance-preserving elimination orderings in graphs: Complexity and algorithms}}, AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas and Soto, Mauricio}, URL = {https://hal.inria.fr/hal-01741277}, JOURNAL = {{Discrete Applied Mathematics}}, PUBLISHER = {{Elsevier}}, VOLUME = {243}, PAGES = {140-153}, YEAR = {2018}, MONTH = Mar, DOI = {10.1016/j.dam.2018.02.007}, FILE = {https://hal.inria.fr/hal-01741277/file/dpo-hal.pdf}, PDF = {https://hal.inria.fr/hal-01741277/document}, HAL_ID = {hal-01741277}, HAL_VERSION = {v1}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-SCIENTIFIC-POPULARIZATION = {no}, }
Conference's articles |
-
David Coudert,
Guillaume Ducoffe,
and Alexandru Popa.
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.
In ACM-SIAM Symposium on Discrete Algorithms,
New Orleans, United States,
pages 20,
January 2018.
SIAM.
[WWW
] [PDF
]
@inproceedings{coudert:hal-01676187, TITLE = {{Fully polynomial FPT algorithms for some classes of bounded clique-width graphs}}, AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru}, URL = {https://hal.inria.fr/hal-01676187}, BOOKTITLE = {{ACM-SIAM Symposium on Discrete Algorithms}}, ADDRESS = {New Orleans, United States}, PUBLISHER = {{SIAM}}, PAGES = {20}, YEAR = {2018}, MONTH = Jan, DOI = {10.1137/1.9781611975031.176}, FILE = {https://hal.inria.fr/hal-01676187/file/P-FPT-2018.pdf}, PDF = {https://hal.inria.fr/hal-01676187/document}, HAL_ID = {hal-01676187}, HAL_VERSION = {v1}, X-PROCEEDINGS = {yes}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-INVITED-CONFERENCE = {no}, X-SCIENTIFIC-POPULARIZATION = {no}, }
-
Huy Duong,
Brigitte Jaumard,
David Coudert,
and Ron Armolavicius.
Modèle d'optimisation pour la défragmentation de la capacité.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
@inproceedings{duong:hal-01773572, TITLE = {{Mod{\`e}le d'optimisation pour la d{\'e}fragmentation de la capacit{\'e}}}, AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron}, URL = {https://hal.inria.fr/hal-01773572}, BOOKTITLE = {{ALGOTEL 2018 - 20{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}}, ADDRESS = {Roscoff, France}, YEAR = {2018}, MONTH = May, FILE = {https://hal.inria.fr/hal-01773572v2/file/Algotel\_2018\_final.pdf}, PDF = {https://hal.inria.fr/hal-01773572v2/document}, HAL_ID = {hal-01773572}, HAL_VERSION = {v2}, X-PROCEEDINGS = {yes}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-INVITED-CONFERENCE = {no}, X-SCIENTIFIC-POPULARIZATION = {no}, }
-
Huy Duong,
Brigitte Jaumard,
David Coudert,
and Ron Armolavicius.
Efficient Make Before Break Capacity Defragmentation.
In IEEE International Conference on High Performance Switching and Routing,
Bucharest, Romania,
pages 6,
June 2018.
IEEE.
[WWW
] [PDF
]
@inproceedings{duong:hal-01930552, TITLE = {{Efficient Make Before Break Capacity Defragmentation}}, AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Ron}, URL = {https://hal.inria.fr/hal-01930552}, BOOKTITLE = {{IEEE International Conference on High Performance Switching and Routing}}, ADDRESS = {Bucharest, Romania}, PUBLISHER = {{IEEE}}, PAGES = {6}, YEAR = {2018}, MONTH = Jun, DOI = {10.1109/HPSR.2018.8850754}, FILE = {https://hal.inria.fr/hal-01930552/file/HPSR\_2018\_final.pdf}, PDF = {https://hal.inria.fr/hal-01930552/document}, HAL_ID = {hal-01930552}, HAL_VERSION = {v1}, X-PROCEEDINGS = {yes}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-INVITED-CONFERENCE = {no}, X-SCIENTIFIC-POPULARIZATION = {no}, }
-
Brigitte Jaumard,
Hamed Pouya,
and David Coudert.
Make-Before-Break Wavelength Defragmentation.
In 20th International Conference on Transparent Optical Networks (ICTON),
Bucharest, Romania,
pages 5,
July 2018.
IEEE.
[WWW
] [PDF
]
@inproceedings{jaumard:hal-01883689, TITLE = {{Make-Before-Break Wavelength Defragmentation}}, AUTHOR = {Jaumard, Brigitte and Pouya, Hamed and Coudert, David}, URL = {https://hal.inria.fr/hal-01883689}, BOOKTITLE = {{20th International Conference on Transparent Optical Networks (ICTON)}}, ADDRESS = {Bucharest, Romania}, PUBLISHER = {{IEEE}}, PAGES = {5}, YEAR = {2018}, MONTH = Jul, DOI = {10.1109/ICTON.2018.8473893}, FILE = {https://hal.inria.fr/hal-01883689/file/ICTON\_Defrag\_2018.pdf}, PDF = {https://hal.inria.fr/hal-01883689/document}, HAL_ID = {hal-01883689}, HAL_VERSION = {v1}, X-PROCEEDINGS = {yes}, X-INTERNATIONAL-AUDIENCE = {yes}, X-EDITORIAL-BOARD = {yes}, X-INVITED-CONFERENCE = {yes}, X-SCIENTIFIC-POPULARIZATION = {no}, }
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