Publications of year 2016
Publications of year 2016
Articles in journal or book's chapters
  1. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, 2016. [WWW ] [PDF ]
    @article{coudert:hal-01323301,
    TITLE = {{Data center interconnection networks are not hyperbolic}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume},
    URL = {https://hal.inria.fr/hal-01323301},
    JOURNAL = {{Theoretical Computer Science}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {639},
    PAGES = {72-90},
    YEAR = {2016},
    DOI = {10.1016/j.tcs.2016.05.025},
    FILE = {https://hal.inria.fr/hal-01323301/file/data-centers--and--hyperbolicity.pdf},
    PDF = {https://hal.inria.fr/hal-01323301/document},
    HAL_ID = {hal-01323301},
    HAL_VERSION = {v1},
    X-INTERNATIONAL-AUDIENCE = {yes},
    X-EDITORIAL-BOARD = {yes},
    X-SCIENTIFIC-POPULARIZATION = {no},
    
    }
    

     
  2. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To Approximate Treewidth, Use Treelength!. SIAM Journal on Discrete Mathematics, 30(3):13, 2016. [WWW ] [PDF ]
    @article{coudert:hal-01348965,
    TITLE = {{To Approximate Treewidth, Use Treelength!}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas},
    URL = {https://hal.inria.fr/hal-01348965},
    JOURNAL = {{SIAM Journal on Discrete Mathematics}},
    PUBLISHER = {{Society for Industrial and Applied Mathematics}},
    VOLUME = {30},
    NUMBER = {3},
    PAGES = {13},
    YEAR = {2016},
    DOI = {10.1137/15M1034039},
    FILE = {https://hal.inria.fr/hal-01348965/file/treewidth-treelength.pdf},
    PDF = {https://hal.inria.fr/hal-01348965/document},
    HAL_ID = {hal-01348965},
    HAL_VERSION = {v1},
    X-INTERNATIONAL-AUDIENCE = {yes},
    X-EDITORIAL-BOARD = {yes},
    X-SCIENTIFIC-POPULARIZATION = {no},
    
    }
    

     
  3. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, 214:187-195, 2016. [WWW ] [PDF ]
    @article{coudert:hal-01220132,
    TITLE = {{On the hyperbolicity of bipartite graphs and intersection graphs}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume},
    URL = {https://hal.inria.fr/hal-01220132},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {214},
    PAGES = {187-195},
    YEAR = {2016},
    DOI = {10.1016/j.dam.2016.06.017},
    FILE = {https://hal.inria.fr/hal-01220132v2/file/bipartite.pdf},
    PDF = {https://hal.inria.fr/hal-01220132v2/document},
    HAL_ID = {hal-01220132},
    HAL_VERSION = {v2},
    X-INTERNATIONAL-AUDIENCE = {yes},
    X-EDITORIAL-BOARD = {yes},
    X-SCIENTIFIC-POPULARIZATION = {no},
    
    }
    

     
  4. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM Journal of Experimental Algorithmics, 21(1):23, 2016. [WWW ] [PDF ]
    @article{coudert:hal-01266496,
    TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth}},
    AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
    URL = {https://hal.inria.fr/hal-01266496},
    JOURNAL = {{ACM Journal of Experimental Algorithmics}},
    PUBLISHER = {{Association for Computing Machinery}},
    VOLUME = {21},
    NUMBER = {1},
    PAGES = {23},
    YEAR = {2016},
    DOI = {10.1145/2851494},
    FILE = {https://hal.inria.fr/hal-01266496/file/babpw-20151120.pdf},
    PDF = {https://hal.inria.fr/hal-01266496/document},
    HAL_ID = {hal-01266496},
    HAL_VERSION = {v1},
    X-INTERNATIONAL-AUDIENCE = {yes},
    X-EDITORIAL-BOARD = {yes},
    X-SCIENTIFIC-POPULARIZATION = {no},
    
    }
    

     
  5. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Combinatorial optimization in networks with Shared Risk Link Groups. Discrete Mathematics and Theoretical Computer Science, 18(3):25, May 2016. [WWW ] [PDF ]
    @article{coudert:hal-01053859,
    TITLE = {{Combinatorial optimization in networks with Shared Risk Link Groups}},
    AUTHOR = {Coudert, David and P{\'e}rennes, St{\'e}phane and Rivano, Herv{\'e} and Voge, Marie-Emilie},
    URL = {https://hal.inria.fr/hal-01053859},
    JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
    PUBLISHER = {{DMTCS}},
    VOLUME = {18},
    NUMBER = {3},
    PAGES = {25},
    YEAR = {2016},
    MONTH = May,
    FILE = {https://hal.inria.fr/hal-01053859v4/file/dmtcs-1420.pdf},
    PDF = {https://hal.inria.fr/hal-01053859v4/document},
    HAL_ID = {hal-01053859},
    HAL_VERSION = {v4},
    X-INTERNATIONAL-AUDIENCE = {yes},
    X-EDITORIAL-BOARD = {yes},
    X-SCIENTIFIC-POPULARIZATION = {no},
    
    }
    

     
Conference's articles
  1. Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, and Vassilis Zissimopoulos. Bin Packing with Colocations. In Klaus Jansen and Monaldo Mastrolilli, editors, 14th International Workshop on Approximation and Online Algorithms (WAOA), volume 10138, Aarhus, Denmark, pages 40-51, August 2016. Springer. [WWW ] [PDF ]
    @inproceedings{bermond:hal-01435614,
    TITLE = {{Bin Packing with Colocations}},
    AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
    URL = {https://hal.inria.fr/hal-01435614},
    BOOKTITLE = {{14th International Workshop on Approximation and Online Algorithms (WAOA)}},
    ADDRESS = {Aarhus, Denmark},
    EDITOR = {Klaus Jansen and Monaldo Mastrolilli},
    PUBLISHER = {{Springer}},
    VOLUME = {10138},
    PAGES = {40-51},
    YEAR = {2016},
    MONTH = Aug,
    DOI = {10.1007/978-3-319-51741-4\_4},
    FILE = {https://hal.inria.fr/hal-01435614/file/revjcb.pdf},
    PDF = {https://hal.inria.fr/hal-01435614/document},
    HAL_ID = {hal-01435614},
    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 and Guillaume Ducoffe. Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données. In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, May 2016. [WWW ] [PDF ]
    @inproceedings{coudert:hal-01302470,
    TITLE = {{Liens entre sym{\'e}tries et {\'e}tirements de routages dans les r{\'e}seaux d'interconnexions de centres de donn{\'e}es}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume},
    URL = {https://hal.archives-ouvertes.fr/hal-01302470},
    BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
    ADDRESS = {Bayonne, France},
    YEAR = {2016},
    MONTH = May,
    FILE = {https://hal.archives-ouvertes.fr/hal-01302470/file/art-algotel-DChyp-final.pdf},
    PDF = {https://hal.archives-ouvertes.fr/hal-01302470/document},
    HAL_ID = {hal-01302470},
    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, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, and Vassilis Zissimopoulos. Bin packing with colocations. Research Report, Inria ; I3S, October 2016. [WWW ] [PDF ]
    @techreport{bermond:hal-01381333,
    TITLE = {{Bin packing with colocations}},
    AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
    URL = {https://hal.inria.fr/hal-01381333},
    TYPE = {Research Report},
    INSTITUTION = {{Inria ; I3S}},
    YEAR = {2016},
    MONTH = Oct,
    DOI = {10.1007/978-3-319-51741-4\_4},
    FILE = {https://hal.inria.fr/hal-01381333v2/file/REV150318.pdf},
    PDF = {https://hal.inria.fr/hal-01381333v2/document},
    HAL_ID = {hal-01381333},
    HAL_VERSION = {v2},
    
    }
    

     
  2. David Coudert and Guillaume Ducoffe. Clique-decomposition revisited. Research Report, INRIA Sophia Antipolis - I3S, February 2016. [WWW ] [PDF ]
    @techreport{coudert:hal-01266147,
    TITLE = {{Clique-decomposition revisited}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume},
    URL = {https://hal.archives-ouvertes.fr/hal-01266147},
    TYPE = {Research Report},
    INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
    YEAR = {2016},
    MONTH = Feb,
    FILE = {https://hal.archives-ouvertes.fr/hal-01266147/file/clique-decomposition-revisited.pdf},
    PDF = {https://hal.archives-ouvertes.fr/hal-01266147/document},
    HAL_ID = {hal-01266147},
    HAL_VERSION = {v1},
    
    }
    

     
  3. David Coudert. A note on Integer Linear Programming formulations for linear ordering problems on graphs. Research Report, Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS, February 2016. [WWW ] [PDF ]
    @techreport{coudert:hal-01271838,
    TITLE = {{A note on Integer Linear Programming formulations for linear ordering problems on graphs}},
    AUTHOR = {Coudert, David},
    URL = {https://hal.inria.fr/hal-01271838},
    TYPE = {Research Report},
    PAGES = {33},
    INSTITUTION = {{Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS}},
    YEAR = {2016},
    MONTH = Feb,
    FILE = {https://hal.inria.fr/hal-01271838/file/cwmip.pdf},
    PDF = {https://hal.inria.fr/hal-01271838/document},
    HAL_ID = {hal-01271838},
    HAL_VERSION = {v1},
    
    }
    

     
  4. David Coudert, Guillaume Ducoffe, Nicolas Nisse, and Mauricio Soto. Distance-preserving orderings in graphs. Research Report RR-8973, Inria Sophia Antipolis, 2016. [WWW ] [PDF ]
    @techreport{coudert:hal-01393523,
    TITLE = {{Distance-preserving orderings in graphs}},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas and Soto, Mauricio},
    URL = {https://hal.inria.fr/hal-01393523},
    TYPE = {Research Report},
    NUMBER = {RR-8973},
    PAGES = {1-23},
    INSTITUTION = {{Inria Sophia Antipolis}},
    YEAR = {2016},
    FILE = {https://hal.inria.fr/hal-01393523v2/file/dpo\_RR2019%281                   0xffa1e7b8df},
    PDF = {https://hal.inria.fr/hal-01393523v2/document},
    HAL_ID = {hal-01393523},
    HAL_VERSION = {v2},
    
    }
    

     
  5. David Coudert, James Luedtke, Eduardo Moreno, and Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. Research Report, Inria Sophia Antipolis ; I3S, November 2016. [WWW ] [PDF ]
    @techreport{coudert:hal-01394593,
    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-01394593},
    TYPE = {Research Report},
    PAGES = {9},
    INSTITUTION = {{Inria Sophia Antipolis ; I3S}},
    YEAR = {2016},
    MONTH = Nov,
    FILE = {https://hal.inria.fr/hal-01394593/file/backhaul-rr.pdf},
    PDF = {https://hal.inria.fr/hal-01394593/document},
    HAL_ID = {hal-01394593},
    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