BACK TO COATI PUBLICATION INDEX

Publications of year 2019

Thesis
  1. Fionn Mc Inerney. Domination and identification games in graphs. Theses, Université Côte d'Azur, July 2019. [WWW ] [PDF ]
    Keywords: Algorithm, Graph theory, Combinatorial games, Cops and robber games, Algorithmes, Jeux combinatoires, Jeux des gendarmes et voleur, Théorie des graphes. [bibtex-entry]
     
  2. Andrea Tomassilli. Towards next generation networks with SDN and NFV. Theses, Université Côte d'Azur, June 2019. [WWW ] [PDF ]
    Keywords: Service Function Chaining (SFC), Approximations algorithms, Network optimization, Network Function Virtualization (NFV), Software Defined Networks (SDN), Virtualisation des fonctions réseau NFV, Réseaux logiciels SDN, Algorithmes d'approximations, Optimisation réseaux de communication, Chaïnes de fonctions de service. [bibtex-entry]
     
Articles in journal or book's chapters
  1. Nicolas Nisse. Network Decontamination. In Distributed Computing by Mobile Entities, volume 11340 of LNCS, pages 516-548. Springer, 2019. [WWW ] [PDF ]
    Keywords: Computational Complexity, (Distributed) Graph Algorithms, Graph Searching, Path-and Tree-Decompositions. [bibtex-entry]
     
  2. Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F S Moura, and Stéphan Thomassé. Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. The Electronic Journal of Combinatorics, 26:P3.19, July 2019. [WWW ] [PDF ] [bibtex-entry]
     
  3. 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. [bibtex-entry]
     
  4. Stephan Dominique Andres, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. The Orthogonal Colouring Game. Theoretical Computer Science, 795:312-325, February 2019. [WWW ] [PDF ]
    Keywords: Orthogonal Colouring Game, strictly matched involution, games on graphs, scoring game, orthogonal graph colouring, mutually orthogonal Latin squares. [bibtex-entry]
     
  5. Spyros Angelopoulos, Nicolas Nisse, and Dimitrios M. Thilikos. Preface to special issue on Theory and Applications of Graph Searching. Theoretical Computer Science, 794:1-2, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
  6. Jorgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, and Anders Yeo. Bipartite spanning sub(di)graphs induced by 2-partitions. Journal of Graph Theory, 92(2):130-151, October 2019. [WWW ] [PDF ]
    Keywords: Eulerian, Spanning bipartite subdigraph, Strong spanning subdigraph, 2-partition, Minimum out-degree. [bibtex-entry]
     
  7. 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, 21(1), April 2019. [WWW ] [PDF ]
    Keywords: Coloured weighted degrees, 1-2-3 Conjecture, Locally irregular decompositions. [bibtex-entry]
     
  8. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, and Eric Sopena. Edge Weights and Vertex Colours: Minimizing Sum Count. Discrete Applied Mathematics, 270:13-24, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
  9. L. Becchetti, A. Clementi, Emanuele Natale, F. Pasquale, and G. Posta. Self-stabilizing repeated balls-into-bins. Distributed Computing, 32(1):59-68, February 2019. [WWW ] [bibtex-entry]
     
  10. Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, and Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling. Discrete Mathematics and Theoretical Computer Science, Vol. 21 no. 3(3):#24, July 2019. [WWW ] [PDF ]
    Keywords: Wireless networks, TDMA scheduling, Backbone colouring, Algorithmic complexity. [bibtex-entry]
     
  11. Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, and Stéphan Thomassé. Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Combinatorica, 39(2):239-263, April 2019. [WWW ] [PDF ] [bibtex-entry]
     
  12. Julien Bensmail, Fionn Mc Inerney, and Kasper Lyngsie. On a,b-edge-weightings of bipartite graphs with odd a,b. Discussiones Mathematicae Graph Theory, 2019. [WWW ] [PDF ] [bibtex-entry]
     
  13. Julien Bensmail and Jakub Przybyƚo. Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discrete Applied Mathematics, September 2019. [WWW ] [PDF ]
    Keywords: graph decomposition, 1-2-3 Conjecture, locally irregular graph. [bibtex-entry]
     
  14. 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, Four weights, 5-regular graphs. [bibtex-entry]
     
  15. Julien Bensmail. On the 2-edge-coloured chromatic number of grids. The Australasian Journal of Combinatorics, 75(3):365-384, 2019. [WWW ] [PDF ]
    Keywords: grids, oriented chromatic number, 2-edge-coloured chromatic number. [bibtex-entry]
     
  16. Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, and Dorian Mazauric. How long does it take for all users in a social network to choose their communities?. Discrete Applied Mathematics, 270:37-57, 2019. [WWW ] [PDF ]
    Keywords: graphs, communities, social networks, algorithms, integer partitions, coloring games. [bibtex-entry]
     
  17. Jean-Claude Bermond and Fatima Zahra Moataz. On spectrum assignment in elastic optical tree-networks. Discrete Applied Mathematics, 257:40-52, 2019. [WWW ] [PDF ]
    Keywords: Elastic optical networks, spectrum assignment, interval coloring, chordal graphs. [bibtex-entry]
     
  18. Anthony Bonato, Nancy Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, and Margaret-Ellen Messinger. Hyperopic Cops and Robbers. Theoretical Computer Science, 794:59-68, 2019. [WWW ] [PDF ] [bibtex-entry]
     
  19. 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 ] [PDF ]
    Keywords: shortest path algorithm, graph mining, sampling, network analysis, Betweenness centrality. [bibtex-entry]
     
  20. Nicolas Bousquet, William Lochet, and Stéphan Thomassé. A proof of the Erdös--Sands--Sauer--Woodrow conjecture. Journal of Combinatorial Theory, Series B, 137:316-319, July 2019. [WWW ] [PDF ]
    Keywords: Tournaments, Domination, Transitive digraphs. [bibtex-entry]
     
  21. 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: Wireless Sensor Network, Coverage, UAV. [bibtex-entry]
     
  22. David Coudert, Guillaume Ducoffe, and Alexandru Popa. P-FPT algorithms for bounded clique-width graphs. ACM Transactions on Algorithms, 15(3):1-57, June 2019. [WWW ] [PDF ] [bibtex-entry]
     
  23. François Dross and Frédéric Havet. On the Unavoidability of Oriented Trees. Electronic Notes in Theoretical Computer Science, 346:425-436, August 2019. [WWW ] [PDF ]
    Keywords: Tournament, oriented trees, unavoidability, Ramsey theory. [bibtex-entry]
     
  24. Pierre Fraigniaud and Emanuele Natale. Noisy rumor spreading and plurality consensus. Distributed Computing, 32(4):257-276, 2019. [WWW ] [PDF ]
    Keywords: Noise, Biological distributed algorithms, PUSH model, Plurality consensus, Rumor spreading. [bibtex-entry]
     
  25. Valentin Garnero, Christophe Paul, Ignasi Sau Valls, and Dimitrios M. Thilikos. Explicit Linear Kernels for Packing Problems. Algorithmica, 81(4):1615-1656, April 2019. [WWW ] [PDF ]
    Keywords: Parameterized complexity, linear kernels, packing problems, dynamic pro- gramming, protrusion replacement, graph minors. [bibtex-entry]
     
  26. Frédéric Havet and Nicolas Nisse. Constrained ear decompositions in graphs and digraphs. Discrete Mathematics and Theoretical Computer Science, vol. 21 no. 4, September 2019. [WWW ] [PDF ] [bibtex-entry]
     
  27. Brigitte Jaumard, Hamed Pouya, and David Coudert. Wavelength Defragmentation for Seamless Migration. Journal of Lightwave Technology, 37(17):4382-4393, September 2019. [WWW ] [PDF ]
    Keywords: Network Reconfig- uration, Network Reconfiguration, Fragmented Network, Routing and Wavelength Assignment, Wavelength Defragmentation, Seamless Defragmentation, Make-Before-Break Rerouting. [bibtex-entry]
     
  28. Kolja Knauer and Nicolas Nisse. Computing metric hulls in graphs. Discrete Mathematics and Theoretical Computer Science, vol. 21 no. 1, ICGT 2018, May 2019. [WWW ] [PDF ] [bibtex-entry]
     
  29. William Lochet. Immersion of transitive tournaments in digraphs with large minimum outdegree. Journal of Combinatorial Theory, Series B, 134:350-353, January 2019. [WWW ] [PDF ]
    Keywords: Immersions, Digraphs, Transitive tournaments. [bibtex-entry]
     
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. [bibtex-entry]
     
  2. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. In LAGOS 2019 - 10th Latin & American Algorithms, Graphs and Optimization Symposium, volume 346 of Electronic Notes in Theoretical Computer Science, Belo Horizonte, Brazil, pages 111-123, June 2019. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Resolving sets, Metric dimension. [bibtex-entry]
     
  3. Jean-Claude Bermond, Takako Kodate, and Joseph Yu. Gossiping with interference in radio chain networks (upper bound algorithms). In JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Tokyo, Japan, September 2019. [WWW ] [PDF ] [bibtex-entry]
     
  4. Yann Busnel, Christelle Caillouet, and David Coudert. Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities. In NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications, Cambridge, United States, pages 1-5, September 2019. IEEE. [WWW ] [PDF ] [bibtex-entry]
     
  5. Yann Busnel, Christelle Caillouet, and David Coudert. Self-organized Disaster Management System by Distributed Deployment of Connected UAVs. In ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management, Paris, France, pages 1-8, December 2019. [WWW ] [PDF ] [bibtex-entry]
     
  6. Christelle Caillouet, Martin Heusse, and Franck Rousseau. Optimal SF Allocation in LoRaWAN Considering Physical Capture and Imperfect Orthogonality. In GLOBECOM 2019 - IEEE Global Communications Conference, Waikoloa, United States, December 2019. [WWW ] [PDF ] [bibtex-entry]
     
  7. Christelle Caillouet, Tahiry Razafindralambo, and Dimitrios Zorbas. Optimal placement of drones for fast sensor energy replenishment using wireless power transfer. In WD 2019 - Wireless Days 2019, Manchester, United Kingdom, April 2019.
    Note: Best Paper Award. [WWW ] [PDF ] [bibtex-entry]
     
  8. Christelle Caillouet, Tahiry Razafindralambo, and Dimitrios Zorbas. Utiliser des drones pour recharger efficacement des capteurs. 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 ] [bibtex-entry]
     
  9. Emilio Cruciani, Emanuele Natale, and Giacomo Scornavacca. Distributed Community Detection via Metastability of the 2-Choices Dynamics. In AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence, Honolulu, United States, January 2019. [WWW ] [PDF ] [bibtex-entry]
     
  10. Giuseppe Di Lena, Andrea Tomassilli, Damien Saucez, Frédéric Giroire, Thierry Turletti, and Chidung Lac. Mininet on steroids: exploiting the cloud for Mininet performance. In CloudNet 2019 - IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
  11. Adrien Gausseran, Andrea Tomassilli, Frédéric Giroire, and Joanna Moulierac. Reconfiguration de chaînes de fonctions de services sans interruption. In CORES 2019 - 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: NFV, SDN, Reconfiguration, SFC. [bibtex-entry]
     
  12. 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 Conference 2019, Varsovie, Poland, May 2019. [WWW ] [PDF ]
    Keywords: Reconfiguration, Service Function Chaining, Networking, Routing. [bibtex-entry]
     
  13. Adrien Gausseran, Andrea Tomassilli, Frédéric Giroire, and Joanna Moulierac. No Interruption When Reconfiguring my SFCs. In CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019.
    Note: This work has been supported by the French government through the UCAJEDI (ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Future projects, and by Inria associated team EfDyNet. [WWW ] [PDF ] [bibtex-entry]
     
  14. 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 ] [bibtex-entry]
     
  15. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Grids. In CIAC 2019 - 11th International Conference on Algorithms and Complexity, volume 11485 of Algorithms and Complexity. Lecture Notes in Computer Science, Rome, Italy, pages 311-322, May 2019. [WWW ] [PDF ]
    Keywords: Grids, Combinatorial Games, Graphs, Eternal Domination. [bibtex-entry]
     
  16. Cedric Morin, Géraldine Texier, Christelle Caillouet, Gilles Desmangles, and Cao-Thanh Phan. VNF placement algorithms to address the mono- and multi-tenant issues in edge and core networks. In CLOUDNET 2019 : 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019. [WWW ] [PDF ]
    Keywords: mono-tenant architecture, multi- tenant architecture, VNF placement optimization. [bibtex-entry]
     
  17. Emanuele Natale and Iliad Ramezani. On the Necessary Memory to Compute the Plurality in Multi-Agent Systems. In CIAC 2019 - 11th International Conference Algorithms and Complexity, Rome, Italy, pages 323-338, May 2019.
    Note: 14 pages, accepted at CIAC 2019. [WWW ] [PDF ] [bibtex-entry]
     
  18. Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, and Chidung Lac. Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. In CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
  19. Andrea Tomassilli, Nicolas Huin, and Frédéric Giroire. The Structured Way of Dealing with Heterogeneous Live Streaming Systems. In 3PGCIC - International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, Advances on P2P, Parallel, Grid, Cloud and Internet Computing, Anvers, Belgium, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
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. [bibtex-entry]
     
  2. Hossein Baktash, Emanuele Natale, and Laurent Viennot. A Comparative Study of Neural Network Compression. Research Report, INRIA Sophia Antipolis - I3S, October 2019. [WWW ] [PDF ] [bibtex-entry]
     
  3. 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 ] [bibtex-entry]
     
  4. Adrien Gausseran, Frédéric Giroire, Brigitte Jaumard, and Joanna Moulierac. Be Scalable and Rescue My Slices During Reconfiguration. Research Report, Inria - Sophia Antipolis ; I3S, Université Côte d'Azur ; Concordia University, December 2019. [WWW ] [PDF ]
    Keywords: Reconfiguration, Software Defined Networking, Service Function Chains, Network Function Virtualization. [bibtex-entry]
     
  5. 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: computational structural biology, Hypergraph, graph, algorithm, complexity, Hypergraphe, graphe, algorithme, complexité, biologie structurale computation-nelle. [bibtex-entry]
     
  6. 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, INRIA Sophia Antipolis - I3S, April 2019. [WWW ] [PDF ]
    Keywords: network resilience strategies, Network Function Virtualization, Software Defined Networking. [bibtex-entry]
     
