Publications of year 2019

BACK TO COATI PUBLICATION INDEX

Publications of year 2019

Articles in journal or book's chapters
  1. Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluis Fabrega, Pere Vila, and David Coudert. Low Time Complexity Algorithms for Path Computation in Cayley Graphs. Discrete Applied Mathematics, 259:218-225, April 2019. [WWW ] [PDF ]
    Keywords: interconnection networks, Cayley graphs, path computation, K-shortest paths.
    @article{aguirreguerrero:hal-01973608,
    TITLE = {{Low Time Complexity Algorithms for Path Computation in Cayley Graphs}},
    AUTHOR = {Aguirre-Guerrero, Daniela and Ducoffe, Guillaume and Fabrega, Lluis and Vila, Pere and Coudert, David},
    URL = {https://hal.inria.fr/hal-01973608},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {259},
    PAGES = {218-225},
    YEAR = {2019},
    MONTH = Apr,
    DOI = {10.1016/j.dam.2018.12.005},
    KEYWORDS = {interconnection networks ; Cayley graphs ; path computation ; K-shortest paths},
    PDF = {https://hal.inria.fr/hal-01973608/file/cga_final.pdf},
    HAL_ID = {hal-01973608},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Stephan Dominique Andres, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. The Orthogonal Colouring Game. Theoretical Computer Science, February 2019. [WWW ] [PDF ]
    Keywords: strictly matched involution, Orthogonal Colouring Game, orthogonal graph colouring, mutually orthogonal Latin squares, scoring game, games on graphs.
    @article{andres:hal-02017462,
    TITLE = {{The Orthogonal Colouring Game}},
    AUTHOR = {Andres, Stephan Dominique and Huggan, Melissa and Mc Inerney, Fionn and Nowakowski, Richard J},
    URL = {https://hal.inria.fr/hal-02017462},
    JOURNAL = {{Theoretical Computer Science}},
    PUBLISHER = {{Elsevier}},
    YEAR = {2019},
    MONTH = Feb,
    KEYWORDS = {strictly matched involution ; Orthogonal Colouring Game ; orthogonal graph colouring ; mutually orthogonal Latin squares ; scoring game ; games on graphs},
    PDF = {https://hal.inria.fr/hal-02017462/file/Corrected_TCS_orthogonalGraphColoringGame.pdf},
    HAL_ID = {hal-02017462},
    HAL_VERSION = {v4},
    
    }
    

     
  3. Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Eric Sopena, and Mariusz Wozniak. A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discrete Mathematics and Theoretical Computer Science, vol. 21 no. 1, ICGT 2018, April 2019. [WWW ] [PDF ]
    Keywords: Coloured weighted degrees, 1-2-3 Conjecture, Locally irregular decompositions.
    @article{baudon:hal-01690222,
    TITLE = {{A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions}},
    AUTHOR = {Baudon, Olivier and Bensmail, Julien and Davot, Tom and Hocquard, Herv{\'e} and Przybylo, Jakub and Senhaji, Mohammed and Sopena, Eric and Wo{\'z}niak, Mariusz},
    URL = {https://hal.archives-ouvertes.fr/hal-01690222},
    JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
    PUBLISHER = {{DMTCS}},
    VOLUME = {vol. 21 no. 1, ICGT 2018},
    YEAR = {2019},
    MONTH = Apr,
    KEYWORDS = {Coloured weighted degrees ; 1-2-3 Conjecture ; Locally irregular decompositions},
    PDF = {https://hal.archives-ouvertes.fr/hal-01690222/file/multisums-dmtcs.pdf},
    HAL_ID = {hal-01690222},
    HAL_VERSION = {v4},
    
    }
    

     
  4. Julien Bensmail. A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs. Discrete Applied Mathematics, 257:31-39, February 2019. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, 5-regular graphs, four weights.
    @article{bensmail:hal-01509365,
    TITLE = {{A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs}},
    AUTHOR = {Bensmail, Julien},
    URL = {https://hal.archives-ouvertes.fr/hal-01509365},
    JOURNAL = {{Discrete Applied Mathematics}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {257},
    PAGES = {31-39},
    YEAR = {2019},
    MONTH = Feb,
    KEYWORDS = {1-2-3 Conjecture ; 5-regular graphs ; four weights},
    PDF = {https://hal.archives-ouvertes.fr/hal-01509365/file/123reg.pdf},
    HAL_ID = {hal-01509365},
    HAL_VERSION = {v2},
    
    }
    

     
  5. Michele Borassi and Emanuele Natale. KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. ACM Journal of Experimental Algorithmics, 24(1), February 2019. [WWW ]
    Keywords: shortest path algorithm, graph mining, sampling, network analysis, Betweenness centrality.
    @article{borassi:hal-02043367,
    TITLE = {{KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation}},
    AUTHOR = {Borassi, Michele and Natale, Emanuele},
    URL = {https://hal.inria.fr/hal-02043367},
    JOURNAL = {{ACM Journal of Experimental Algorithmics}},
    PUBLISHER = {{Association for Computing Machinery}},
    VOLUME = {24},
    NUMBER = {1},
    YEAR = {2019},
    MONTH = Feb,
    DOI = {10.1145/3284359},
    KEYWORDS = {shortest path algorithm ; graph mining ; sampling ; network analysis ; Betweenness centrality},
    HAL_ID = {hal-02043367},
    HAL_VERSION = {v1},
    
    }
    

     
  6. Christelle Caillouet, Frédéric Giroire, and Tahiry Razafindralambo. Efficient Data Collection and Tracking with Flying Drones. Ad Hoc Networks, 89(C):35-46, 2019. [WWW ] [PDF ]
    Keywords: UAV, Coverage, Wireless Sensor Network.
    @article{caillouet:hal-02043136,
    TITLE = {{Efficient Data Collection and Tracking with Flying Drones}},
    AUTHOR = {Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Razafindralambo, Tahiry},
    URL = {https://hal.inria.fr/hal-02043136},
    JOURNAL = {{Ad Hoc Networks}},
    PUBLISHER = {{Elsevier}},
    VOLUME = {89},
    NUMBER = {C},
    PAGES = {35-46},
    YEAR = {2019},
    DOI = {10.1016/j.adhoc.2019.01.011},
    KEYWORDS = {UAV ; Coverage ; Wireless Sensor Network},
    PDF = {https://hal.inria.fr/hal-02043136/file/main.pdf},
    HAL_ID = {hal-02043136},
    HAL_VERSION = {v1},
    
    }
    

     
Conference's articles
  1. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Dimension Métrique des Graphes Orientés. In ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, June 2019. [WWW ] [PDF ]
    Keywords: Graphes, Dimension Métrique, Ensembles Resolvants, Orientations fortement connexes.
    @inproceedings{bensmail:hal-02118847,
    TITLE = {{Dimension M{\'e}trique des Graphes Orient{\'e}s}},
    AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
    URL = {https://hal.inria.fr/hal-02118847},
    BOOKTITLE = {{ALGOTEL 2019 - 21{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
    ADDRESS = {Saint Laurent de la Cabrerisse, France},
    YEAR = {2019},
    MONTH = Jun,
    KEYWORDS = {Graphes ; Dimension M{\'e}trique ; Ensembles Resolvants ; Orientations fortement connexes},
    PDF = {https://hal.inria.fr/hal-02118847/file/corrected_algotel2019_md_oriente.pdf},
    HAL_ID = {hal-02118847},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. In 10th Latin & American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brazil, June 2019. [WWW ] [PDF ]
    Keywords: Resolving sets, Metric dimension, Strongly-connected orientations.
    @inproceedings{bensmail:hal-02098194,
    TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
    AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
    URL = {https://hal.inria.fr/hal-02098194},
    BOOKTITLE = {{10th Latin \& American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)}},
    ADDRESS = {Belo Horizonte, Brazil},
    YEAR = {2019},
    MONTH = Jun,
    KEYWORDS = {Resolving sets ; Metric dimension ; Strongly-connected orientations},
    PDF = {https://hal.inria.fr/hal-02098194/file/oriented_metric_dimension_HAL_LAGOS.pdf},
    HAL_ID = {hal-02098194},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Christelle Caillouet, Tahiry Razafindralambo, and Dimitrios Zorbas. Optimal placement of drones for fast sensor energy replenishment using wireless power transfer. In Wireless Days 2019, Manchester, United Kingdom, April 2019.
    Note: Best Paper Award. [WWW ] [PDF ]
    @inproceedings{caillouet:hal-02043123,
    TITLE = {{Optimal placement of drones for fast sensor energy replenishment using wireless power transfer}},
    AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
    URL = {https://hal.inria.fr/hal-02043123},
    NOTE = {Best Paper Award},
    BOOKTITLE = {{Wireless Days 2019}},
    ADDRESS = {Manchester, United Kingdom},
    YEAR = {2019},
    MONTH = Apr,
    PDF = {https://hal.inria.fr/hal-02043123/file/cameraReady.pdf},
    HAL_ID = {hal-02043123},
    HAL_VERSION = {v1},
    
    }
    

     
  4. Emilio Cruciani, Emanuele Natale, and Giacomo Scornavacca. Distributed Community Detection via Metastability of the 2-Choices Dynamics. In AAAI 2019 - Thirty-Third AAAI Conference Association for the Advancement of Artificial Intelligence, Honolulu, Hawaii, United States, January 2019. [WWW ]
    @inproceedings{cruciani:hal-02002462,
    TITLE = {{Distributed Community Detection via Metastability of the 2-Choices Dynamics}},
    AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Scornavacca, Giacomo},
    URL = {https://hal.archives-ouvertes.fr/hal-02002462},
    BOOKTITLE = {{AAAI 2019 - Thirty-Third AAAI Conference Association for the Advancement of Artificial Intelligence}},
    ADDRESS = {Honolulu, Hawaii, United States},
    YEAR = {2019},
    MONTH = Jan,
    HAL_ID = {hal-02002462},
    HAL_VERSION = {v1},
    
    }
    

     
  5. Adrien Gausseran, Andrea Tomassilli, Frédéric Giroire, and Joanna Moulierac. Reconfiguration de chaînes de fonctions de services sans interruption. In Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Saint Laurent de la Cabrerisse, France, June 2019. [WWW ] [PDF ]
    Keywords: Reconfiguration, SDN, SFC, NFV.
    @inproceedings{gausseran:hal-02118989,
    TITLE = {{Reconfiguration de cha{\^i}nes de fonctions de services sans interruption}},
    AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
    URL = {https://hal.archives-ouvertes.fr/hal-02118989},
    BOOKTITLE = {{Rencontres Francophones sur la Conception de Protocoles, l’{\'E}valuation de Performance et l’Exp{\'e}rimentation des R{\'e}seaux de Communication}},
    ADDRESS = {Saint Laurent de la Cabrerisse, France},
    YEAR = {2019},
    MONTH = Jun,
    KEYWORDS = {Reconfiguration ; SDN ; SFC ; NFV},
    PDF = {https://hal.archives-ouvertes.fr/hal-02118989/file/AlgoTel.pdf},
    HAL_ID = {hal-02118989},
    HAL_VERSION = {v1},
    
    }
    

     
  6. Adrien Gausseran, Andrea Tomassilli, Frédéric Giroire, and Joanna Moulierac. Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains. In IFIP Networking, Varsovie, Poland, May 2019. [WWW ] [PDF ]
    Keywords: Service Function Chaining, Reconfiguration, Networking, Routing.
    @inproceedings{gausseran:hal-02083579,
    TITLE = {{Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains}},
    AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
    URL = {https://hal.inria.fr/hal-02083579},
    BOOKTITLE = {{IFIP Networking}},
    ADDRESS = {Varsovie, Poland},
    YEAR = {2019},
    MONTH = May,
    KEYWORDS = {Service Function Chaining ; Reconfiguration ; Networking ; Routing},
    PDF = {https://hal.inria.fr/hal-02083579/file/networking-short.pdf},
    HAL_ID = {hal-02083579},
    HAL_VERSION = {v1},
    
    }
    

     
  7. Frédéric Giroire, Nicolas Huin, Andrea Tomassilli, and Stéphane Pérennes. When Network Matters: Data Center Scheduling with Network Tasks. In INFOCOM 2019 - IEEE International Conference on Computer Communications, Paris, France, April 2019. [WWW ] [PDF ]
    @inproceedings{giroire:hal-01989755,
    TITLE = {{When Network Matters: Data Center Scheduling with Network Tasks}},
    AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Tomassilli, Andrea and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-01989755},
    BOOKTITLE = {{INFOCOM 2019 - IEEE International Conference on Computer Communications}},
    ADDRESS = {Paris, France},
    YEAR = {2019},
    MONTH = Apr,
    PDF = {https://hal.inria.fr/hal-01989755/file/infocom2019_camera_ready.pdf},
    HAL_ID = {hal-01989755},
    HAL_VERSION = {v1},
    
    }
    

     
  8. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Grids. In 11th International Conference on Algorithms and Complexity (CIAC 2019), Rome, Italy, May 2019. [WWW ] [PDF ]
    Keywords: Graphs, Eternal Domination, Combinatorial Games, Grids.
    @inproceedings{mcinerney:hal-02098169,
    TITLE = {{Eternal Domination in Grids}},
    AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
    URL = {https://hal.inria.fr/hal-02098169},
    BOOKTITLE = {{11th International Conference on Algorithms and Complexity (CIAC 2019)}},
    ADDRESS = {Rome, Italy},
    YEAR = {2019},
    MONTH = May,
    KEYWORDS = {Graphs ; Eternal Domination ; Combinatorial Games ; Grids},
    PDF = {https://hal.inria.fr/hal-02098169/file/eter_dom_grids_CIAC2019_Corrected.pdf},
    HAL_ID = {hal-02098169},
    HAL_VERSION = {v1},
    
    }
    

     
  9. Iliad Ramezani and Emanuele Natale. On the Necessary Memory to Compute the Plurality in Multi-Agent Systems. In CIAC'19 - 11th International Conference on Algorithms and Complexity, Rome, Italy, May 2019.
    Note: 14 pages, accepted at CIAC 2019. [WWW ]
    @inproceedings{ramezani:hal-02002448,
    TITLE = {{On the Necessary Memory to Compute the Plurality in Multi-Agent Systems}},
    AUTHOR = {Ramezani, Iliad and Natale, Emanuele},
    URL = {https://hal.archives-ouvertes.fr/hal-02002448},
    NOTE = {14 pages, accepted at CIAC 2019},
    BOOKTITLE = {{CIAC'19 - 11th International Conference on Algorithms and Complexity}},
    ADDRESS = {Rome, Italy},
    YEAR = {2019},
    MONTH = May,
    HAL_ID = {hal-02002448},
    HAL_VERSION = {v1},
    
    }
    

     
Internal reports
  1. Stephan Dominique Andres, François Dross, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution. Research Report, Inria - Sophia Antipolis, March 2019. [WWW ] [PDF ]
    Keywords: scoring game, strictly matched involution, NP-completeness, combinatorial game, Orthogonal Colouring Game, orthogonal graph colouring, PSPACE-completeness.
    @techreport{andres:hal-02053265,
    TITLE = {{On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution}},
    AUTHOR = {Andres, Stephan Dominique and Dross, Fran{\c c}ois and Huggan, Melissa and Mc Inerney, Fionn and Nowakowski, Richard J},
    URL = {https://hal.inria.fr/hal-02053265},
    TYPE = {Research Report},
    INSTITUTION = {{Inria - Sophia Antipolis}},
    YEAR = {2019},
    MONTH = Mar,
    KEYWORDS = {scoring game ; strictly matched involution ; NP-completeness ; combinatorial game ; Orthogonal Colouring Game ; orthogonal graph colouring ; PSPACE-completeness},
    PDF = {https://hal.inria.fr/hal-02053265/file/final06ComplexityPaperOrthogonalColouringGame.pdf},
    HAL_ID = {hal-02053265},
    HAL_VERSION = {v2},
    
    }
    

     
  2. Julien Bensmail, François Dross, Hervé Hocquard, and Eric Sopena. From light edges to strong edge-colouring of 1-planar graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Inria & Labri, Univ. Bordeaux, April 2019. [WWW ] [PDF ]
    Keywords: strong edge-colouring, strong chromatic index, 1-planar graphs, light edges.
    @techreport{bensmail:hal-02112188,
    TITLE = {{From light edges to strong edge-colouring of 1-planar graphs}},
    AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Hocquard, Herv{\'e} and Sopena, Eric},
    URL = {https://hal.archives-ouvertes.fr/hal-02112188},
    TYPE = {Research Report},
    INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Inria \& Labri, Univ. Bordeaux}},
    YEAR = {2019},
    MONTH = Apr,
    KEYWORDS = {strong edge-colouring ; strong chromatic index ; 1-planar graphs ; light edges},
    PDF = {https://hal.archives-ouvertes.fr/hal-02112188/file/1planar-strong.pdf},
    HAL_ID = {hal-02112188},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Julien Bensmail, François Dross, and Nicolas Nisse. Decomposing degenerate graphs into locally irregular subgraphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2019. [WWW ] [PDF ]
    Keywords: locally irregular decompositions, degenerate graphs, cacti, k-trees, planar graphs.
    @techreport{bensmail:hal-02090804,
    TITLE = {{Decomposing degenerate graphs into locally irregular subgraphs}},
    AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Nisse, Nicolas},
    URL = {https://hal.archives-ouvertes.fr/hal-02090804},
    TYPE = {Research Report},
    INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
    YEAR = {2019},
    KEYWORDS = {locally irregular decompositions ; degenerate graphs ; cacti ; k-trees ; planar graphs},
    PDF = {https://hal.archives-ouvertes.fr/hal-02090804/file/degenerate-irregular.pdf},
    HAL_ID = {hal-02090804},
    HAL_VERSION = {v2},
    
    }
    

     
  4. Yann Busnel, Christelle Caillouet, and David Coudert. VESPA: Constrained target coverage by distributed deployment of connected UAVs. Research Report, Inria ; I3S, Université Côte d'Azur ; IMT Atlantique, May 2019. [WWW ] [PDF ]
    @techreport{busnel:hal-02125359,
    TITLE = {{VESPA: Constrained target coverage by distributed deployment of connected UAVs}},
    AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
    URL = {https://hal.inria.fr/hal-02125359},
    TYPE = {Research Report},
    INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur ; IMT Atlantique}},
    YEAR = {2019},
    MONTH = May,
    PDF = {https://hal.inria.fr/hal-02125359/file/VESPA.pdf},
    HAL_ID = {hal-02125359},
    HAL_VERSION = {v1},
    
    }
    

     
  5. Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Mejìa Zacarìas, Ben Seamone, and Virgélot Virgile. A method for eternally dominating strong grids. Research Report, Inria - Sophia Antipolis, February 2019. [WWW ] [PDF ]
    Keywords: Graph Protection, Graphs, Eternal Domination, Combinatorial Games.
    @techreport{gagnon:hal-02004770,
    TITLE = {{A method for eternally dominating strong grids}},
    AUTHOR = {Gagnon, Aliz{\'e}e and Hassler, Alexander and Huang, Jerry and Krim-Yee, Aaron and Mc Inerney, Fionn and Zacar{\'i}as, Andr{\'e}s Mej{\'i}a and Seamone, Ben and Virgile, Virg{\'e}lot},
    URL = {https://hal.archives-ouvertes.fr/hal-02004770},
    TYPE = {Research Report},
    INSTITUTION = {{Inria - Sophia Antipolis}},
    YEAR = {2019},
    MONTH = Feb,
    KEYWORDS = {Graph Protection ; Graphs ; Eternal Domination ; Combinatorial Games},
    PDF = {https://hal.archives-ouvertes.fr/hal-02004770/file/A_method_for_eternally_dominating_strong_grids.pdf},
    HAL_ID = {hal-02004770},
    HAL_VERSION = {v1},
    
    }
    

     
  6. Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, and Rémi Watrigant. Overlaying a hypergraph with a graph with bounded maximum degree. Research Report RR-9258, Inria Sophia Antipolis, February 2019. [WWW ] [PDF ]
    Keywords: Hypergraph, graph, algorithm, complexity, computational structural biology, Hypergraphe, graphe, algorithme, complexité, biologie structurale computation-nelle.
    @techreport{havet:hal-02025469,
    TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
    AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
    URL = {https://hal.inria.fr/hal-02025469},
    TYPE = {Research Report},
    NUMBER = {RR-9258},
    INSTITUTION = {{Inria Sophia Antipolis}},
    YEAR = {2019},
    MONTH = Feb,
    KEYWORDS = {Hypergraph ; graph ; algorithm ; complexity ; computational structural biology ; Hypergraphe ; graphe ; algorithme ; complexit{\'e} ; biologie structurale computation-nelle},
    PDF = {https://hal.inria.fr/hal-02025469/file/RR-9258.pdf},
    HAL_ID = {hal-02025469},
    HAL_VERSION = {v1},
    
    }
    

     
  7. Andrea Tomassilli, giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, and Chidung Lac. Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. Research Report RR-9272, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Orange Labs R&D [Lannion] (France Télécom), April 2019. [WWW ] [PDF ]
    Keywords: Software Defined Networking SDN, Network Function Virtualization NFV, Resilient and survivable networks.
    @techreport{tomassilli:hal-02112282,
    TITLE = {{Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks}},
    AUTHOR = {Tomassilli, Andrea and Di Lena, giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and Saucez, Damien and Perennes, St{\'e}phane and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
    URL = {https://hal.inria.fr/hal-02112282},
    TYPE = {Research Report},
    NUMBER = {RR-9272},
    INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Orange Labs R\&D [Lannion] (France T{\'e}l{\'e}com)}},
    YEAR = {2019},
    MONTH = Apr,
    KEYWORDS = {Software Defined Networking SDN ; Network Function Virtualization NFV ; Resilient and survivable networks},
    PDF = {https://hal.inria.fr/hal-02112282/file/RR9272.pdf},
    HAL_ID = {hal-02112282},
    HAL_VERSION = {v1},
    
    }
    

     
Miscellaneous
  1. Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, and Luca Trevisan. Finding a Bounded-Degree Expander Inside a Dense One.
    Note: Working paper or preprint, April 2019. [WWW ] [PDF ]
    @unpublished{becchetti:hal-02002377,
    TITLE = {{Finding a Bounded-Degree Expander Inside a Dense One}},
    AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca},
    URL = {https://hal.archives-ouvertes.fr/hal-02002377},
    NOTE = {working paper or preprint},
    YEAR = {2019},
    MONTH = Apr,
    PDF = {https://hal.archives-ouvertes.fr/hal-02002377/file/Finding_a_Bounded_Degree_Expander_Inside_a_Dense_One.pdf},
    HAL_ID = {hal-02002377},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, and Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ]
    @unpublished{bensmail:hal-01851600,
    TITLE = {{Backbone colouring and algorithms for TDMA scheduling}},
    AUTHOR = {Bensmail, Julien and Blanc, Thibaut and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Rocha, Leonardo},
    URL = {https://hal.archives-ouvertes.fr/hal-01851600},
    NOTE = {working paper or preprint},
    YEAR = {2019},
    MONTH = Jan,
    PDF = {https://hal.archives-ouvertes.fr/hal-01851600/file/BMRN-active.pdf},
    HAL_ID = {hal-01851600},
    HAL_VERSION = {v2},
    
    }
    

     
  3. Julien Bensmail, Fionn Mc Inerney, and Kasper Lyngsie. On a,b-edge-weightings of bipartite graphs with odd a,b.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ]
    @unpublished{bensmail:hal-01988399,
    TITLE = {{On {a,b}-edge-weightings of bipartite graphs with odd a,b}},
    AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Lyngsie, Kasper},
    URL = {https://hal.archives-ouvertes.fr/hal-01988399},
    NOTE = {working paper or preprint},
    YEAR = {2019},
    MONTH = Jan,
    PDF = {https://hal.archives-ouvertes.fr/hal-01988399/file/odd-odd-bip.pdf},
    HAL_ID = {hal-01988399},
    HAL_VERSION = {v1},
    
    }
    

     
  4. Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, and Philippe Nain. Distributed Link Scheduling in Wireless Networks.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ]
    Keywords: Wireless network, Stability, Distributed algorithm, Interference, Transmission scheduling.
    @unpublished{bermond:hal-01977266,
    TITLE = {{Distributed Link Scheduling in Wireless Networks}},
    AUTHOR = {Bermond, Jean-Claude and Mazauric, Dorian and Misra, Vishal and Nain, Philippe},
    URL = {https://hal.inria.fr/hal-01977266},
    NOTE = {working paper or preprint},
    YEAR = {2019},
    MONTH = Jan,
    KEYWORDS = {Wireless network ; Stability ; Distributed algorithm ; Interference ; Transmission scheduling},
    PDF = {https://hal.inria.fr/hal-01977266/file/main.pdf},
    HAL_ID = {hal-01977266},
    HAL_VERSION = {v1},
    
    }
    

     
  5. Nathann Cohen. Several Graph problems and their Linear Program formulations.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ]
    @unpublished{cohen:inria-00504914,
    TITLE = {{Several Graph problems and their Linear Program formulations}},
    AUTHOR = {Cohen, Nathann},
    URL = {https://hal.inria.fr/inria-00504914},
    NOTE = {working paper or preprint},
    YEAR = {2019},
    MONTH = Jan,
    PDF = {https://hal.inria.fr/inria-00504914/file/LP_formulations.pdf},
    HAL_ID = {inria-00504914},
    HAL_VERSION = {v2},
    
    }
    

     

BACK TO COATI PUBLICATION INDEX



Last modified: Wed Oct 9 16:05:41 2019