Publications of year 2017

BACK TO COATI PUBLICATION INDEX

Publications of year 2017

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. 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},
    
    }
    

     
  3. 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},
    
    }
    

     
  4. 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},
    
    }
    

     
  5. 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},
    
    }
    

     
  6. 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},
    
    }
    

     
  7. 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},
    
    }
    

     
  8. 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},
    
    }
    

     
  9. 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), 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},
    
    }
    

     
  2. 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},
    
    }
    

     
  3. 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},
    
    }
    

     
  4. 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},
    
    }
    

     
  5. 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},
    
    }
    

     
  6. 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},
    
    }
    

     
  7. 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},
    
    }
    

     
  8. 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},
    
    }
    

     
  9. 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},
    
    }
    

     
  10. 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. Nathann Cohen, Nìcolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Spy-Game on graphs: complexity and simple topologies. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: Cops and Robber games, graphs, PSPACE-hard.
    @techreport{cohen:hal-01463297,
    TITLE = {{Spy-Game on graphs: complexity and simple topologies}},
    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-01463297},
    TYPE = {Research Report},
    INSTITUTION = {{Inria Sophia Antipolis}},
    YEAR = {2017},
    KEYWORDS = {Cops and Robber games ; graphs ; PSPACE-hard},
    PDF = {https://hal.archives-ouvertes.fr/hal-01463297/file/Spygames1.pdf},
    HAL_ID = {hal-01463297},
    HAL_VERSION = {v1},
    
    }
    

     
  3. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: Linear Programming, Cops and Robber games, Graphs.
    @techreport{cohen:hal-01462890,
    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.archives-ouvertes.fr/hal-01462890},
    TYPE = {Research Report},
    INSTITUTION = {{Inria Sophia Antipolis}},
    YEAR = {2017},
    KEYWORDS = {Linear Programming ; Cops and Robber games ; Graphs},
    PDF = {https://hal.archives-ouvertes.fr/hal-01462890/file/GridsTreesafterISAAC2017.pdf},
    HAL_ID = {hal-01462890},
    HAL_VERSION = {v2},
    
    }
    

     
  4. David Coudert, Guillaume Ducoffe, and Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Research Report, Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania, July 2017. [WWW ] [PDF ]
    Keywords: Neighbourhood diversity, Primeval decomposition, Clique-width, Modular decomposition, Split decomposition, Hardness in P, Fully polynomial FPT, Graph algorithms.
    @techreport{coudert:hal-01562413,
    TITLE = {{Fully polynomial FPT algorithms for some classes of bounded clique-width graphs }},
    AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru},
    URL = {https://hal.archives-ouvertes.fr/hal-01562413},
    TYPE = {Research Report},
    INSTITUTION = {{Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania}},
    YEAR = {2017},
    MONTH = Jul,
    KEYWORDS = { Neighbourhood diversity ; Primeval decomposition ; Clique-width ; Modular decomposition ; Split decomposition ; Hardness in P ; Fully polynomial FPT ; Graph algorithms},
    PDF = {https://hal.archives-ouvertes.fr/hal-01562413/file/pfpt.pdf},
    HAL_ID = {hal-01562413},
    HAL_VERSION = {v1},
    
    }
    

     
  5. Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, and Alexandru Popa. On the (di)graphs with (directed) proper connection number two. Research Report, Université Côte d’Azur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania, March 2017. [WWW ] [PDF ]
    @techreport{ducoffe:hal-01491146,
    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-01491146},
    TYPE = {Research Report},
    INSTITUTION = {{Universit{\'e} C{\^o}te d’Azur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania}},
    YEAR = {2017},
    MONTH = Mar,
    PDF = {https://hal.archives-ouvertes.fr/hal-01491146/file/directed-proper-connectivity.pdf},
    HAL_ID = {hal-01491146},
    HAL_VERSION = {v1},
    
    }
    

     
  6. Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. Research Report, Université Côte d’Azur, Inria, CNRS, I3S, France, February 2017. [WWW ] [PDF ]
    Keywords: square root, biconnected components, clique cutset, cactus-block graph, Gallai tree, cycle-power graph, circular-arc graph.
    @techreport{ducoffe:hal-01477981,
    TITLE = {{Finding cut-vertices in the square roots of a graph}},
    AUTHOR = {Ducoffe, Guillaume},
    URL = {https://hal.archives-ouvertes.fr/hal-01477981},
    TYPE = {Research Report},
    INSTITUTION = {{Universit{\'e} C{\^o}te d’Azur, Inria, CNRS, I3S, France}},
    YEAR = {2017},
    MONTH = Feb,
    KEYWORDS = {square root ; biconnected components ; clique cutset ; cactus-block graph ; Gallai tree ; cycle-power graph ; circular-arc graph},
    PDF = {https://hal.archives-ouvertes.fr/hal-01477981/file/square-root.pdf},
    HAL_ID = {hal-01477981},
    HAL_VERSION = {v2},
    
    }
    

     
  7. Frédéric Giroire, Nicolas Huin, and Andrea Tomassilli. The Structured Way of Dealing with Heterogeneous Live Streaming Systems. Research Report RR-9070, Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur, June 2017. [WWW ] [PDF ]
    Keywords: distributed algorithms, reliability, diffusion tree, protocols, churn, peer-to-peer, video streaming, pair-à-pair, diffusion video en direct, protocoles, fiabilité, arbre de diffusion, algorithmes distribués.
    @techreport{giroire:hal-01538587,
    TITLE = {{The Structured Way of Dealing with Heterogeneous Live Streaming Systems}},
    AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Tomassilli, Andrea},
    URL = {https://hal.inria.fr/hal-01538587},
    TYPE = {Research Report},
    NUMBER = {RR-9070},
    PAGES = {25},
    INSTITUTION = {{Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur}},
    YEAR = {2017},
    MONTH = Jun,
    KEYWORDS = { distributed algorithms ; reliability ; diffusion tree ; protocols ; churn ; peer-to-peer ; video streaming ; pair-{\`a}-pair ; diffusion video en direct ; protocoles ; fiabilit{\'e} ; arbre de diffusion ; algorithmes distribu{\'e}s},
    PDF = {https://hal.inria.fr/hal-01538587/file/RR-9070.pdf},
    HAL_ID = {hal-01538587},
    HAL_VERSION = {v1},
    
    }
    

     
  8. 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. Research Report RR-9020, INRIA Sophia Antipolis - I3S ; I3S, January 2017. [WWW ] [PDF ]
    Keywords: Software Defined Network, energy saving, energy aware routing, hybrid network, packet loss.
    @techreport{huin:hal-01445893,
    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 Pacheco, Dino Lopez and Urvoy-Keller, Guillaume and Moulierac, Joanna},
    URL = {https://hal.inria.fr/hal-01445893},
    TYPE = {Research Report},
    NUMBER = {RR-9020},
    INSTITUTION = {{INRIA Sophia Antipolis - I3S ; I3S}},
    YEAR = {2017},
    MONTH = Jan,
    KEYWORDS = {Software Defined Network ; energy saving ; energy aware routing ; hybrid network ; packet loss},
    PDF = {https://hal.inria.fr/hal-01445893/file/RR-9020.pdf},
    HAL_ID = {hal-01445893},
    HAL_VERSION = {v1},
    
    }
    

     
  9. Kolja Knauer and Nicolas Nisse. Computing metric hulls in graphs. Research Report, Inria - Sophia Antipolis, 2017. [WWW ] [PDF ]
    @techreport{knauer:hal-01612515,
    TITLE = {{Computing metric hulls in graphs}},
    AUTHOR = {Knauer, Kolja and Nisse, Nicolas},
    URL = {https://hal.inria.fr/hal-01612515},
    TYPE = {Research Report},
    INSTITUTION = {{Inria - Sophia Antipolis}},
    YEAR = {2017},
    PDF = {https://hal.inria.fr/hal-01612515/file/metriccomplexities.pdf},
    HAL_ID = {hal-01612515},
    HAL_VERSION = {v1},
    
    }
    

     
Miscellaneous
  1. Olivier Baudon, Julien Bensmail, Mohammed Senhaji, and Eric Sopena. Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture.
    Note: Working paper or preprint, May 2017. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, Difference-2 distinction, Bipartite graphs.
    @unpublished{baudon:hal-01522853,
    TITLE = {{Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture}},
    AUTHOR = {Baudon, Olivier and Bensmail, Julien and Senhaji, Mohammed and Sopena, Eric},
    URL = {https://hal.archives-ouvertes.fr/hal-01522853},
    NOTE = {working paper or preprint},
    YEAR = {2017},
    MONTH = May,
    KEYWORDS = {1-2-3 Conjecture ; Difference-2 distinction ; Bipartite graphs},
    PDF = {https://hal.archives-ouvertes.fr/hal-01522853/file/v3_123doubled.pdf},
    HAL_ID = {hal-01522853},
    HAL_VERSION = {v1},
    
    }
    

     
  2. Julien Bensmail. A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs.
    Note: Working paper or preprint, April 2017. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, four weights, 5-regular graphs.
    @unpublished{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},
    NOTE = {working paper or preprint},
    YEAR = {2017},
    MONTH = Apr,
    KEYWORDS = {1-2-3 Conjecture ; four weights ; 5-regular graphs},
    PDF = {https://hal.archives-ouvertes.fr/hal-01509365/file/123reg.pdf},
    HAL_ID = {hal-01509365},
    HAL_VERSION = {v1},
    
    }
    

     

BACK TO COATI PUBLICATION INDEX



Last modified: Fri Oct 20 15:06:04 2017