Miscellaneous
  1. Giuseppe Di Lena, Andrea Tomassilli, Damien Saucez, Frédéric Giroire, Thierry Turletti, and Chidung Lac. Demo Proposal - Distrinet: a Mininet implementation for the Cloud. CoNEXT 2019 - 15th International Conference on emerging Networking EXperiments and Technologies, December 2019.
    Note: Poster. [WWW ] [PDF ] [bibtex-entry]
     
  2. Giuseppe Di Lena, Andrea Tomassilli, Damien Saucez, Frédéric Giroire, Thierry Turletti, Chidung Lac, and Walid Dabbous. Distributed Network Experiment Emulation. GEFI 19 - Global Experimentation for Future Internet - Workshop, November 2019. [WWW ] [PDF ] [bibtex-entry]
     
  3. Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Stéphane Pérennes, Damien Saucez, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, and Chidung Lac. Poster: Design of Survivable SDN/NFV-enabled Networks with Bandwidth-optimal Failure Recovery. NETWORKING 2019 - IFIP Networking conference, May 2019.
    Note: Poster. [WWW ] [PDF ] [bibtex-entry]
     
  4. Jean-Claude Bermond, Takako Kodate, and Joseph Yu. Gossiping with interference in radio chain networks.
    Note: Working paper or preprint, December 2019. [WWW ] [PDF ]
    Keywords: chains, Interference, paths, Radio Networks, Gossiping. [bibtex-entry]
     
  5. Jean-Claude Bermond, Takako Kodate, and Joseph Yu. Gossiping with interference in radio ring networks.
    Note: Working paper or preprint, December 2019. [WWW ] [PDF ]
    Keywords: Gossiping, Radio Networks, Interference, Rings. [bibtex-entry]
     
  6. Nathann Cohen. Several Graph problems and their Linear Program formulations.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Sat Jan 29 19:00:41 2022