Publications of year 2017

BACK TO COATI PUBLICATION INDEX

Publications of year 2017

Thesis
  1. Nicolas Huin. Energy efficient software defined networks. Theses, Université Côte d'Azur, September 2017. [WWW ] [PDF ]
    Keywords: Energy aware routing, Software defined networks, Virtualization, Économie d'énergie, Routage vert, Réseaux pilotés par logiciel, Virtualisation.
    @phdthesis{huin:tel-01679263,
    TITLE = {{Energy efficient software defined networks}},
    AUTHOR = {Huin, Nicolas},
    URL = {https://tel.archives-ouvertes.fr/tel-01679263},
    NUMBER = {2017AZUR4080},
    SCHOOL = {{Universit{\'e} C{\^o}te d'Azur}},
    YEAR = {2017},
    MONTH = Sep,
    KEYWORDS = {Energy aware routing ; Software defined networks ; Virtualization ; {\'E}conomie d'{\'e}nergie ; Routage vert ; R{\'e}seaux pilot{\'e}s par logiciel ; Virtualisation},
    TYPE = {Theses},
    PDF = {https://tel.archives-ouvertes.fr/tel-01679263/file/2017AZUR4080.pdf},
    HAL_ID = {tel-01679263},
    HAL_VERSION = {v1},
    
    }
    

     
Articles in journal or book's chapters
  1. Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, and Nicolas Trotignon. Colouring graphs with constraints on connectivity. Journal of Graph Theory, 85(4):814-838, 2017. [WWW ] [PDF ]
    Keywords: colouring, local connectivity, local edge-connectivity, Brooks' theorem, minimally k-connected, vertex degree.
    @article{aboulker:hal-01570035,
    TITLE = {{Colouring graphs with constraints on connectivity}},
    AUTHOR = {Aboulker, Pierre and Brettell, Nick and Havet, Fr{\'e}d{\'e}ric and Marx, D{\'a}niel and Trotignon, Nicolas},
    URL = {https://hal.inria.fr/hal-01570035},
    JOURNAL = {{Journal of Graph Theory}},
    PUBLISHER = {{Wiley}},
    VOLUME = {85},
    NUMBER = {4},
    PAGES = {814-838},
    YEAR = {2017},
    DOI = {10.1002/jgt.22109},
    KEYWORDS = {colouring ; local connectivity ; local edge-connectivity ; Brooks' theorem ; minimally k-connected ; vertex degree},
    PDF = {https://hal.inria.fr/hal-01570035/file/colourConnectivity.pdf},
    HAL_ID = {hal-01570035},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, and Nicolas Trotignon. Colouring graphs with constraints on connectivity. Journal of Graph Theory, 85(4):814-838, 2017. [WWW ] [PDF ]
    Keywords: colouring, local connectivity, local edge-connectivity, Brooks' theorem, minimally k-connected, vertex degree.
    @article{aboulker:hal-01570035,
    TITLE = {{Colouring graphs with constraints on connectivity}},
    AUTHOR = {Aboulker, Pierre and Brettell, Nick and Havet, Fr{\'e}d{\'e}ric and Marx, D{\'a}niel and Trotignon, Nicolas},
    URL = {https://hal.inria.fr/hal-01570035},
    JOURNAL = {{Journal of Graph Theory}},
    PUBLISHER = {{Wiley}},
    VOLUME = {85},
    NUMBER = {4},
    PAGES = {814-838},
    YEAR = {2017},
    DOI = {10.1002/jgt.22109},
    KEYWORDS = {colouring ; local connectivity ; local edge-connectivity ; Brooks' theorem ; minimally k-connected ; vertex degree},
    PDF = {https://hal.inria.fr/hal-01570035/file/colourConnectivity.pdf},
    HAL_ID = {hal-01570035},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, and Richard Stotz. Scheduling on power-heterogeneous processors. Information and Computation, 257:22-33, December 2017. [WWW ] [PDF ]
    @article{albers:hal-01668736,
    TITLE = {{Scheduling on power-heterogeneous processors}},
    AUTHOR = {Albers, Susanne and Bampis, Evripidis and Letsios, Dimitrios and Lucarelli, Giorgio and Stotz, Richard},
    URL = {https://hal.inria.fr/hal-01668736},
    JOURNAL = {{Information and Computation}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {257},
    PAGES = {22-33},
    YEAR = {2017},
    MONTH = Dec,
    DOI = {10.1016/j.ic.2017.09.013},
    PDF = {https://hal.inria.fr/hal-01668736/file/journal.pdf},
    HAL_ID = {hal-01668736},
    HAL_VERSION = {v1},
    
    }
    

     
  4. Emma Barme, Julien Bensmail, Jakub Przybylo, and Mariusz Wozniak. On a directed variation of the 1-2-3 and 1-2 Conjectures. Discrete Applied Mathematics, 217(2):123-131, January 2017. [WWW ] [PDF ]
    @article{barme:hal-01175756,
    TITLE = {{On a directed variation of the 1-2-3 and 1-2 Conjectures}},
    AUTHOR = {Barme, Emma and Bensmail, Julien and Przybylo, Jakub and Wo{\'z}niak, Mariusz},
    URL = {https://hal.archives-ouvertes.fr/hal-01175756},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {217},
    NUMBER = {2},
    PAGES = {123-131},
    YEAR = {2017},
    MONTH = Jan,
    PDF = {https://hal.archives-ouvertes.fr/hal-01175756/file/luczak-v2.pdf},
    HAL_ID = {hal-01175756},
    HAL_VERSION = {v3},
    
    }
    

     
  5. Olivier Baudon, Julien Bensmail, Florent Foucaud, and Monika Pilsniak. Structural properties of recursively partitionable graphs with connectivity 2. Discussiones Mathematicae Graph Theory, 37:89-115, February 2017. [WWW ] [PDF ]
    Keywords: balloon graph, graph with connectivity 2, online arbitrarily partitionable graph, recursively arbitrarily partitionable graph, balloon, structural properties.
    @article{baudon:hal-00672505,
    TITLE = {{Structural properties of recursively partitionable graphs with connectivity 2}},
    AUTHOR = {Baudon, Olivier and Bensmail, Julien and Foucaud, Florent and Pilsniak, Monika},
    URL = {https://hal.archives-ouvertes.fr/hal-00672505},
    JOURNAL = {{Discussiones Mathematicae Graph Theory}},
    PUBLISHER = {{University of Zielona G{\'o}ra}},
    VOLUME = {37},
    PAGES = {89-115},
    YEAR = {2017},
    MONTH = Feb,
    DOI = {10.7151/dmgt.1925},
    KEYWORDS = {balloon graph ; graph with connectivity 2 ; online arbitrarily partitionable graph ; recursively arbitrarily partitionable graph ; balloon ; structural properties},
    PDF = {https://hal.archives-ouvertes.fr/hal-00672505/file/bbfp12-orbit.pdf},
    HAL_ID = {hal-00672505},
    HAL_VERSION = {v4},
    
    }
    

     
  6. Julien Bensmail, Christopher Duffy, and Sagnik Sen. Analogues of Cliques for (m,n)-colored Mixed Graphs. Graphs and Combinatorics, 33(4):735--750, May 2017. [WWW ] [PDF ]
    Keywords: graph homomorphisms, planar graphs, colored mixed graphs, signed graphs, graph homomorphism, chromatic number, clique number.
    @article{bensmail:hal-01078218,
    TITLE = {{Analogues of Cliques for (m,n)-colored Mixed Graphs}},
    AUTHOR = {Bensmail, Julien and Duffy, Christopher and Sen, Sagnik},
    URL = {https://hal.archives-ouvertes.fr/hal-01078218},
    JOURNAL = {{Graphs and Combinatorics}},
    PUBLISHER = {{Springer Verlag}},
    VOLUME = {33},
    NUMBER = {4},
    PAGES = {735--750},
    YEAR = {2017},
    MONTH = May,
    DOI = {10.1007/s00373-017-1807-2},
    KEYWORDS = {graph homomorphisms ; planar graphs ; colored mixed graphs ; signed graphs ; graph homomorphism ; chromatic number ; clique number},
    PDF = {https://hal.archives-ouvertes.fr/hal-01078218/file/BDS_May18.pdf},
    HAL_ID = {hal-01078218},
    HAL_VERSION = {v3},
    
    }
    

     
  7. Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le, Binlong Li, and Nicolas Lichiardopol. Disjoint cycles of different lengths in graphs and digraphs. The Electronic Journal of Combinatorics, 24(4), December 2017. [WWW ] [PDF ]
    Keywords: minimum degree, vertex-disjoint cycles, different lengths.
    @article{bensmail:hal-01653334,
    TITLE = {{Disjoint cycles of different lengths in graphs and digraphs}},
    AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Ngoc Khang and Li, Binlong and Lichiardopol, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01653334},
    JOURNAL = {{The Electronic Journal of Combinatorics}},
    PUBLISHER = {{Open Journal Systems}},
    VOLUME = {24},
    NUMBER = {4},
    YEAR = {2017},
    MONTH = Dec,
    KEYWORDS = {minimum degree ; vertex-disjoint cycles ; different lengths},
    PDF = {https://hal.archives-ouvertes.fr/hal-01653334/file/distinct-lengths.pdf},
    HAL_ID = {hal-01653334},
    HAL_VERSION = {v1},
    
    }
    

     
  8. Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, and Stéphan Thomassé. A Proof of the Barát--Thomassen Conjecture. Journal of Combinatorial Theory, Series B, 124:39 - 55, May 2017. [WWW ] [PDF ]
    Keywords: large edge-connectivity, Barát-Thomassen Conjecture, tree-decomposition.
    @article{bensmail:hal-01629943,
    TITLE = {{A Proof of the Bar{\'a}t--Thomassen Conjecture}},
    AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Tien-Nam and Merker, Martin and Thomass{\'e}, St{\'e}phan},
    URL = {https://hal.archives-ouvertes.fr/hal-01629943},
    JOURNAL = {{Journal of Combinatorial Theory, Series B}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {124},
    PAGES = {39 - 55},
    YEAR = {2017},
    MONTH = May,
    DOI = {10.1016/j.jctb.2016.12.006},
    KEYWORDS = {large edge-connectivity ; Bar{\'a}t-Thomassen Conjecture ; tree-decomposition},
    PDF = {https://hal.archives-ouvertes.fr/hal-01629943/file/RevisedVersion.pdf},
    HAL_ID = {hal-01629943},
    HAL_VERSION = {v1},
    
    }
    

     
  9. Julien Bensmail, Martin Merker, and Carsten Thomassen. Decomposing graphs into a constant number of locally irregular subgraphs. European Journal of Combinatorics, 60:124 - 134, February 2017. [WWW ] [PDF ]
    @article{bensmail:hal-01629938,
    TITLE = {{Decomposing graphs into a constant number of locally irregular subgraphs}},
    AUTHOR = {Bensmail, Julien and Merker, Martin and Thomassen, Carsten},
    URL = {https://hal.archives-ouvertes.fr/hal-01629938},
    JOURNAL = {{European Journal of Combinatorics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {60},
    PAGES = {124 - 134},
    YEAR = {2017},
    MONTH = Feb,
    DOI = {10.1016/j.ejc.2016.09.011},
    PDF = {https://hal.archives-ouvertes.fr/hal-01629938/file/LocIrr0709.pdf},
    HAL_ID = {hal-01629938},
    HAL_VERSION = {v1},
    
    }
    

     
  10. Julien Bensmail. On q-power cycles in cubic graphs. Discussiones Mathematicae Graph Theory, 37(1):211 - 220, 2017. [WWW ] [PDF ]
    @article{bensmail:hal-01629942,
    TITLE = {{On q-power cycles in cubic graphs}},
    AUTHOR = {Bensmail, Julien},
    URL = {https://hal.archives-ouvertes.fr/hal-01629942},
    JOURNAL = {{Discussiones Mathematicae Graph Theory}},
    PUBLISHER = {{University of Zielona G{\'o}ra}},
    VOLUME = {37},
    NUMBER = {1},
    PAGES = {211 - 220},
    YEAR = {2017},
    DOI = {10.7151/dmgt.1926},
    PDF = {https://hal.archives-ouvertes.fr/hal-01629942/file/qpower-orbit.pdf},
    HAL_ID = {hal-01629942},
    HAL_VERSION = {v1},
    
    }
    

     
  11. Julien Bensmail, Soumen Nandi, and Sagnik Sen. On oriented cliques with respect to push operation. Discrete Applied Mathematics, 232:50 - 63, December 2017. [WWW ] [PDF ]
    Keywords: oriented graphs, oriented cliques, push operation, planar graphs.
    @article{bensmail:hal-01629946,
    TITLE = {{On oriented cliques with respect to push operation}},
    AUTHOR = {Bensmail, Julien and Nandi, Soumen and Sen, Sagnik},
    URL = {https://hal.archives-ouvertes.fr/hal-01629946},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {232},
    PAGES = {50 - 63},
    YEAR = {2017},
    MONTH = Dec,
    DOI = {10.1016/j.dam.2017.07.037},
    KEYWORDS = {oriented graphs ; oriented cliques ; push operation ; planar graphs},
    PDF = {https://hal.archives-ouvertes.fr/hal-01629946/file/BNS_DAM_v6.pdf},
    HAL_ID = {hal-01629946},
    HAL_VERSION = {v1},
    
    }
    

     
  12. Julien Bensmail, Mohammed Senhaji, and Kasper Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discrete Mathematics and Theoretical Computer Science, 19(1), August 2017. [WWW ] [PDF ]
    Keywords: equitable edge-weightings, 1-2-3 Conjecture, Antimagic Labelling Conjecture.
    @article{bensmail:hal-01361482,
    TITLE = {{On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture}},
    AUTHOR = {Bensmail, Julien and Senhaji, Mohammed and Szabo Lyngsie, Kasper},
    URL = {https://hal.archives-ouvertes.fr/hal-01361482},
    JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
    PUBLISHER = {{DMTCS}},
    VOLUME = {19},
    NUMBER = {1},
    YEAR = {2017},
    MONTH = Aug,
    KEYWORDS = {equitable edge-weightings ; 1-2-3 Conjecture ; Antimagic Labelling Conjecture},
    PDF = {https://hal.archives-ouvertes.fr/hal-01361482/file/123-injective.pdf},
    HAL_ID = {hal-01361482},
    HAL_VERSION = {v3},
    
    }
    

     
  13. Julien Bensmail, Mohammed Senhaji, and Kasper Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discrete Mathematics and Theoretical Computer Science, 19(1), August 2017. [WWW ] [PDF ]
    Keywords: equitable edge-weightings, 1-2-3 Conjecture, Antimagic Labelling Conjecture.
    @article{bensmail:hal-01361482,
    TITLE = {{On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture}},
    AUTHOR = {Bensmail, Julien and Senhaji, Mohammed and Szabo Lyngsie, Kasper},
    URL = {https://hal.archives-ouvertes.fr/hal-01361482},
    JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
    PUBLISHER = {{DMTCS}},
    VOLUME = {19},
    NUMBER = {1},
    YEAR = {2017},
    MONTH = Aug,
    KEYWORDS = {equitable edge-weightings ; 1-2-3 Conjecture ; Antimagic Labelling Conjecture},
    PDF = {https://hal.archives-ouvertes.fr/hal-01361482/file/123-injective.pdf},
    HAL_ID = {hal-01361482},
    HAL_VERSION = {v3},
    
    }
    

     
  14. Lélia Blin, Janna Burman, and Nicolas Nisse. Exclusive Graph Searching. Algorithmica, 77(3):942-969, 2017. [WWW ] [PDF ]
    @article{blin:hal-01266492,
    TITLE = {{Exclusive Graph Searching}},
    AUTHOR = {Blin, L{\'e}lia and Burman, Janna and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01266492},
    JOURNAL = {{Algorithmica}},
    PUBLISHER = {{Springer Verlag}},
    VOLUME = {77},
    NUMBER = {3},
    PAGES = {942-969},
    YEAR = {2017},
    DOI = {10.1007/s00453-016-0124-0},
    PDF = {https://hal.archives-ouvertes.fr/hal-01266492/file/ExclusiveGraphSearch.pdf},
    HAL_ID = {hal-01266492},
    HAL_VERSION = {v1},
    
    }
    

     
  15. Lélia Blin, Janna Burman, and Nicolas Nisse. Exclusive Graph Searching. Algorithmica, 77(3):942-969, 2017. [WWW ] [PDF ]
    @article{blin:hal-01266492,
    TITLE = {{Exclusive Graph Searching}},
    AUTHOR = {Blin, L{\'e}lia and Burman, Janna and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01266492},
    JOURNAL = {{Algorithmica}},
    PUBLISHER = {{Springer Verlag}},
    VOLUME = {77},
    NUMBER = {3},
    PAGES = {942-969},
    YEAR = {2017},
    DOI = {10.1007/s00453-016-0124-0},
    PDF = {https://hal.archives-ouvertes.fr/hal-01266492/file/ExclusiveGraphSearch.pdf},
    HAL_ID = {hal-01266492},
    HAL_VERSION = {v1},
    
    }
    

     
  16. Nathann Cohen and David Coudert. Le défi des 1001 graphes. Interstices, December 2017. [WWW ]
    Keywords: théorie des graphes, cycle hamiltonien, algorithmes.
    @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,
    KEYWORDS = {th{\'e}orie des graphes ; cycle hamiltonien ; algorithmes},
    HAL_ID = {hal-01662565},
    HAL_VERSION = {v1},
    
    }
    

     
  17. 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 ]
    Keywords: clique-decomposition, graph algorithms, outerplanar graphs, Gromov hyperbolicity.
    @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},
    KEYWORDS = {clique-decomposition ; graph algorithms ; outerplanar graphs ; Gromov hyperbolicity},
    PDF = {https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf},
    HAL_ID = {hal-01540756},
    HAL_VERSION = {v1},
    
    }
    

     
  18. Nathann Cohen, David Coudert, Guillaume Ducoffe, and Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. Theoretical Computer Science, 2017. [WWW ] [PDF ]
    Keywords: outerplanar graphs, Gromov hyperbolicity, graph algorithms, clique-decomposition.
    @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}},
    YEAR = {2017},
    DOI = {10.1016/j.tcs.2017.06.001},
    KEYWORDS = {outerplanar graphs ; Gromov hyperbolicity ; graph algorithms ; clique-decomposition},
    PDF = {https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf},
    HAL_ID = {hal-01540756},
    HAL_VERSION = {v1},
    
    }
    

     
  19. Nathann Cohen, Frédéric Havet, William Lochet, and Raul Lopes. Bispindle in strongly connected digraphs with large chromatic number. Electronic Notes in Discrete Mathematics, 62:69 - 74, November 2017. [WWW ] [PDF ]
    Keywords: subdivision, Digraph, chromatic number.
    @article{cohen:hal-01634307,
    TITLE = {{Bispindle in strongly connected digraphs with large chromatic number}},
    AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Lopes, Raul},
    URL = {https://hal.inria.fr/hal-01634307},
    JOURNAL = {{Electronic Notes in Discrete Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {62},
    PAGES = {69 - 74},
    YEAR = {2017},
    MONTH = Nov,
    DOI = {10.1016/j.endm.2017.10.013},
    KEYWORDS = {subdivision ; Digraph ; chromatic number},
    PDF = {https://hal.inria.fr/hal-01634307/file/template.pdf},
    HAL_ID = {hal-01634307},
    HAL_VERSION = {v1},
    
    }
    

     
  20. Gianlorenzo D 'angelo, Alfredo Navarra, and Nicolas Nisse. A unified approach for Gathering and Exclusive Searching on rings under weak assumptions. Distributed Computing, 30(1):17-48, 2017. [WWW ] [PDF ]
    @article{dangelo:hal-01326473,
    TITLE = {{A unified approach for Gathering and Exclusive Searching on rings under weak assumptions}},
    AUTHOR = {D 'angelo, Gianlorenzo and Navarra, Alfredo and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01326473},
    JOURNAL = {{Distributed Computing}},
    PUBLISHER = {{Springer Verlag}},
    VOLUME = {30},
    NUMBER = {1},
    PAGES = {17-48},
    YEAR = {2017},
    PDF = {https://hal.archives-ouvertes.fr/hal-01326473/file/DIST-D-15-00013R3.pdf},
    HAL_ID = {hal-01326473},
    HAL_VERSION = {v1},
    
    }
    

     
  21. Gianlorenzo D 'angelo, Alfredo Navarra, and Nicolas Nisse. A unified approach for Gathering and Exclusive Searching on rings under weak assumptions. Distributed Computing, 30(1):17-48, 2017. [WWW ] [PDF ]
    @article{dangelo:hal-01326473,
    TITLE = {{A unified approach for Gathering and Exclusive Searching on rings under weak assumptions}},
    AUTHOR = {D 'angelo, Gianlorenzo and Navarra, Alfredo and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01326473},
    JOURNAL = {{Distributed Computing}},
    PUBLISHER = {{Springer Verlag}},
    VOLUME = {30},
    NUMBER = {1},
    PAGES = {17-48},
    YEAR = {2017},
    PDF = {https://hal.archives-ouvertes.fr/hal-01326473/file/DIST-D-15-00013R3.pdf},
    HAL_ID = {hal-01326473},
    HAL_VERSION = {v1},
    
    }
    

     
  22. Rennan Dantas, Frédéric Havet, and Rudini M Sampaio. Identifying codes for infinite triangular grids with a finite number of rows. Discrete Mathematics, 340:1584 - 1597, 2017. [WWW ] [PDF ]
    @article{dantas:hal-01527023,
    TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
    AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini M},
    URL = {https://hal.inria.fr/hal-01527023},
    JOURNAL = {{Discrete Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {340},
    PAGES = {1584 - 1597},
    YEAR = {2017},
    DOI = {10.1016/j.disc.2017.02.015},
    PDF = {https://hal.inria.fr/hal-01527023/file/tri-rudini.pdf},
    HAL_ID = {hal-01527023},
    HAL_VERSION = {v1},
    
    }
    

     
  23. Rennan Dantas, Frédéric Havet, and Rudini M Sampaio. Identifying codes for infinite triangular grids with a finite number of rows. Discrete Mathematics, 340:1584 - 1597, 2017. [WWW ] [PDF ]
    @article{dantas:hal-01527023,
    TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
    AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini M},
    URL = {https://hal.inria.fr/hal-01527023},
    JOURNAL = {{Discrete Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {340},
    PAGES = {1584 - 1597},
    YEAR = {2017},
    DOI = {10.1016/j.disc.2017.02.015},
    PDF = {https://hal.inria.fr/hal-01527023/file/tri-rudini.pdf},
    HAL_ID = {hal-01527023},
    HAL_VERSION = {v1},
    
    }
    

     
  24. Rennan Dantas, Rudini Sampaio, and Frédéric Havet. Minimum density of identifying codes of king grids. Electronic Notes in Discrete Mathematics, 62:51 - 56, November 2017. [WWW ] [PDF ]
    Keywords: Identifying code, King grid, Discharging Method.
    @article{dantas:hal-01634305,
    TITLE = {{Minimum density of identifying codes of king grids}},
    AUTHOR = {Dantas, Rennan and Sampaio, Rudini and Havet, Fr{\'e}d{\'e}ric},
    URL = {https://hal.inria.fr/hal-01634305},
    JOURNAL = {{Electronic Notes in Discrete Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {62},
    PAGES = {51 - 56},
    YEAR = {2017},
    MONTH = Nov,
    DOI = {10.1016/j.endm.2017.10.010},
    KEYWORDS = {Identifying code ; King grid ; Discharging Method},
    PDF = {https://hal.inria.fr/hal-01634305/file/LAGOS-king-code%281                          0x4df},
    HAL_ID = {hal-01634305},
    HAL_VERSION = {v1},
    
    }
    

     
  25. Frédéric Giroire and Juan-Carlos Maureira. Analysis of the Failure Tolerance of Linear Access Networks. IEEE Transactions on Intelligent Transportation Systems, pp 1 - 10, August 2017. [WWW ] [PDF ]
    Keywords: maintenance cost, Access networks, failure tolerance, telecommuting, connectivity analysis.
    @article{giroire:hal-01633813,
    TITLE = {{Analysis of the Failure Tolerance of Linear Access Networks}},
    AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Maureira, Juan-Carlos},
    URL = {https://hal.inria.fr/hal-01633813},
    JOURNAL = {{IEEE Transactions on Intelligent Transportation Systems}},
    PUBLISHER = {{IEEE}},
    PAGES = {1 - 10},
    YEAR = {2017},
    MONTH = Aug,
    DOI = {10.1109/TITS.2017.2718737},
    KEYWORDS = {maintenance cost ; Access networks ; failure tolerance ; telecommuting ; connectivity analysis},
    PDF = {https://hal.inria.fr/hal-01633813/file/FINAL%20VERSION.pdf},
    HAL_ID = {hal-01633813},
    HAL_VERSION = {v1},
    
    }
    

     
  26. Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, and Stéphane Pérennes. Maintaining Balanced Trees for Structured Distributed Streaming Systems. Discrete Applied Mathematics, 232:176 - 188, December 2017. [WWW ] [PDF ]
    Keywords: Peer-to-peer, Distributed Live Streaming System, Graph Algorithm, Balanced Trees.
    @article{giroire:hal-01620358,
    TITLE = {{Maintaining Balanced Trees for Structured Distributed Streaming Systems}},
    AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Modrzejewski, Remigiusz and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01620358},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {232},
    PAGES = {176 - 188},
    YEAR = {2017},
    MONTH = Dec,
    DOI = {10.1016/j.dam.2017.07.006},
    KEYWORDS = {Peer-to-peer ; Distributed Live Streaming System ; Graph Algorithm ; Balanced Trees},
    PDF = {https://hal.inria.fr/hal-01620358/file/Streaming_full_version.pdf},
    HAL_ID = {hal-01620358},
    HAL_VERSION = {v1},
    
    }
    

     
  27. Frédéric Giroire, Stéphane Pérennes, and Issam Tahiri. Grid spanners with low forwarding index for energy efficient networks. Discrete Applied Mathematics, March 2017. [WWW ] [PDF ]
    Keywords: grid, routing, energy saving, spanning subgraphs, forwarding index.
    @article{giroire:hal-01634448,
    TITLE = {{Grid spanners with low forwarding index for energy efficient networks}},
    AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Tahiri, Issam},
    URL = {https://hal.inria.fr/hal-01634448},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    YEAR = {2017},
    MONTH = Mar,
    DOI = {10.1016/j.dam.2017.02.021},
    KEYWORDS = {grid ; routing ; energy saving ; spanning subgraphs ; forwarding index},
    PDF = {https://hal.inria.fr/hal-01634448/file/journal-dam.pdf},
    HAL_ID = {hal-01634448},
    HAL_VERSION = {v1},
    
    }
    

     
  28. 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 ]
    Keywords: column generation, microwave networks, mixed-integer linear programming.
    @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},
    KEYWORDS = {column generation ; microwave networks ; mixed-integer linear programming},
    PDF = {https://hal.inria.fr/hal-01738156/file/Microwave-PO-HAL.pdf},
    HAL_ID = {hal-01738156},
    HAL_VERSION = {v1},
    
    }
    

     
  29. Bi Li, Fatima Zahra Moataz, Nicolas Nisse, and Karol Suchan. Minimum Size Tree-Decompositions. Discrete Applied Mathematics, February 2017. [WWW ] [PDF ]
    @article{li:hal-01620389,
    TITLE = {{Minimum Size Tree-Decompositions}},
    AUTHOR = {Li, Bi and Moataz, Fatima Zahra and Nisse, Nicolas and Suchan, Karol},
    URL = {https://hal.inria.fr/hal-01620389},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    YEAR = {2017},
    MONTH = Feb,
    DOI = {10.1016/j.dam.2017.01.030},
    PDF = {https://hal.inria.fr/hal-01620389/file/MSTD-DAM-v3.pdf},
    HAL_ID = {hal-01620389},
    HAL_VERSION = {v1},
    
    }
    

     
  30. Euripides Markou, Nicolas Nisse, and Stéphane Pérennes. Exclusive graph searching vs. pathwidth. Information and Computation, 252:243 - 260, 2017. [WWW ] [PDF ]
    Keywords: graph searching, pathwidth.
    @article{markou:hal-01534596,
    TITLE = {{Exclusive graph searching vs. pathwidth}},
    AUTHOR = {Markou, Euripides and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01534596},
    JOURNAL = {{Information and Computation}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {252},
    PAGES = {243 - 260},
    YEAR = {2017},
    DOI = {10.1016/j.ic.2016.11.007},
    KEYWORDS = {graph searching ; pathwidth},
    PDF = {https://hal.inria.fr/hal-01534596/file/journal_revised.pdf},
    HAL_ID = {hal-01534596},
    HAL_VERSION = {v1},
    
    }
    

     
  31. Euripides Markou, Nicolas Nisse, and Stéphane Pérennes. Exclusive graph searching vs. pathwidth. Information and Computation, 252:243 - 260, 2017. [WWW ] [PDF ]
    Keywords: graph searching, pathwidth.
    @article{markou:hal-01534596,
    TITLE = {{Exclusive graph searching vs. pathwidth}},
    AUTHOR = {Markou, Euripides and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01534596},
    JOURNAL = {{Information and Computation}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {252},
    PAGES = {243 - 260},
    YEAR = {2017},
    DOI = {10.1016/j.ic.2016.11.007},
    KEYWORDS = {graph searching ; pathwidth},
    PDF = {https://hal.inria.fr/hal-01534596/file/journal_revised.pdf},
    HAL_ID = {hal-01534596},
    HAL_VERSION = {v1},
    
    }
    

     
  32. Bruce Reed, X. Cai, G. Perarnau, and A. B. Watts. Acyclic edge colourings of graphs with large girth. Random Structures & Algorithms, 50(4):511 - 533, July 2017. [WWW ]
    @article{reed:hal-01641019,
    TITLE = {{Acyclic edge colourings of graphs with large girth}},
    AUTHOR = {Reed, Bruce and Cai, X. and Perarnau, G. and Watts, A. B.},
    URL = {https://hal.archives-ouvertes.fr/hal-01641019},
    JOURNAL = {{Random Structures \& Algorithms}},
    VOLUME = {50},
    NUMBER = {4},
    PAGES = {511 - 533},
    YEAR = {2017},
    MONTH = Jul,
    DOI = {10.1002/rsa.20695},
    HAL_ID = {hal-01641019},
    HAL_VERSION = {v1},
    
    }
    

     
  33. Bruce Reed, Felix Joos, Guillem Perarnau, and Dieter Rautenbach. How to determine if a random graph with a fixed degree sequence has a giant component. Probability Theory and Related Fields, January 2017. [WWW ]
    @article{reed:hal-01641473,
    TITLE = {{How to determine if a random graph with a fixed degree sequence has a giant component}},
    AUTHOR = {Reed, Bruce and Joos, Felix and Perarnau, Guillem and Rautenbach, Dieter},
    URL = {https://hal.archives-ouvertes.fr/hal-01641473},
    JOURNAL = {{Probability Theory and Related Fields}},
    PUBLISHER = {{Springer Verlag}},
    YEAR = {2017},
    MONTH = Jan,
    DOI = {10.1007/s00440-017-0757-1},
    HAL_ID = {hal-01641473},
    HAL_VERSION = {v1},
    
    }
    

     
  34. Bruce Reed and G. Perarnau. Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Combinatorics, Probability and Computing, 26(03):448 - 467, May 2017. [WWW ]
    @article{reed:hal-01641020,
    TITLE = {{Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree}},
    AUTHOR = {Reed, Bruce and Perarnau, G.},
    URL = {https://hal.archives-ouvertes.fr/hal-01641020},
    JOURNAL = {{Combinatorics, Probability and Computing}},
    PUBLISHER = {{Cambridge University Press (CUP)}},
    VOLUME = {26},
    NUMBER = {03},
    PAGES = {448 - 467},
    YEAR = {2017},
    MONTH = May,
    DOI = {10.1017/S0963548316000328},
    HAL_ID = {hal-01641020},
    HAL_VERSION = {v1},
    
    }
    

     
  35. Bruce Reed, Jonas Witt, and Marco E. Lübbecke. Polyhedral results on the stable set problem in graphs containing even or odd pairs. Mathematical Programming, June 2017. [WWW ]
    @article{reed:hal-01641023,
    TITLE = {{Polyhedral results on the stable set problem in graphs containing even or odd pairs}},
    AUTHOR = {Reed, Bruce and Witt, Jonas and L{\"u}bbecke, Marco E.},
    URL = {https://hal.archives-ouvertes.fr/hal-01641023},
    JOURNAL = {{Mathematical Programming}},
    PUBLISHER = {{Springer Verlag}},
    YEAR = {2017},
    MONTH = Jun,
    DOI = {10.1007/s10107-017-1168-x},
    HAL_ID = {hal-01641023},
    HAL_VERSION = {v1},
    
    }
    

     
  36. Myriana Rifai, Nicolas Huin, Christelle Caillouet, Frédéric Giroire, Joanna Moulierac, Dino Lopez Pacheco, and Guillaume Urvoy-Keller. Minnie : An SDN world with few compressed forwarding rules. Computer Networks, 121:185 - 207, July 2017. [WWW ] [PDF ]
    Keywords: Software Defined Networks, data center networks, routing tables, compression, TCAM.
    @article{rifai:hal-01576133,
    TITLE = {{Minnie : An SDN world with few compressed forwarding rules}},
    AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
    URL = {https://hal.inria.fr/hal-01576133},
    JOURNAL = {{Computer Networks}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {121},
    PAGES = {185 - 207},
    YEAR = {2017},
    MONTH = Jul,
    DOI = {10.1016/j.comnet.2017.04.026},
    KEYWORDS = {Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM},
    PDF = {https://hal.inria.fr/hal-01576133/file/COMPNW_COMNET-D-15-1277.pdf},
    HAL_ID = {hal-01576133},
    HAL_VERSION = {v1},
    
    }
    

     
  37. Myriana Rifai, Nicolas Huin, Christelle Caillouet, Frédéric Giroire, Joanna Moulierac, Dino Lopez Pacheco, and Guillaume Urvoy-Keller. Minnie : An SDN world with few compressed forwarding rules. Computer Networks, 121:185 - 207, July 2017. [WWW ] [PDF ]
    Keywords: Software Defined Networks, data center networks, routing tables, compression, TCAM.
    @article{rifai:hal-01576133,
    TITLE = {{Minnie : An SDN world with few compressed forwarding rules}},
    AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
    URL = {https://hal.inria.fr/hal-01576133},
    JOURNAL = {{Computer Networks}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {121},
    PAGES = {185 - 207},
    YEAR = {2017},
    MONTH = Jul,
    DOI = {10.1016/j.comnet.2017.04.026},
    KEYWORDS = {Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM},
    PDF = {https://hal.inria.fr/hal-01576133/file/COMPNW_COMNET-D-15-1277.pdf},
    HAL_ID = {hal-01576133},
    HAL_VERSION = {v1},
    
    }
    

     
  38. 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 ]
    Keywords: Complex networks, Geometric routing, Compact routing, Algebraic routing, Path-vector routing.
    @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},
    KEYWORDS = {Complex networks ; Geometric routing ; Compact routing ; Algebraic routing ; Path-vector routing},
    PDF = {https://hal.inria.fr/hal-01547511/file/network.pdf},
    HAL_ID = {hal-01547511},
    HAL_VERSION = {v1},
    
    }
    

     
  39. 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 ]
    Keywords: Complex networks, Geometric routing, Compact routing, Algebraic routing, Path-vector routing.
    @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},
    KEYWORDS = {Complex networks ; Geometric routing ; Compact routing ; Algebraic routing ; Path-vector routing},
    PDF = {https://hal.inria.fr/hal-01547511/file/network.pdf},
    HAL_ID = {hal-01547511},
    HAL_VERSION = {v1},
    
    }
    

     
Conference's articles
  1. Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, and Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in graphs. In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 62 of Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)), Marseille, France, pages 3-8, September 2017. [WWW ] [PDF ]
    Keywords: Graph, Matching, Augmenting paths, Complexity, Trees.
    @inproceedings{bensmail:hal-01534598,
    TITLE = {{Recovery of disrupted airline operations using k-Maximum Matching in graphs}},
    AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas and Salch, Alexandre and Weber, Valentin},
    URL = {https://hal.inria.fr/hal-01534598},
    BOOKTITLE = {{IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)}},
    ADDRESS = {Marseille, France},
    SERIES = {Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS))},
    VOLUME = {62},
    PAGES = {3-8},
    YEAR = {2017},
    MONTH = Sep,
    KEYWORDS = {Graph ; Matching ; Augmenting paths ; Complexity ; Trees},
    PDF = {https://hal.inria.fr/hal-01534598/file/LAGOS17.pdf},
    HAL_ID = {hal-01534598},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, and Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in graphs. In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Marseille, France, September 2017. [WWW ] [PDF ]
    Keywords: Graph, Matching, Augmenting paths, Complexity, Trees.
    @inproceedings{bensmail:hal-01534598,
    TITLE = {{Recovery of disrupted airline operations using k-Maximum Matching in graphs}},
    AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas and Salch, Alexandre and Weber, Valentin},
    URL = {https://hal.inria.fr/hal-01534598},
    BOOKTITLE = {{IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)}},
    ADDRESS = {Marseille, France},
    SERIES = {IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)},
    YEAR = {2017},
    MONTH = Sep,
    KEYWORDS = {Graph ; Matching ; Augmenting paths ; Complexity ; Trees},
    PDF = {https://hal.inria.fr/hal-01534598/file/LAGOS17.pdf},
    HAL_ID = {hal-01534598},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Pierre Bergé, Jason Crampton, Gregory Gutin, and Rémi Watrigant. The Authorization Policy Existence Problem. In CODASPY: Conference on Data and Application Security and Privacy, Scottsdale, United States, pages 163-165, March 2017. ACM Press. [WWW ]
    @inproceedings{berge:hal-01995978,
    TITLE = {{The Authorization Policy Existence Problem}},
    AUTHOR = {Berg{\'e}, Pierre and Crampton, Jason and Gutin, Gregory and Watrigant, R{\'e}mi},
    URL = {https://hal.archives-ouvertes.fr/hal-01995978},
    BOOKTITLE = {{CODASPY: Conference on Data and Application Security and Privacy}},
    ADDRESS = {Scottsdale, United States},
    PUBLISHER = {{ACM Press}},
    PAGES = {163-165},
    YEAR = {2017},
    MONTH = Mar,
    DOI = {10.1145/3029806.3029844},
    HAL_ID = {hal-01995978},
    HAL_VERSION = {v1},
    
    }
    

     
  4. Jean-Claude Bermond, Takako Kodate, and Joseph Yu. Gossiping with interference in radio ring networks. In 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games, TOKYO, Japan, August 2017. [WWW ] [PDF ]
    Keywords: gossiping, radio networks, ring, interference.
    @inproceedings{bermond:hal-01963492,
    TITLE = {{Gossiping with interference in radio ring networks}},
    AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
    URL = {https://hal.inria.fr/hal-01963492},
    BOOKTITLE = {{20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games}},
    ADDRESS = {TOKYO, Japan},
    YEAR = {2017},
    MONTH = Aug,
    KEYWORDS = {gossiping ; radio networks ; ring ; interference},
    PDF = {https://hal.inria.fr/hal-01963492/file/abstract-final2017                 0x4df},
    HAL_ID = {hal-01963492},
    HAL_VERSION = {v1},
    
    }
    

     
  5. Christelle Caillouet and Tahiry Razafindralambo. Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage. In IEEE, editor, GIIS 2017 - Global Information Infrastructure and Networking Symposium, Saint-Pierre, France, October 2017. [WWW ] [PDF ]
    @inproceedings{caillouet:hal-01575618,
    TITLE = {{Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage}},
    AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry},
    URL = {https://hal.inria.fr/hal-01575618},
    BOOKTITLE = {{GIIS 2017 - Global Information Infrastructure and Networking Symposium}},
    ADDRESS = {Saint-Pierre, France},
    EDITOR = {IEEE},
    YEAR = {2017},
    MONTH = Oct,
    DOI = {10.1109/GIIS.2017.8169803},
    PDF = {https://hal.inria.fr/hal-01575618/file/article_static_conf_2.pdf},
    HAL_ID = {hal-01575618},
    HAL_VERSION = {v1},
    
    }
    

     
  6. Christelle Caillouet and Tahiry Razafindralambo. Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage. In IEEE, editor, GIIS 2017 - Global Information Infrastructure and Networking Symposium, Saint-Pierre, France, October 2017. [WWW ] [PDF ]
    @inproceedings{caillouet:hal-01575618,
    TITLE = {{Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage}},
    AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry},
    URL = {https://hal.inria.fr/hal-01575618},
    BOOKTITLE = {{GIIS 2017 - Global Information Infrastructure and Networking Symposium}},
    ADDRESS = {Saint-Pierre, France},
    EDITOR = {IEEE},
    YEAR = {2017},
    MONTH = Oct,
    PDF = {https://hal.inria.fr/hal-01575618/file/article_static_conf_2.pdf},
    HAL_ID = {hal-01575618},
    HAL_VERSION = {v1},
    
    }
    

     
  7. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, and Rémi Watrigant. Complexity Dichotomies for the Minimum $F$-Overlay Problem. In IWOCA: International Workshop on Combinatorial Algorithms, Newcastle, Australia, pages 12, July 2017. [WWW ] [PDF ]
    Keywords: Fixed-parameter tractability, Hypergraph, Minimum F-Overlay Problem, NP-completeness.
    @inproceedings{cohen:hal-01571229,
    TITLE = {{Complexity Dichotomies for the Minimum $F$-Overlay Problem}},
    AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Sau, Ignasi and Watrigant, R{\'e}mi},
    URL = {https://hal.inria.fr/hal-01571229},
    BOOKTITLE = {{IWOCA: International Workshop on Combinatorial Algorithms}},
    ADDRESS = {Newcastle, Australia},
    PAGES = {12},
    YEAR = {2017},
    MONTH = Jul,
    KEYWORDS = {Fixed-parameter tractability ; Hypergraph ; Minimum F-Overlay Problem ; NP-completeness},
    PDF = {https://hal.inria.fr/hal-01571229/file/iwoca2017-SUBMITTED.pdf},
    HAL_ID = {hal-01571229},
    HAL_VERSION = {v1},
    
    }
    

     
  8. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, and Rémi Watrigant. Complexity Dichotomies for the Minimum F -Overlay Problem. In IWOCA 2017 - 28th International Workshop on Combinatorial Algorithms, Newcastle, Australia, pages 12, July 2017. [WWW ] [PDF ]
    Keywords: Hypergraph, Minimum F-Overlay Problem, NP-completeness, Fixed-parameter tractability.
    @inproceedings{cohen:hal-01571229,
    TITLE = {{Complexity Dichotomies for the Minimum F -Overlay Problem}},
    AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Sau, Ignasi and Watrigant, R{\'e}mi},
    URL = {https://hal.inria.fr/hal-01571229},
    BOOKTITLE = {{IWOCA 2017 - 28th International Workshop on Combinatorial Algorithms}},
    ADDRESS = {Newcastle, Australia},
    PAGES = {12},
    YEAR = {2017},
    MONTH = Jul,
    KEYWORDS = {Hypergraph ; Minimum F-Overlay Problem ; NP-completeness ; Fixed-parameter tractability},
    PDF = {https://hal.inria.fr/hal-01571229/file/iwoca2017-SUBMITTED.pdf},
    HAL_ID = {hal-01571229},
    HAL_VERSION = {v1},
    
    }
    

     
  9. Nathann Cohen, Nìcolas A Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Enquêter dans les graphes. In ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France, May 2017. [WWW ] [PDF ]
    Keywords: Jeu de Gendarmes et Voleur, Programmation Linéaire, Mots-clefs : Jeux combinatoires à deux joueurs dans les graphes.
    @inproceedings{cohen:hal-01510108,
    TITLE = {{Enqu{\^e}ter dans les graphes}},
    AUTHOR = {Cohen, Nathann and Martins, N{\'i}colas A and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Sampaio, Rudini},
    URL = {https://hal.archives-ouvertes.fr/hal-01510108},
    BOOKTITLE = {{ALGOTEL 2017 - 19{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
    ADDRESS = {Quiberon, France},
    YEAR = {2017},
    MONTH = May,
    KEYWORDS = {Jeu de Gendarmes et Voleur ; Programmation Lin{\'e}aire ; Mots-clefs : Jeux combinatoires {\`a} deux joueurs dans les graphes},
    PDF = {https://hal.archives-ouvertes.fr/hal-01510108/file/algotel_2017_V3.pdf},
    HAL_ID = {hal-01510108},
    HAL_VERSION = {v1},
    
    }
    

     
  10. Nathann Cohen, Nìcolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Enquêter dans les graphes. In ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France, May 2017. [WWW ] [PDF ]
    Keywords: Programmation Linéaire, Mots-clefs : Jeux combinatoires à deux joueurs dans les graphes, Jeu de Gendarmes et Voleur.
    @inproceedings{cohen:hal-01510108,
    TITLE = {{Enqu{\^e}ter dans les graphes}},
    AUTHOR = {Cohen, Nathann and Martins, N{\'i}colas and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane and Sampaio, Rudini},
    URL = {https://hal.archives-ouvertes.fr/hal-01510108},
    BOOKTITLE = {{ALGOTEL 2017 - 19{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
    ADDRESS = {Quiberon, France},
    YEAR = {2017},
    MONTH = May,
    KEYWORDS = {Programmation Lin{\'e}aire ; Mots-clefs : Jeux combinatoires {\`a} deux joueurs dans les graphes ; Jeu de Gendarmes et Voleur},
    PDF = {https://hal.archives-ouvertes.fr/hal-01510108/file/algotel_2017_V3.pdf},
    HAL_ID = {hal-01510108},
    HAL_VERSION = {v1},
    
    }
    

     
  11. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. In 28th International Symposium on Algorithms and Computation (ISAAC 2017), Phuket, Thailand, 2017. [WWW ] [PDF ]
    Keywords: Turn-by-turn games in graphs, Graph algorithms, Linear Programming.
    @inproceedings{cohen:hal-01582091,
    TITLE = {{Study of a combinatorial game in graphs through Linear Programming}},
    AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01582091},
    BOOKTITLE = {{28th International Symposium on Algorithms and Computation (ISAAC 2017)}},
    ADDRESS = {Phuket, Thailand},
    YEAR = {2017},
    DOI = {10.4230/LIPIcs},
    KEYWORDS = {Turn-by-turn games in graphs ; Graph algorithms ; Linear Programming},
    PDF = {https://hal.inria.fr/hal-01582091/file/ISAAC2017_revised.pdf},
    HAL_ID = {hal-01582091},
    HAL_VERSION = {v1},
    
    }
    

     
  12. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. In 28th International Symposium on Algorithms and Computation (ISAAC 2017), Phuket, Thailand, 2017. [WWW ] [PDF ]
    Keywords: Turn-by-turn games in graphs, Graph algorithms, Linear Programming.
    @inproceedings{cohen:hal-01582091,
    TITLE = {{Study of a combinatorial game in graphs through Linear Programming}},
    AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01582091},
    BOOKTITLE = {{28th International Symposium on Algorithms and Computation (ISAAC 2017)}},
    ADDRESS = {Phuket, Thailand},
    YEAR = {2017},
    DOI = {10.4230/LIPIcs},
    KEYWORDS = {Turn-by-turn games in graphs ; Graph algorithms ; Linear Programming},
    PDF = {https://hal.inria.fr/hal-01582091/file/ISAAC2017_revised.pdf},
    HAL_ID = {hal-01582091},
    HAL_VERSION = {v1},
    
    }
    

     
  13. 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 ]
    Keywords: Gromov hyperbolicity, Hyperbolic space, Cop and Robber games.
    @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},
    KEYWORDS = {Gromov hyperbolicity ; Hyperbolic space ; Cop and Robber games},
    PDF = {https://hal.inria.fr/hal-01573042/file/CouDuc--EUROCOMB17.pdf},
    HAL_ID = {hal-01573042},
    HAL_VERSION = {v1},
    
    }
    

     
  14. 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 ]
    Keywords: Gromov hyperbolicity, Hyperbolic space, Cop and Robber games.
    @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},
    KEYWORDS = {Gromov hyperbolicity ; Hyperbolic space ; Cop and Robber games},
    PDF = {https://hal.inria.fr/hal-01573042/file/CouDuc--EUROCOMB17.pdf},
    HAL_ID = {hal-01573042},
    HAL_VERSION = {v1},
    
    }
    

     
  15. 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 ]
    Keywords: Network design, Backhaul network, Reliability, Optimization.
    @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},
    KEYWORDS = {Network design ; Backhaul network ; Reliability ; Optimization},
    PDF = {https://hal.inria.fr/hal-01593041/file/backhaul.pdf},
    HAL_ID = {hal-01593041},
    HAL_VERSION = {v1},
    
    }
    

     
  16. David Coudert, James Luedtke, Eduardo Moreno, and Konstantinos Priftis. Computing and maximizing the exact reliability of wireless backhaul networks. In International Network Optimization Conference, Lisbon, Portugal, February 2017. [WWW ] [PDF ]
    Keywords: Network design, Backhaul network, Reliability, Optimization.
    @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},
    YEAR = {2017},
    MONTH = Feb,
    KEYWORDS = {Network design ; Backhaul network ; Reliability ; Optimization},
    PDF = {https://hal.inria.fr/hal-01593041/file/backhaul.pdf},
    HAL_ID = {hal-01593041},
    HAL_VERSION = {v1},
    
    }
    

     
  17. Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. In 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), volume 10520 of Graph-Theoretic Concepts in Computer Science, Eindhoven, Netherlands, pages 234--248, June 2017. [WWW ] [PDF ]
    @inproceedings{ducoffe:hal-01627959,
    TITLE = {{Finding cut-vertices in the square roots of a graph}},
    AUTHOR = {Ducoffe, Guillaume},
    URL = {https://hal.archives-ouvertes.fr/hal-01627959},
    BOOKTITLE = {{43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017)}},
    ADDRESS = {Eindhoven, Netherlands},
    SERIES = {Graph-Theoretic Concepts in Computer Science},
    VOLUME = {10520},
    PAGES = {234--248},
    YEAR = {2017},
    MONTH = Jun,
    DOI = {10.1007/978-3-319-68705-6\_18},
    PDF = {https://hal.archives-ouvertes.fr/hal-01627959/file/Ducoffe-WG17.pdf},
    HAL_ID = {hal-01627959},
    HAL_VERSION = {v1},
    
    }
    

     
  18. Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, and ALEXANDRU POPA. On the (di)graphs with (directed) proper connection number two. In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 62, Marseille, France, pages 237 - 242, September 2017. [WWW ] [PDF ]
    Keywords: NP-complete, proper connection, digraphs, bipartite, even dicycles.
    @inproceedings{ducoffe:hal-01625042,
    TITLE = {{On the (di)graphs with (directed) proper connection number two}},
    AUTHOR = {Ducoffe, Guillaume and Marinescu-Ghemeci, Ruxandra and POPA, ALEXANDRU},
    URL = {https://hal.archives-ouvertes.fr/hal-01625042},
    BOOKTITLE = {{IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)}},
    ADDRESS = {Marseille, France},
    VOLUME = {62},
    PAGES = {237 - 242},
    YEAR = {2017},
    MONTH = Sep,
    DOI = {10.1016/j.endm.2017.10.041},
    KEYWORDS = {NP-complete ; proper connection ; digraphs ; bipartite ; even dicycles},
    PDF = {https://hal.archives-ouvertes.fr/hal-01625042/file/DMP-LAGOS17-finale.pdf},
    HAL_ID = {hal-01625042},
    HAL_VERSION = {v1},
    
    }
    

     
  19. Nicolas Huin, Brigitte Jaumard, and Frédéric Giroire. Optimization of Network Service Chain Provisioning. In IEEE International Conference on Communications 2017, Paris, France, May 2017. [WWW ] [PDF ]
    Keywords: service function chaining, SFC, column generation.
    @inproceedings{huin:hal-01476018,
    TITLE = {{Optimization of Network Service Chain Provisioning}},
    AUTHOR = {Huin, Nicolas and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
    URL = {https://hal.inria.fr/hal-01476018},
    BOOKTITLE = {{IEEE International Conference on Communications 2017}},
    ADDRESS = {Paris, France},
    YEAR = {2017},
    MONTH = May,
    KEYWORDS = {service function chaining ; SFC ; column generation},
    PDF = {https://hal.inria.fr/hal-01476018/file/ICC_2Chaining_Final.pdf},
    HAL_ID = {hal-01476018},
    HAL_VERSION = {v1},
    
    }
    

     
  20. Nicolas Huin, Brigitte Jaumard, and Frédéric Giroire. Optimization of Network Service Chain Provisioning. In IEEE International Conference on Communications 2017, Paris, France, May 2017. [WWW ] [PDF ]
    Keywords: service function chaining, SFC, column generation.
    @inproceedings{huin:hal-01476018,
    TITLE = {{Optimization of Network Service Chain Provisioning}},
    AUTHOR = {Huin, Nicolas and Jaumard, Brigitte and Giroire, Fr{\'e}d{\'e}ric},
    URL = {https://hal.inria.fr/hal-01476018},
    BOOKTITLE = {{IEEE International Conference on Communications 2017}},
    ADDRESS = {Paris, France},
    YEAR = {2017},
    MONTH = May,
    KEYWORDS = {service function chaining ; SFC ; column generation},
    PDF = {https://hal.inria.fr/hal-01476018/file/ICC_2Chaining_Final.pdf},
    HAL_ID = {hal-01476018},
    HAL_VERSION = {v1},
    
    }
    

     
  21. Nicolas Huin, Myriana Rifai, Frédéric Giroire, Dino Lopez Pacheco, Guillaume Urvoy-Keller, and Joanna Moulierac. Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks. In GLOBECOM 2017 - IEEE Global Communications Conference, Singapore, Singapore, pages 7, December 2017. [WWW ] [PDF ]
    @inproceedings{huin:hal-01595989,
    TITLE = {{Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}},
    AUTHOR = {Huin, Nicolas and Rifai, Myriana and Giroire, Fr{\'e}d{\'e}ric and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume and Moulierac, Joanna},
    URL = {https://hal.inria.fr/hal-01595989},
    BOOKTITLE = {{GLOBECOM 2017 - IEEE Global Communications Conference}},
    ADDRESS = {Singapore, Singapore},
    PAGES = {7},
    YEAR = {2017},
    MONTH = Dec,
    PDF = {https://hal.inria.fr/hal-01595989/file/PID1202840.pdf},
    HAL_ID = {hal-01595989},
    HAL_VERSION = {v1},
    
    }
    

     
  22. Nicolas Huin, Myriana Rifai, Frédéric Giroire, Dino Lopez Pacheco, Guillaume Urvoy-Keller, and Joanna Moulierac. Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks. In GLOBECOM 2017 - IEEE Global Communications Conference, Singapore, Singapore, pages 7, December 2017. [WWW ] [PDF ]
    @inproceedings{huin:hal-01595989,
    TITLE = {{Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}},
    AUTHOR = {Huin, Nicolas and Rifai, Myriana and Giroire, Fr{\'e}d{\'e}ric and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume and Moulierac, Joanna},
    URL = {https://hal.inria.fr/hal-01595989},
    BOOKTITLE = {{GLOBECOM 2017 - IEEE Global Communications Conference}},
    ADDRESS = {Singapore, Singapore},
    PAGES = {7},
    YEAR = {2017},
    MONTH = Dec,
    PDF = {https://hal.inria.fr/hal-01595989/file/PID1202840.pdf},
    HAL_ID = {hal-01595989},
    HAL_VERSION = {v1},
    
    }
    

     
  23. Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, and Brigitte Jaumard. Energy-Efficient Service Function Chain Provisioning. In International Network Optimization Conference 2017, Lisbonne, Portugal, February 2017. [WWW ] [PDF ]
    Keywords: Network Function Virtualization, Service Function Chains, Software Defined Networks, Energy Efficiency, Optimization, Column Generation.
    @inproceedings{huin:hal-01513747,
    TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
    AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
    URL = {https://hal.inria.fr/hal-01513747},
    BOOKTITLE = {{International Network Optimization Conference 2017}},
    ADDRESS = {Lisbonne, Portugal},
    YEAR = {2017},
    MONTH = Feb,
    KEYWORDS = {Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Energy Efficiency ; Optimization ; Column Generation},
    PDF = {https://hal.inria.fr/hal-01513747/file/INOC_2017_paper_43.pdf},
    HAL_ID = {hal-01513747},
    HAL_VERSION = {v1},
    
    }
    

     
  24. Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, and Brigitte Jaumard. Energy-Efficient Service Function Chain Provisioning. In International Network Optimization Conference 2017, Lisbonne, Portugal, February 2017. [WWW ] [PDF ]
    Keywords: Network Function Virtualization, Service Function Chains, Software Defined Networks, Energy Efficiency, Optimization, Column Generation.
    @inproceedings{huin:hal-01513747,
    TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
    AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
    URL = {https://hal.inria.fr/hal-01513747},
    BOOKTITLE = {{International Network Optimization Conference 2017}},
    ADDRESS = {Lisbonne, Portugal},
    YEAR = {2017},
    MONTH = Feb,
    KEYWORDS = {Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Energy Efficiency ; Optimization ; Column Generation},
    PDF = {https://hal.inria.fr/hal-01513747/file/INOC_2017_paper_43.pdf},
    HAL_ID = {hal-01513747},
    HAL_VERSION = {v1},
    
    }
    

     
Internal reports
  1. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Research Report, Université Côte d'Azur, July 2017. [WWW ] [PDF ]
    Keywords: trees, bounded-length augmentations, maximum matchings.
    @techreport{bensmail:hal-01555465,
    TITLE = {{On improving matchings in trees, via bounded-length augmentations}},
    AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01555465},
    TYPE = {Research Report},
    INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
    YEAR = {2017},
    MONTH = Jul,
    KEYWORDS = {trees ; bounded-length augmentations ; maximum matchings},
    PDF = {https://hal.archives-ouvertes.fr/hal-01555465/file/v7-matchings.pdf},
    HAL_ID = {hal-01555465},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Research Report, Université Côte d'Azur, July 2017. [WWW ] [PDF ]
    Keywords: trees, bounded-length augmentations, maximum matchings.
    @techreport{bensmail:hal-01555465,
    TITLE = {{On improving matchings in trees, via bounded-length augmentations}},
    AUTHOR = {Bensmail, Julien and Garnero, Valentin and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-01555465},
    TYPE = {Research Report},
    INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
    YEAR = {2017},
    MONTH = Jul,
    KEYWORDS = {trees ; bounded-length augmentations ; maximum matchings},
    PDF = {https://hal.archives-ouvertes.fr/hal-01555465/file/v7-matchings.pdf},
    HAL_ID = {hal-01555465},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokol, and Malgorzata Sleszynska-Nowak. Localization Game on Geometric and Planar Graphs. Research Report, Inria, 2017. [WWW ] [PDF ]
    @techreport{bosek:hal-01620365,
    TITLE = {{Localization Game on Geometric and Planar Graphs}},
    AUTHOR = {Bosek, Bartlomiej and Gordinowicz, Przemyslaw and Grytczuk, Jaroslaw and Nisse, Nicolas and Sokol, Joanna and Sleszynska-Nowak, Malgorzata},
    URL = {https://hal.inria.fr/hal-01620365},
    TYPE = {Research Report},
    INSTITUTION = {{Inria}},
    YEAR = {2017},
    PDF = {https://hal.inria.fr/hal-01620365/file/Localization        4.46254E-267ame