Publications of year 2017
Publications of year 2017
Articles in journal or book's chapters
  1. Nathann Cohen and David Coudert. Le défi des 1001 graphes. Interstices, December 2017. [WWW ] 
    @article{cohen:hal-01662565,
TITLE = {{Le d{\'e}fi des 1001 graphes}},
AUTHOR = {Cohen, Nathann and Coudert, David},
URL = {https://hal.inria.fr/hal-01662565},
JOURNAL = {{Interstices}},
PUBLISHER = {{INRIA}},
YEAR = {2017},
MONTH = Dec,
HAL_ID = {hal-01662565},
HAL_VERSION = {v1},
X-INTERNATIONAL-AUDIENCE = {no},
X-EDITORIAL-BOARD = {yes},
X-SCIENTIFIC-POPULARIZATION = {yes},

}

     
  2. Nathann Cohen, David Coudert, Guillaume Ducoffe, and Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. Theoretical Computer Science, 690:114-139, 2017. [WWW ] [PDF ] 
    @article{cohen:hal-01540756,
TITLE = {{Applying clique-decomposition for computing Gromov hyperbolicity}},
AUTHOR = {Cohen, Nathann and Coudert, David and Ducoffe, Guillaume and Lancin, Aur{\'e}lien},
URL = {https://hal.inria.fr/hal-01540756},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {690},
PAGES = {114-139},
YEAR = {2017},
DOI = {10.1016/j.tcs.2017.06.001},
FILE = {https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf},
PDF = {https://hal.inria.fr/hal-01540756/document},
HAL_ID = {hal-01540756},
HAL_VERSION = {v1},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  3. Brigitte Jaumard, Mejdi Kaddour, Alvinice Kodjo, Napoleão Nepomuceno, and David Coudert. Cost-effective Bandwidth Provisioning in Microwave Wireless Networks under Unreliable Channel Conditions. Pesquisa Operacional, 37(3):525 - 544, September 2017. [WWW ] [PDF ] 
    @article{jaumard:hal-01738156,
TITLE = {{Cost-effective Bandwidth Provisioning in Microwave Wireless Networks under Unreliable Channel Conditions}},
AUTHOR = {Jaumard, Brigitte and Kaddour, Mejdi and Kodjo, Alvinice and Nepomuceno, Napole{\~a}o and Coudert, David},
URL = {https://hal.inria.fr/hal-01738156},
JOURNAL = {{Pesquisa Operacional}},
PUBLISHER = {{Sociedade Brasileira de Pesquisa Operacional}},
VOLUME = {37},
NUMBER = {3},
PAGES = {525 - 544},
YEAR = {2017},
MONTH = Sep,
DOI = {10.1590/0101-7438.2017.037.03.0525},
FILE = {https://hal.inria.fr/hal-01738156/file/Microwave-PO-HAL.pdf},
PDF = {https://hal.inria.fr/hal-01738156/document},
HAL_ID = {hal-01738156},
HAL_VERSION = {v1},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  4. Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluis Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, and Piet Demeester. Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Network, pp 12 - 22, 2017. [WWW ] [PDF ] 
    @article{sahhaf:hal-01547511,
TITLE = {{Routing at Large Scale: Advances and Challenges for Complex Networks}},
AUTHOR = {Sahhaf, Sahel and Tavernier, Wouter and Papadimitriou, Dimitri and Careglio, Davide and Kumar, Alok and Glacet, Christian and Coudert, David and Nisse, Nicolas and F{\`a}brega, Lluis and Vil{\`a}, Pere and Camelo, Miguel and Audenaert, Pieter and Colle, Didier and Demeester, Piet},
URL = {https://hal.inria.fr/hal-01547511},
JOURNAL = {{IEEE Network}},
PUBLISHER = {{Institute of Electrical and Electronics Engineers}},
PAGES = {12 - 22},
YEAR = {2017},
DOI = {10.1109/MNET.2017.1600203},
FILE = {https://hal.inria.fr/hal-01547511/file/network.pdf},
PDF = {https://hal.inria.fr/hal-01547511/document},
HAL_ID = {hal-01547511},
HAL_VERSION = {v1},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
Conference's articles
  1. David Coudert and Guillaume Ducoffe. A simple approach for lower-bounding the distortion in any Hyperbolic embedding. In EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, volume 61, Vienna, Austria, pages 293 - 299, August 2017. Elsevier. [WWW ] [PDF ] 
    @inproceedings{coudert:hal-01573042,
TITLE = {{A simple approach for lower-bounding the distortion in any Hyperbolic embedding}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01573042},
BOOKTITLE = {{EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications}},
ADDRESS = {Vienna, Austria},
PUBLISHER = {{Elsevier}},
VOLUME = {61},
PAGES = {293 - 299},
YEAR = {2017},
MONTH = Aug,
DOI = {10.1016/j.endm.2017.06.051},
FILE = {https://hal.inria.fr/hal-01573042/file/CouDuc--EUROCOMB17.pdf},
PDF = {https://hal.inria.fr/hal-01573042/document},
HAL_ID = {hal-01573042},
HAL_VERSION = {v1},
X-PROCEEDINGS = {yes},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
X-INVITED-CONFERENCE = {no},
X-SCIENTIFIC-POPULARIZATION = {no},

}

     
  2. David Coudert, James Luedtke, Eduardo Moreno, and Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. In International Network Optimization Conference, volume 64 of Electronic Notes in Discrete Mathematics, Lisbon, Portugal, pages 85-94, February 2017. Elsevier. [WWW ] [PDF ] 
    @inproceedings{coudert:hal-01593041,
TITLE = {{Computing and maximizing the exact reliability of wireless backhaul networks}},
AUTHOR = {Coudert, David and Luedtke, James and Moreno, Eduardo and Priftis, Konstantinos},
URL = {https://hal.inria.fr/hal-01593041},
BOOKTITLE = {{International Network Optimization Conference}},
ADDRESS = {Lisbon, Portugal},
PUBLISHER = {{Elsevier}},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {64},
PAGES = {85-94},
YEAR = {2017},
MONTH = Feb,
DOI = {10.1016/j.endm.2018.01.010},
FILE = {https://hal.inria.fr/hal-01593041/file/backhaul.pdf},
PDF = {https://hal.inria.fr/hal-01593041/document},
HAL_ID = {hal-01593041},
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. David Coudert, Guillaume Ducoffe, and Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Research Report, Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania, July 2017.
    Note: Https://arxiv.org/abs/1707.05016. [WWW ] [PDF ] 
    @techreport{coudert:hal-01562413,
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.archives-ouvertes.fr/hal-01562413},
NOTE = {https://arxiv.org/abs/1707.05016},
TYPE = {Research Report},
PAGES = {1-60},
INSTITUTION = {{Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania}},
YEAR = {2017},
MONTH = Jul,
FILE = {https://hal.archives-ouvertes.fr/hal-01562413v2/file/pfpt.pdf},
PDF = {https://hal.archives-ouvertes.fr/hal-01562413v2/document},
HAL_ID = {hal-01562413},
HAL_VERSION = {v2},

}

     


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