6.1.1 k shortest simple paths

• Name: k shortest simple paths
• Keywords: Graph, Graph algorithmics
• Functional Description: Implementation in C++ of algorithms for computing the k shortest simple paths from a source to a destination in a weighted directed graph.
• Release Contributions: This version implements the standard algorithm proposed by Yen (Yen), Node Classification algorithm proposed by Feng (NC), the Sidetrack Based algorithm proposed by Kurz and Mutzel (SB), and variants of SB proposed by Al Zoobi, Coudert and Nisse to reduce running time (SB*) and memory usage (PSB).
• URL: https://gitlab.inria.fr/dcoudert/k-shortest-simple-paths
• Publication: hal-02865918
• Contact: David Coudert
• Participants: David Coudert, Nicolas Nisse, Ali Al Zoobi

6.1.2 FastGRACE

• Keywords: Graph algorithmics, Java, Data Exploration, Data base
• Functional Description:

  Modeling of a database linking users to their studies and careers in the form of a graph. Algorithms for graphs associated with the queries made (of the type: number of users who have completed a given curriculum, distribution of careers following a given curriculum, distribution of curriculums preceding a given career, etc.). Scaling for a database of >100 million users.

  In addition, Neo4j implemetations of various algorithms tested on the HumanRoads data.

• Authors: Nicolas Chleq, Frédéric Giroire, Luc Hogie, Nicolas Nisse
• Contacts: Nicolas Nisse, Frédéric Giroire
• Participants: Nicolas Chleq, Frédéric Giroire, Luc Hogie, Nicolas Nisse

6.1.3 Sagemath

• Name: SageMath
• Keywords: Graph algorithmics, Graph, Combinatorics, Probability, Matroids, Geometry, Numerical optimization
• Scientific Description: SageMath is a free open-source mathematics software system. It builds on top of many existing open-source packages: NumPy, SciPy, matplotlib, Sympy, Maxima, GAP, FLINT, R and many more. Access their combined power through a common, Python-based language or directly via interfaces or wrappers.
• Functional Description: SageMath is an open-source mathematics software initially created by William Stein (Professor of mathematics at Washington University). We contribute the addition of new graph algorithms along with their documentations and the improvement of underlying data structures.
• Release Contributions: See http://www.sagemath.org/changelogs/
• News of the Year: 1) Improvement of methods related to distances (shortest paths, radius, diameter, eccentricities). Done in the context of Google Summer of Code 2020. 2) Implementation of various algorithms such as linear time Lex-BFS, decomposition of a graph by clique minimal separators, Wiener index, distance distribution, Cheeger constants, etc.
• URL: http://www.sagemath.org/
• Contact: David Coudert
• Participant: David Coudert

6.1.4 JMaxGraph

• Keywords: Java, HPC, Graph algorithmics
• Functional Description: JMaxGraph is a collection of techniques for the computation of large graphs on one single computer. The motivation for such a centralized computing platform originates in the constantly increasing efficiency of computers which now come with hundred gigabytes of RAM, tens of cores and fast drives. JMaxGraph implements a compact adjacency-table for the representation of the graph in memory. This data structure is designed to 1) be fed page by page, à-la GraphChi, 2) enable fast iteration, avoiding memory jumps as much as possible in order to benefit from hardware caches, 3) be tackled in parallel by multiple-threads. Also, JMaxGraph comes with a flexible and resilient batch-oriented middleware, which is suited to executing long computations on shared clusters. The first use-case of JMaxGraph allowed F. Giroire, T. Trolliet and S. Pérennes to count K2,2s, and various types of directed triangles in the Twitter graph of users (23G arcs, 400M vertices). The computation campaign took 4 days, using up to 400 cores in the NEF Inria cluster.
• URL: http://www.i3s.unice.fr/~hogie/software/?name=jmaxgraph
• Contacts: Luc Hogie, Michel Syska, Stéphane Pérennes

6.1.5 Idawi

• Keywords: Java, Distributed, Distributed computing, Distributed Applications, Web Services, Parallel computing, Component models, Software Components, P2P, Dynamic components, Iot
• Functional Description:

  Idawi is a middleware for the development and experimentation of distributed algorithms. It boasts a very general and flexible multi-hop component-oriented model that make it applicable in many contexts such as parallel and distributed computing, cloud, Internet of Things (IOT), P2P networks, etc. Idawi components can be deployed anywhere a SSH connection is possible. They exhibit services which communicate with each other via explicit messaging. Messages and be sent in either synchronously or asynchronously, and they can be handled in either procedural (with the optional use of futures) or reactive (event-driven) fashion. In the latter case, multi-threading is used to maximize both speed and number of components in the system. Idawi message transport is done via TCP, UDP, SSH or shared-memory.

  Idawi is a synthesis of the past developments of the COATI Research group in the field of graph algorithms for big graphs, and it is designed to be useful to the current and future Research project of COATI and KAIROS groups.

• URL: https://github.com/lhogie/idawi
• Contact: Luc Hogie

7.1.1 Network slicing and Network Function Virtualization

Recent advances in networks such as Software Defined Networking (SDN) and Network Function Virtualization (NFV) are changing the way network operators deploy and manage Internet services. On the one hand, SDN introduces a logically centralized controller with a global view of the network state. On the other hand, NFV enables the complete decoupling of network functions from proprietary appliances and runs them as software applications on general purpose servers. In such a way, network operators can dynamically deploy Virtual Network Functions (VNFs). SDN and NFV, both separately, bring to network operators new opportunities for reducing costs, enhancing network flexibility and scalability, and shortening the time-to-market of new applications and services. Moreover, the centralized routing model of SDN jointly with the possibility of instantiating VNFs on demand may open the way for an even more efficient operation and resource management of networks. For instance, an SDN/NFV-enabled network may simplify the Service Function Chain (SFC) deployment and provisioning by making the process easier and cheaper. We addressed several questions in this context.

In 62, 63, 64 we address a cost minimization problem encountered by network operators subscribing to public cloud offers to embed network functions. The diversity of offers, in terms of resource capacity and price, makes it difficult to find the optimal combination of offers that meets all needs at the lowest cost. We propose to solve this issue with an algorithm designed to help a network operator to select the best combination of offers (in terms of price) to reserve the virtual machines needed to support a set of network services. We analyze the computation time of our solution against various metrics, and estimate the cost savings compared to a traditional resource provision scheme or an unplanned resource rental strategy. Finally we evaluate the opportunity for a network operator to build its own datacenter, considering the existence of offers from public clouds.

In 55, we consider the problem of network slice reconfiguration without interruption. A network slice can be seen as a virtual network embedded on the physical topology, with some VNFs placed in specific nodes. As an example, a simplified network slice could be an SFC. Reconfiguring from time to time network slices allows to reduce the network operational costs and to increase the number of slices that can be managed within the network. However, it impacts users' Quality of Service during the reconfiguration step. To solve this issue, we study solutions implementing a make-before-break scheme. We propose new models and scalable algorithms (relying on column generation techniques) that solve large data instances in few seconds.

In 61 we propose and implement a new placement module for distributed emulation of SDN/NFV emulation. To handle the ever growing demand of resource intensive experiments distributed, network emulation tools such as Mininet and Maxinet have been proposed. They automatically allocate experimental resources. However, we have shown that resources are poorly allocated, leading to resource overloading and hence to dubious experimental results. Our new algorithms take into account both link and node resources and minimize the number of physical hosts needed to carry out the emulation. Through extensive numerical evaluations, simulations, and actual experiments , we show that our placement methods outperform existing ones and allowing to re-establish trust in experimental results.

7.1.2 Optimization of LoRa networks for the IoT

7.1.3 Link scheduling in wireless networks

7.1.4 Optimizing drone coverage

The use of autonomous unmanned aerial vehicles (UAVs) or drones has emerged to efficiently collect data from mobile sensors when there is no infrastructure available. The drones can form a flying ad-hoc network through which the sensors can send their data to a base station at any time.

In 53, we present a mixed integer linear program to find the drones’ optimal trajectories to form and maintain this network through time while minimizing their movements and energy consumption. Furthermore we analyze the trade-off between distance and energy, where increasing the drones’ mobility can reduce their energy consumption, and derive a fair trade-off optimal solution to balance the two opposite objectives.

In 46, we propose VESPA, a distributed algorithm using only one-hop information of the drones, to discover targets with unknown location and auto-organize themselves to ensure connectivity between them and the sink in a multi-hop aerial wireless network. We prove that connectivity, termination and coverage are preserved during all stages of our algorithm, and we evaluate the algorithm performances through simulations. Comparison with a prior work shows the efficiency of VESPA both in terms of discovered targets and number of used drones.

7.2.1 Complexity of graph problems

7.2.2 Combinatorial games in graphs

7.2.3 Algorithms engineering

7.2.4 Algorithms for social networks

7.2.5 Distributed algorithms

7.3.1 Distinguishing labelling problems

In distinguishing labelling problems, the general goal is, given a graph, to label some of its elements so that some pairs of elements can be distinguished accordingly to some parameter computed from the labelling. Note that this description involves many parameters that can be played with, such as the set of elements to be labelled, the set of labels to be assigned, the set of elements to be distinguished, and the distinguishing parameter computed from the labelling. A notable example is the so-called 1-2-3 Conjecture, which asks whether almost all graphs can have their edges labelled with 1,2,3 so that every two adjacent vertices are distinguished accordingly to their sums of incident labels.

We have recently obtained a number of results, related both to the 1-2-3 Conjecture and related problems. These results stand both as notable progress towards some open questions, and as new problems of independent interest.

• In a series of works, namely 45, 74, 75, 76, we have introduced and studied optimisation variants of the 1-2-3 Conjecture, our main intent being to understand better some of the core mechanisms and motivations behind the conjecture.

  Namely, the 1-2-3 Conjecture is related to an optimisation problem where one aims at making any graph $G$ locally irregular by multiplying its edges, resulting in a locally irregular multigraph $M$ with essentially the same structure. The conjecture, if true, would imply that such a multigraph $M$ with size $\left|E\right(M\left)\right|$ at most $3\left|E\right(G\left)\right|$ always exists. In 45, 75, we studied this very problem as a more general optimisation problem: Given a graph, what is the smallest (in terms of size) locally irregular multigraph that can be obtained through multiplying edges? In the language of labellings, this translates to: Given a graph, what is the smallest label sum assigned by a proper labelling, i.e., a labelling of its edges distinguishing adjacent vertices accordingly to their incident sums of labels? Regarding this question, we raised a few questions, which we have studied in general and for particular classes.

  One such side question is about proper labellings assigning only a few large labels. In particular, regarding the 1-2-3 Conjecture, an interesting question is about the importance of label 3, in the sense that, perhaps, in general labels 1 and 2 are almost enough to label any graph. Note that previous works on the topic have highlighted that graphs requiring all labels $1,2,3$ do exist, but such ones do not need lots of 3's. In 74, we have consequently studied proper 3-labellings assigning a few 3's only, our goal being to study formally whether, indeed, graphs in general need a few 3's only. Our feeling is that no graph should require more than a third of its edges labelled 3 in a proper 3-labelling. We have verified this feeling for a few graph classes. We also proved that, for a few classes of simple graphs, a constant number of 3's is not sufficient for a proper 3-labelling to be designed.

• In two works, namely 23, 26, we have studied two generalisations of distinguishing labelling problems to directed graphs (digraphs). In 23, we completely solved a peculiar variant of the 1-2-3 Conjecture in digraphs, where one is asked to design 3-labellings where, for every arc $\overrightarrow{uv}$, the sum of labels incoming to $u$ is different from the sum of labels outgoing from $v$. This is the concluding point of some recent attempts to generalise the 1-2-3 Conjecture to digraphs, as none of the variants that has been introduced earlier remains open to date. Surprisingly, the 1-2-3 Conjecture seems to be one of those problems that hardly generalise to digraphs.

  In 26, we have studied directed variants of a related problem, called the AVD Conjecture, which is, in essence, a kind of 1-2-3 Conjecture where the labels assigned to the edges must form a proper edge-colouring (i.e., no two adjacent edges must be assigned a same label). Inspired from the existing directed variants of the 1-2-3 Conjecture, we have introduced a few directed variants of the AVD Conjecture, leading to interesting conjectures that we have partly solved.

• In 77, 76, we have provided results on two other problems related to the 1-2-3 Conjecture. In 76, we have provided results that get very close to its multiplicative variant, where adjacent vertices, by a labelling, must be distinguished accordingly to their products of incident labels. We proved the Multiplicative 1-2-3 Conjecture for 4-chromatic graphs, which is usually a hard barrier to overcome for this type of problems. We also showed a way to design 3-labellings that are very close to what is desired. In 77, we gave results related to a close problem, which is about distinguishing adjacent vertices by coloured sums by a labelling coloured labels. This formalism was introduced earlier as a way to generalise several existing problems of the field.

In 31, we considered a variant in which we both orient and give weight to the edges of a graph. A weighted orientation of a graph $G$ is a pair $(D,w)$ where $D$ is an orientation of $G$ and $w$ is an arc-weighting of $D$, that is an application $A\left(D\right)\to \mathbb{N}\setminus \left\{0\right\}$. The in-weight of a vertex $v$ in a weighted orientation $(D,w)$, denoted by $S_{(D,w)}\left(v\right)$, is the sum of the weights of arcs with head $v$ in $D$. A semi-proper orientation is a weighted orientation such that two adjacent vertices have different in-weights. The semi-proper orientation number of a graph $G$, denoted by $\overrightarrow{{\chi }_s}\left(G\right)$, is ${min}_{(D,w)\in \Gamma }{max}_{v\in V\left(G\right)}{S}_{(D,w)}\left(v\right)$, where $\Gamma$ is the set of all semi-proper orientations of $G$. A semi-proper orientation $(D,w)$ of a graph $G$ is optimal if ${max}_{v\in V\left(G\right)}{S}_{(D,w)}\left(v\right)=\overrightarrow{{\chi }_s}\left(G\right)$. In this work, we show that every graph $G$ has an optimal semi-proper orientation $(D,w)$ such that the weight of each arc is 1 or 2. We then give some bounds on the semi-proper orientation number: we show $⌈\frac{\text{Mad}\left(G\right)}{2}⌉\le \overrightarrow{{\chi }_s}\left(G\right)\le ⌈\frac{\text{Mad}\left(G\right)}{2}⌉+\chi \left(G\right)-1$ and $⌈\frac{{\delta }^{*}\left(G\right)+1}{2}⌉\le \overrightarrow{{\chi }_s}\left(G\right)\le 2{\delta }^{*}\left(G\right)$ for all graph $G$, where $\text{Mad}\left(G\right)$ and ${\delta }^{*}\left(G\right)$ are the maximum average degree and the degeneracy of $G$, respectively. We then deduce that the maximum semi-proper orientation number of a tree is 2, of a cactus is 3, of an outerplanar graph is 4, and of a planar graph is 6. Finally, we consider the computational complexity of associated problems: we show that determining whether $\overrightarrow{{\chi }_s}\left(G\right)=\overrightarrow{\chi }\left(G\right)$ is NP-complete for planar graphs $G$ with $\overrightarrow{{\chi }_s}\left(G\right)=2$; we also show that deciding whether $\overrightarrow{{\chi }_s}\left(G\right)\le 2$ is NP-complete for planar bipartite graphs $G$.

7.3.2 Graph and digraph colourings

7.3.3 Graph and digraph decompositions

7.3.4 Substructures in graphs and digraphs

Overlaying a hypergraph with a graph with bounded maximum degree

Participants: Frédéric Havet, Dorian Mazauric, Thi Viet Ha Nguyen.

Let $G$ and $H$ be respectively a graph and a hypergraph defined on a same set of vertices, and let $F$ be a fixed graph. We say that $G$$F$-overlays a hyperedge $S$ of $H$ if $F$ is a spanning subgraph of the subgraph of $G$ induced by $S$, and that it $F$-overlays $H$ if it $F$-overlays every hyperedge of $H$. We study in 58, 59 the computational complexity of two problems. The first problem, ($\Delta \le k)-F$-Overlay, consists in deciding whether there is a graph with maximum degree at most $k$ that $F$ -overlays a given hypergraph $H$. It is a particular case of the second problem Max ($\Delta \le k)-F$-Overlay, which takes a hypergraph $H$ and an integer $s$ as input, and consists in deciding whether there is a graph with maximum degree at most $k$ that $F$-overlays at least $s$ hyperedges of $H$. We give a complete polynomial/NP-complete dichotomy for the Max ($\Delta \le k)-F$-Overlay problems depending on the pairs $(F,k),$ and establish the complexity of ($\Delta \le k)-F$-Overlay for many pairs $(F,k)$.

Network alignment and similarity reveal atlas-based topological differences in structural connectomes

Participants: David Coudert, Emilio Cruciani, Rachid Deriche, Samuel Deslauriers-Gauthier, Matteo Frigo, Emanuele Natale.

Improving Mapping for Sparse Direct Solvers - A Trade-Off Between Data Locality and Load Balancing

Participants: Ali Al Zoobi, Anne Benoit, Mathieu Faverge, Changjiang Gou, Loris Marchal, Grégoire Pichon, Pierre Ramet.

JTeC: A Large Collection of Java Test Classes for Test Code Analysis and Processing

Participants: Emilio Cruciani.

MillionRoads, 2019-2020

Participants: David Coudert, Frédéric Giroire, Luc Hogie, Nicolas Nisse, Michel Syska.

• Duration: October 2019 - April 2020
• Project title: HumanRoads
• Coordinator: Nicolas Nisse
• Other partners: SME MillionRoads; EP Zenith (Didier Parigot)
• Summary: HumanRoads uses a graph database, in the Neo4j environment, to store and structure its data. This database is already large and is regularly enriched with new data. However, to date, response times to queries are not satisfactory. This Project aims at identifying the limiting factors and to propose alternatives. More precisely, we will work on analyzing the data structure in the graph database to optimize queries, in the Neo4j environment, and on graph algorithms to speed up queries.

Orange, 2018-2021

Participants: Frédéric Giroire, Giuseppe Di Lena.

• Collaboration with Orange and EP DIANA on the topic of Network Function Virtualization. The activity includes the CIFRE PhD thesis of Giuseppe Di Lena that started his PhD on resilient NFV/SDN environments on April 2018 under the co-supervision of Frédéric Giroire and Thierry Turletti (DIANA).

9.1.1 Inria associate team not involved in an IIL

9.1.2 Inria international partners

9.1.3 Participation in other international programs

9.2.1 Visits of international scientists

• Jorgen Bang-Jensen, University Southern Denmark de Odense, from Feb 2020 until Jun 2020.
• Jonas Costa Ferreira Da Silva, Universidade Federal do Ceará de Fortaleza (Brazil), visting PhD student from Oct. 2019 until Nov 2020.
• Michał Lasoń, Polish Academy of Sciences, Warszawa, Poland. October 19-30, 2020.
• Fabricio Siqueira Benevides, Universidade Federal do Ceará de Fortaleza (Brazil), sabbatical until Jul 2020.
• Malgorzata Sulkowska, Université sciences et technologie de Wroclaw (Poland), from Feb 2020 until Mar 2020.

9.2.2 Visits to international teams

DGA/Inria Brainside, 2019-2023

Participants: Francesco D'Amore, Arthur Carvalho Walraven Da Cunha, Emilio Cruciani, Emanuele Natale.

• Program: DGA/Inria
• Project acronym: Brainside
• Project title: Algorithms for simplifying neural networks
• Duration: October 2019 - March 2023
• Coordinator: Emanuele Natale
• Other partners: Inria Paris, EP GANG
• Summary: The widespread use of neural networks on devices with computationally-low capabilities, demands for lightweight and energy-efficient networks. Despite such need, and despite the strategies employed to prevent overfitting by removing a substantial part of their edges, the question of how to reduce their size in terms of the number of neurons appears largely unexplored. The aim of the project is to investigate algorithmic procedures to reduce the size of neural networks, in order to improve the speed with which they can be evaluated and to shed light on how much information about the computational problem at hand can be encoded within neural networks of small size.

ANR-17-CE22-0016 MultiMod, 2018-2023

Participants: Ali Al Zoobi, David Coudert, Nicolas Nisse, Michel Syska.

• Program: ANR
• Project acronym: MultiMod
• Project title: Scalable routing in Multi Modal transportation networks
• Duration: January 2018 - December 2022
• Coordinator: David Coudert
• Other partners: Inria Paris, EP GANG; team CeP, I3S laboratory; SME Instant-System; SME Benomad
• Summary: The MultiMod project addresses key algorithmic challenges to enable the fast computation of personalized itineraries in large-scale multi-modal public transportation (PT) networks (bus, tram, metro, bicycle, etc.) combined with dynamic car-pooling. We will use real-time data to propose itineraries with close to real travel-time, and handle user-constraints to propose personalized itineraries. Our main challenge is to overcome the scalability of existing solutions in terms of query processing time and data-structures space requirements, while including unplanned transportation means (car-pooling), real-time data, and personalized user constraints. The combination of car-pooling and PT network will open-up areas with low PT coverage enable faster itineraries and so foster the adoption of car-pooling. We envision that the outcome of this project will dramatically enhanced the mobility and daily life of citizens in urban areas.
• Web: https://project.inria.fr/multimod/

ANR-19-CE48-0013-01 Digraphs, 2020-2023

Participants: Julien Bensmail, David Coudert, Frédéric Havet, Nicolas Nisse, Stéphane Pérennes.

• Program: ANR
• Project acronym: Digraphs
• Project title: Digraphs
• Duration: January 2020 - December 2023
• Coordinator: Frédéric Havet
• Other partners: LIRMM, Montpellier; LIP, Lyon.
• Summary: The objectives of the project is to make some advances on digraph theory in order to get a better understanding of important aspects of digraphs and to have more insight on the differences and the similarities between graphs and digraphs. Our methodology is two-fold. On the one hand, we will focus on the tools. Indeed we believe that many proof techniques have been too rarely used or adapted to digraphs and can be developed to obtain many more results.On the second hand, we will consider many results on graphs, find their (possibly many) formulations in terms of digraphs and see if and how they can be extended. Studying such extensions has been occasionally done, but the point here is to do it in a kind of systematic way. Moreover we shall push even further the study by considering classes of digraphs: if a result does not extend to the whole class of digraphs, for which classes does it extend ? if a result extends, can we get better results for some restricted classes of digraphs ?
• Web: https://project.inria.fr/anrdigraphs/

PICS DISCO

Participants: Frédéric Havet.

• Program: PICS
• Project acronym: DISCO
• Project title: DIsjoint Structures and Coverings in Oriented graphs
• Duration: January 2018 - December 2020.
• Coordinator: Stéphane Bessy (LIRMM)
• Other partners: CNRS LIRMM (Montpellier), Syddansk universitet (Odense, Danemark)

• Summary: Directed graphs (digraphs) are much less understood than undirected graphs. Many, seemingly very simple questions remain unsolved for digraphs while the analogous problem for undirected graphs is trivial. At the same time digraphs are a very important modelling tool for practical applications and so a better undestanding of their structure is important. The purpose of DISCO is to advance knowledge on fundamental problems on digraphs, including splitting a digraph into smaller pieces with given properties, problems regarding disjoint paths and trees, finding small certificates for given properties, such as strong spanning subdigraphs with few arcs. The later is important for speeding up certain algorithms.

  Through a concerted effort we expect to obtain important results which will lead to a better undestanding of fundamental questions about the structure of digraphs. The participants will meet regularly both in France and in Denmark to work on carefully selected problems.

9.3.1 GDR Actions

SNIF, 2018-2021

Participants: David Coudert, Frédéric Giroire, Nicolas Nisse, Stéphane Pérennes, Malgorzata Sulkowska, Thibaud Trolliet.

• Program: Innovation project of IDEX UCA${}^{\text{JEDI}}$.
• Project acronym: SNIF
• Project title: Scientific Networks and IDEX Funding
• Duration: September 2018 - August 2021
• Coordinator: Patrick Musso
• Other partners: GREDEG, SKEMA, I3S (SigNet) and Inria (Coati), all from UCA.
• Summary: Scientific collaboration networks play a crucial role in modern science. This simple idea underlies a variety of initiatives aiming to promote scientific collaborations between different research teams, universities, countries and disciplines. The recent French IDEX experience is one of them. By fostering competition between universities and granting few of them with a relatively small amount of additional resources (as compare to their global budget), public authorities aim to encourage them to deeply reshape the way academic activities are organized in order to significantly increase the quality of their research, educational programs and innovative activities. The development of new collaboration networks is one of the factors at the heart of this global reorganization. Promoting new international and/or interdisciplinary collaborations is supposed to increase researchers’ productivity and industry partnerships. This project aims to question the validity of this line of thought.

10.1.1 Scientific events: organisation

10.1.2 Scientific events: selection

10.1.3 Journal

10.1.4 Invited talks

• Julien Bensmail
  • On the ”quest” towards a directed variant of the 1-2-3 Conjecture. Seminar of the ”Graphes et Optimisation” team, LaBRI, Bordeaux, February 2020
• David Coudert
  • On the Flinders Hamiltonian Cycle Problem Challenge. Keynote speaker at “Global Virtual SageDays 110”, online, October 29-30, 2020
• Emilio Cruciani
  • Collective Intelligence: A Personal Point of View. Cassini Junior Workshop 2020, Rome, Italy, June 12, 2020
• Francesco d'Amore
  • On the Search Efficiency of Parallel Lévy Walks in ${\mathbb{Z}}^2$, IRIF online seminar, Paris (FR), June 9, 2020
  • On some Opinion Dynamics in Multi-Agent Systems, poster at SophI.A Summit, Sophia Antipolis (FR), November 16-21, 2020
• Frédéric Havet
  • 8 ECM (8th European Congress of Mathematics) Mini-symposium Algorithmic Graph Theory, Portoroz, Slovenia, 5-11 July 2020 (postponed due to COVID)
  • Workshop on Spanning Subgraphs, Montreal, Canada, 20-24 July 2020 (postponed due to COVID)
• Nicolas Nisse
  • Localization games in graphs. Graph Searching Online Seminar (https://sites.google.com/view/graphsearchingonline2020/home), online, July 10th, 2020

10.1.5 Leadership within the scientific community

• David Coudert
  • Co-chair of Pôle RESCOM of GDR RSD of CNRS since 2017 and member of the steering committee since 2005
• Frédéric Giroire
  • Member of the steering committee of GT Energy of the GDR RSD of CNRS
• Frédéric Havet
  • Member of the steering committee of GT Graphes of the GDR IM of CNRS

10.1.6 Scientific expertise

• Jean-Claude Bermond
  • Expert for DRTT-MESR Crédit impôt recherche (CIR et agréments)
• Christelle Caillouet
  • Expert for ANR
• David Coudert
  • Expert for ANR
• Frédéric Havet
  • Expert for ANR and FNRS (Belgium)
• Nicolas Nisse
  • Expert for European Science Foundation
  • Natural Sciences and Engineering Research Council of Canada
• Michel Syska
  • Expert for DRTT-MESR Crédit impôt recherche (CIR et agréments)

10.1.7 Research administration

• Jean-Claude Bermond
  • Responsible for the cooperation between Inria and Greece
• Christelle Caillouet
  • Elected member of Conseil de Laboratoire I3S since 2017
  • Nominated member at the Commission Permanente de Ressources Humaines (CPRH) of Côte d'Azur University until August 2020
  • Member of selection committee MCF, INSA de Lyon, 2020
• Alexandre Caminada
  • Member of the executive board of the Sophia Interdisciplinary Institute of Artificial Intelligence started in 2019
  • Manager of the research committee for the Polytech network national academic Foundation
• David Coudert
  • Nominated member for Inria at the board of doctoral school STIC, since September 2017
  • Head (since December 2019) and member (since 2009) of the “Comité de Suivi Doctoral” of Inria
  • Nominated member for Inria at the steering committee of Academy 1 RISE (Networks, Information, Digital Society) of UCA${}^{\text{JEDI}}$ since February 2018
  • Nominated member for Inria at the steering committee of EUR DS4H since February 2018
  • Nominated member for Inria at the steering committee of Labex UCN@Sophia since February 2018
  • Member of the steering committee of seminar Forum Numerica of Academy 1 RISE of UCA${}^{\text{JEDI}}$ since 2018
  • Member of the “Bureau du comité des équipe-projets” of Inria research center Sophia Antipolis - Méditerranée since 2018
• Frédéric Giroire
  • In charge of the internships of stream UbiNet of Master 2 IFI, Université Côte d'Azur
• Frédéric Havet
  • Head of COMRED team of I3S laboratory
• Nicolas Nisse
  • Elected member for the "Comité de centre", Inria Sophia Antipolis - Méditerranée, since 2017
  • Nominated member for Inria at the CoSP of EUR DS4H until October 2020
  • Elected member for Inria at the CoSP of EUR DS4H since October 2020
  • Member of the CoSP Terra Numerica, since 2020
• Michel Syska
  • Elected member at the Commission Permanente de Ressources Humaines (CPRH) of Université Côte d'Azur until August 2020
  • Nominated deputy director of the computing science department of Université Côte d'Azur (Département Disciplinaire Informatique) since March 2020

10.2.1 Teaching Responsibilities

• Julien Bensmail
  • Since September 2019: Head of the Licence Professionnelle “Managements des Processus Logistiques” (MPL) of Univ Côte d'Azur
• Christelle Caillouet
  • Elected member of Conseil de département IUT Informatique since September 2017
• Alexandre Caminada
  • Head of the graduate school of engineering Polytech Nice Sophia (1500 master grade students, 100 faculty members, 50 staffs)
  • Member of the executive board of the Polytech network, national network of public graduate school of engineering
  • Member of the executive board of Université Côte d'Azur
• Joanna Moulierac
  • “Directrice d'études” for the 1st-year students of “Département Informatique” of IUT Nice Côte d'Azur (since September 2017)
  • Head of the “Conseil de Département Informatique” of IUT Nice Côte d'Azur (since September 2017)

10.2.2 Teaching

Members of Coati have for more that 1320 hours (ETD) this year:

• DUT: Julien Bensmail, Recherche opérationnelle, 90h ETD, Level L2, Département QLIO of IUT, Université Côte d'Azur, France
• DUT: Julien Bensmail, Systèmes de gestion de bases de données, 70h ETD, Level L2, Département QLIO of IUT, Université Côte d'Azur, France
• DUT: Christelle Caillouet, Object Oriented Programming, 150h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Christelle Caillouet, Introduction to Networks, 21h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Christelle Caillouet, Algorithmics, 21h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Foivos Fioravantes, Bases de la conception orienté objet, 64h ETD, Level L1, Département Informatique of IUT, Université Côte d'Azur, France
• DUT: Adrien Gausseran, Introduction à l'algorithmique et à la programmation, 10h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Adrien Gausseran, Architecture des réseaux, 38h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Adrien Gausseran, Compléments d'algorithmique, 20h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Luc Hogie, Distributed programming, 28h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Hicham Lesfari, Réseaux d'opérateurs et réseaux d'accès, 48h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Joanna Moulierac, Introduction à l'algorithmique, 30h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Joanna Moulierac, Introduction aux Réseaux, 56h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Joanna Moulierac, Réseaux avancés, 60h ETD, Level L2, IUT, Université Côte d'Azur, France;
• IUT: Thi Viet Ha Nguyen, Algorithmique, 24h ETD, Level L1, Département QLIO of IUT, Université Côte d'Azur, France
• IUT: Thibaud Trolliet, Introduction aux bases de données, 64h ETD, Level L1, IUT, Université Côte d'Azur, France
• DUT: Michel Syska, Tutored Project: Introduction, Level L1, IUT, Université Côte d'Azur, France
• DUT: Michel Syska, Data Structures and Algorithms, 44h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Michel Syska, Introduction to Artificial Intelligence, 40h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Michel Syska, Algorithmics, 52h ETD, Level L2, IUT, Université Côte d'Azur, France
• DUT: Michel Syska, Distributed programming, 52h ETD, Level L2, IUT, Université Côte d'Azur, France
• MPSI: Nicolas Nisse, Option informatique, MPSI, 24h ETD, classe préparatoire MPSI, Lycée International de Valbonne, France
• LP: Julien Bensmail, Sécurité des échanges de données inter-entreprises, 30h ETD, Level L3, LP MPL of IUT, Université Côte d'Azur, France
• LP: Michel Syska, Web Security, 16h ETD, Level L3, IUT, Université Côte d'Azur, France
• Licence: Ali Al Zoobi, Programmation et structures en C, 24h ETD, Level L2, Faculté des sciences, Université Côte D'Azur, France
• Licence: Michel Syska, Networks, 33h ETD, Level L3, MIAGE - Université Côte d’Azur, France
• Master: Nicolas Nisse, Graphs, 36h ETD, M1 Informatique et Interaction, Université Côte d'Azur, France
• Master: Alexandre Caminada, Radio location systems, 20h ETD, Master 2 (in english), Polytech Nice Sophia, France
• Master: Alexandre Caminada, Artificial intelligence, 40h ETD, Master 2 (in english), Polytech Nice Sophia, France
• Master: Alexandre Caminada, Master grade student's internship supervision and assesment, 10h ETD, Master 2, Polytech Nice Sophia, France
• Master: Christelle Caillouet, Data Mining for Networks, 9h ETD, M2 Ubinet, Université Côte d'Azur, France
• Master: David Coudert, Algorithms for Telecoms, 36h ETD, M2 Ubinet, Université Nice Sophia Antipolis, France
• Master: Frédéric Giroire, Graph Algorithms, 18h ETD, Master 2, International Track Ubinet, Université Côte d'Azur, France
• Master: Frédéric Giroire, Machine learning for networks, 24h ETD, Master 2, International Track Ubinet, Université Côte d'Azur, France
• Master: Nicolas Nisse, Algorithms for Telecoms, 15h ETD, M2 Ubinet, Université Côte d'Azur, France
• Master: Nicolas Nisse, Advanced Graphs, 36h ETD, M2 Informatique et Interaction, Université Côte d'Azur, France
• Formation professeurs lycée : Nicolas Nisse, Algorithms, 15h ETD, DUI Algorithmique, Université Côte d'Azur, France

10.2.3 Supervision

10.2.4 Juries

• Christelle Caillouet
  • Member of PhD committee of Oana Hotescu, INP Toulouse, May 29, 2020
  • Member of PhD committee of Moisés Nunez, INP Grenoble and CEA, June 17, 2020
• David Coudert
  • President of the PhD committee of Imane Oussakel, Université Paul Sabatier, Toulouse, France, July 17, 2020
• Frédéric Giroire
  • Referee and member of PhD committe of Cédric Morin, Ecole nationale supérieure Mines- Telecom Atlantique Bretagne Pays de la Loire, IMT Atlantique , November 18, 2020
  • Referee and member of PhD committee of Omar Houidi, Institut Polytechnique de Paris, June 25, 2020
• Frédéric Havet
  • President of the PhD prize committee prix de thèse Graphes “Charles Delorme”http://gtgraphes.labri.fr/pmwiki/pmwiki.php/PrixTheseDelorme/PrixTheseDelorme
• Emanuele Natale
  • Member of PhD committee of Brieuc Guinard, IRIF (Paris), November 4, 2020

10.2.5 Internal or external Inria responsibilities

• Frédéric Havet is one of the heads of Terra Numerica. This project which brings together several popularization groups in order to create a museum of digital sciences. It creates popularization devices that are used in several places (in particular, Maison de l'Intelligence Artificielle), on several events (Fête de la Science, ...), and in schools. See https://terra-numerica.org/
• Frédéric Havet is vice-president and member of the scientific committee of the association Institut Esope 21 (https://esope21.fr/). In particular, he is in charge of the organization of the “Carrefour des Sciences” at Vinon-sur-Verdon secondary school
• Nicolas Nisse is head of Galejade projet (Graphes et ALgorithmes : Ensemble de Jeux À Destination des Ecoliers... (mais pas que)) https://galejade.inria.fr/

10.3.1 Education

• Ali al Zoobi, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Joanna Moulierac, Emanuele Natale, Nicolas Nisse, and Michel Syska are involved in Terra Numerica (see above). They participate in the creation of popularization devices.
• Frédéric Havet, Joanna Moulierac and Nicolas Nisse (responsable) : Participation to Galejade projet (Graphes et ALgorithmes : Ensemble de Jeux À Destination des Ecoliers... (mais pas que)), https://galejade.inria.fr/
  • Design of pedagogical resources introducing graphs and algorithms to primary school students

10.3.2 Interventions

• Frédéric Havet and Nicolas Nisse
  • Animation of the Mathematical Fair at Guynemer School, Hyères, France, January 27, 2020
• Frédéric Havet
  • Conferences in 3 schools for 15 classes. (Lycée Raynouard, Brignoles, January 13 and March 9; Collège Rostand, Draguignan, January 20; Collège Daudet, Nice, March 10)
  • Organisation and animation of discovery internships of 12 pupils, February 10-14, 2020
  • 12 conferences at “Carrefour des Sciences”, Collège Yves Montand, Vinon-sur-Verdon, during Fête de la Science, October 5-9 2020
• Nicolas Nisse
  • Intervention Collège du Rouret, March 12, 2020
  • Intervention Lycée Jules Ferry, Cannes. September 25, 2020
• Michel Syska
  • Member of the organization of the code competition "Game on Web" (33 teams of students), September, 2020
  • Organization and supervision of the local site IUT - DS4H for the national code competition "La nuit de l'info", December 3-4, 2020

International journals

• 16 article RonR. Aharoni, EliE. Berger, MariaM. Chudnovsky, FrédéricF. Havet and ZilinZ. Jiang. Cooperative colorings of trees and of bipartite graphs The Electronic Journal of Combinatorics February 2020
  HAL back to text
• 17 articleLucaL. Becchetti, AndreaA. Clementi and EmanueleE. Natale. Consensus Dynamics: An OverviewACM SIGACT News511March 2020, 57
  HALDOIback to text
• 18 articleLucaL. Becchetti, AndreaA. Clementi, EmanueleE. Natale, FrancescoF. Pasquale and LucaL. Trevisan. Find Your Place: Simple Distributed Algorithms for Community DetectionSIAM Journal on Computing494January 2020, 821-864
  HALDOIback to text
• 19 articleLucaL. Becchetti, EmilioE. Cruciani, FrancescoF. Pasquale and SaraS. Rizzo. Step-by-step community detection in volume-regular graphsTheoretical Computer Science847December 2020, 49-67
  HALDOIback to text
• 20 article JulienJ. Bensmail, FrançoisF. Dross, HervéH. Hocquard and EricE. Sopena. From light edges to strong edge-colouring of 1-planar graphs Discrete Mathematics and Theoretical Computer Science vol. 22 no. 1 2 January 2020
  HAL back to text
• 21 articleJulienJ. Bensmail, FrançoisF. Dross and NicolasN. Nisse. Decomposing degenerate graphs into locally irregular subgraphsGraphs and Combinatorics3662020, 1869–1889
  HALback to text
• 22 article JulienJ. Bensmail and BinlongB. Li. More Aspects of Arbitrarily Partitionable Graphs Discussiones Mathematicae Graph Theory 2020
  HAL back to text
• 23 articleJulienJ. Bensmail and KasperK. Lyngsie. 1-2-3 Conjecture in Digraphs: More Results and DirectionsDiscrete Applied Mathematics2842020, 124-137
  HALback to textback to text
• 24 articleJulienJ. Bensmail, DorianD. Mazauric, FionnF. Mc Inerney, NicolasN. Nisse and StéphaneS. Pérennes. Sequential Metric DimensionAlgorithmica82102020, 2867-2901
  HALback to text
• 25 article JulienJ. Bensmail, FionnF. Mc Inerney and NicolasN. Nisse. Metric Dimension: from Graphs to Oriented Graphs Discrete Applied Mathematics 2020
  HAL back to text
• 26 article JulienJ. Bensmail and FionnF. Mc Inerney. On Generalisations of the AVD Conjecture to Digraphs Graphs and Combinatorics 2020
  HAL back to text back to text
• 27 articleJulienJ. Bensmail, SoumenS. Nandi, MithunM. Roy and SagnikS. Sen. Classification of edge-critical underlying absolute planar cliques for signed graphsThe Australasian Journal of Combinatorics771June 2020, 117-135
  HALback to text
• 28 articleJean-ClaudeJ.-C. Bermond, TakakoT. Kodate and JosephJ. Yu. Gossiping with Interference Constraints in Radio Chain NetworksJournal of Information Processing282020, 889-902
  HALDOIback to text
• 29 articleJean-ClaudeJ.-C. Bermond, DorianD. Mazauric, VishalV. Misra and PhilippeP. Nain. Distributed Link Scheduling in Wireless NetworksDiscrete Mathematics, Algorithms and Applications1252020, 1-38
  HALDOIback to text
• 30 articleNathannN. Cohen, FionnF. Mc Inerney, NicolasN. Nisse and StéphaneS. Pérennes. Study of a Combinatorial Game in Graphs Through Linear ProgrammingAlgorithmica8222020, 212-244
  HALDOIback to text
• 31 article AliA. Dehghan and FrédéricF. Havet. On the semi-proper orientations of graphs Discrete Applied Mathematics March 2020
  HAL DOI back to text
• 32 articleGuillaumeG. Ducoffe, SylvainS. Legay and NicolasN. Nisse. On the Complexity of Computing TreebreadthAlgorithmica8262020, 1574-1600
  HALDOIback to text
• 33 article AlizéeA. Gagnon, AlexanderA. Hassler, JerryJ. Huang, AaronA. Krim-Yee, FionnF. Mc Inerney, Andrés MejíaA. Zacarías, BenB. Seamone and VirgélotV. Virgile. A method for eternally dominating strong grids Discrete Mathematics and Theoretical Computer Science vol. 22 1 March 2020
  HAL back to text
• 34 articleFrédéricF. Havet, BruceB. Reed, MayaM. Stein and David RD. Wood. A variant of the Erdős‐Sós conjectureJournal of Graph Theory941May 2020, 131-158
  HALDOIback to text
• 35 article FionnF. Mc Inerney, NicolasN. Nisse and StéphaneS. Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between Algorithmica 2020
  HAL back to text
• 36 articleViet-HaV.-H. Nguyen, KévinK. Perrot and MathieuM. Vallet. NP-completeness of the game KingdominoTheoretical Computer Science822June 2020, 23-35
  HALDOIback to text
• 37 articleDimitriosD. Zorbas, ChristelleC. Caillouet, KhaledK. Abdelfadeel Hassan and DirkD. Pesch. Optimal Data Collection Time in LoRa Networks—A Time-Slotted ApproachSensors214February 2021, 1193
  HALDOI

International peer-reviewed conferences

• 38 inproceedingsMohammadM. Abouei Mehrizi, FedericoF. Corò, EmilioE. Cruciani and GianlorenzoG. D'Angelo. Election Control Through Social Influence with Unknown PreferencesCOCOON 2020 - 26th International Conference on Computing and CombinatoricsAtlanta / Online, United StatesAugust 2020, 397-410
  HALDOIback to text
• 39 inproceedingsAliA. Al Zoobi, DavidD. Coudert and NicolasN. Nisse. Compromis espace-temps pour le problème de k plus courts chemins simplesALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des TélécommunicationsLyon, Francehttps://cores-algotel-2020.imag.frSeptember 2020, 4
  HALback to text
• 40 inproceedingsAliA. Al Zoobi, DavidD. Coudert and NicolasN. Nisse. Space and Time Trade-Off for the k Shortest Simple Paths ProblemSEA 2020 - 18th International Symposium on Experimental Algorithms160Leibniz International Proceedings in Informatics (LIPIcs)18Catania, Italyhttp://www.sea2020.dmi.unict.itJune 2020, 13
  HALDOIback to text
• 41 inproceedingsArisA. Anagnostopoulos, LucaL. Becchetti, EmilioE. Cruciani, FrancescoF. Pasquale and SaraS. Rizzo. Biased Opinion Dynamics: When the Devil is in the DetailsIJCAI 2020 - 29th International Joint Conference on Artificial IntelligenceYokohama, JapanAugust 2020, 53-59
  HALDOIback to text
• 42 inproceedings AlanA. Arroyo, JulienJ. Bensmail and R. BruceR. Richter. Extending Drawings of Graphs to Arrangements of Pseudolines SoCG 2020 - 36th International Symposium on Computational Geometry Zürich, Switzerland June 2020
  HAL back to text
• 43 inproceedings JørgenJ. Bang-Jensen, Jonas CostaJ. Ferreira Da Silva and FrédéricF. Havet. Inversion number of an oriented graph and related parameters ALGOS 2020 - 1st International Conference on Algebras, Graphs and Ordered Sets Nancy / Virtual, France August 2020
  HAL back to text
• 44 inproceedings LucaL. Becchetti, AndreaA. Clementi, EmanueleE. Natale, FrancescoF. Pasquale and LucaL. Trevisan. Finding a Bounded-Degree Expander Inside a Dense One SODA 2020 - ACM SIAM Symposium on Discrete Algorithms Proceedings of the thirty-first Annual ACM-SIAM Symposium on Discrete Algorithms Salt Lake City, United States January 2020
  HAL DOI back to text back to text back to text back to text
• 45 inproceedings JulienJ. Bensmail, FoivosF. Fioravantes and NicolasN. Nisse. On Proper Labellings of Graphs with Minimum Label Sum Lecture Notes in Computer Science 12126 IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms Bordeaux, France June 2020
  HAL back to text back to text
• 46 inproceedingsYannY. Busnel, ChristelleC. Caillouet and DavidD. Coudert. VESPA, ou l'art de coordonner une flotte de drone sans leaderALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des TélécommunicationsLyon, FranceSeptember 2020, 1-4
  HALback to text
• 47 inproceedings ChristelleC. Caillouet, MartinM. Heusse and FranckF. Rousseau. Bringing Fairness in LoRaWAN through SF Allocation Optimization ISCC 2020 - 25th IEEE Symposium on Computers and Communications Rennes, France https://conferences.imt-atlantique.fr/iscc2020/ July 2020
  HAL DOI back to text
• 48 inproceedings ChristelleC. Caillouet, MartinM. Heusse and FranckF. Rousseau. Optimisation de la capacité des réseaux LoRa CORES 2020 – 5ème Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication Lyon, France September 2020
  HAL back to text
• 49 inproceedingsAndreaA. Clementi, LucianoL. Gualà, EmanueleE. Natale, FrancescoF. Pasquale, GiacomoG. Scornavacca and LucaL. Trevisan. Consensus vs Broadcast, with and without NoiseITCS 2020 - 11th Annual Innovations in Theoretical Computer Science11th Innovations in Theoretical Computer Science ConferenceSeattle, United StatesJanuary 2020, 42 - 43
  HALDOIback to text
• 50 inproceedings AndreaA. Clementi, EmanueleE. Natale and IsabellaI. Ziccardi. Parallel Load Balancing on Constrained Client-Server Topologies SPAA 2020 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings Philadelphia, United States July 2020
  HAL back to text
• 51 inproceedingsFedericoF. Corò, RobertoR. Verdecchia, EmilioE. Cruciani, BrenoB. Miranda and AntoniaA. Bertolino. JTeC: A Large Collection of Java Test Classes for Test Code Analysis and ProcessingMSR 2020 - 17th International Conference on Mining Software RepositoriesSeoul / Virtual, South KoreaJune 2020, 578-582
  HALDOIback to text
• 52 inproceedings EmilioE. Cruciani, Hlafo AlfieH. Mimun, MatteoM. Quattropani and SaraS. Rizzo. Brief Announcement: Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model' DISC 2020 - 34th International Symposium on Distributed Computing Freibourg / Virtual, Germany October 2020
  HAL back to text
• 53 inproceedings IgorI. Dias Da Silva and ChristelleC. Caillouet. Optimizing the trajectory of drones: trade-off between distance and energy IAUV 2020 - 2nd International Workshop on Internet of Autonomous Unmanned Vehicles Cuomo, Italy June 2020
  HAL DOI back to text
• 54 inproceedings GuillaumeG. Ducoffe, FrédéricF. Giroire, StéphaneS. Pérennes and ThibaudT. Trolliet. Revisiter l'Attachement Préférentiel, et ses applications aux Réseaux Sociaux ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL back to text
• 55 inproceedingsAdrienA. Gausseran, FrédéricF. Giroire, BrigitteB. Jaumard and JoannaJ. Moulierac. Be Scalable and Rescue My Slices During ReconfigurationICC 2020 - 2020 IEEE International Conference on Communications (ICC)ICC 2020 - IEEE International Conference on CommunicationsDublin, IrelandJune 2020, 1-6
  HALDOIback to text
• 56 inproceedings FrédéricF. Giroire, StéphaneS. Pérennes and ThibaudT. Trolliet. A Random Growth Model with any Real or Theoretical Degree Distribution COMPLEX NETWORKS 2020 - 9th International Conference on Complex Networks and their Applications Madrid / Virtual, Spain December 2020
  HAL back to text
• 57 inproceedingsChangjiangC. Gou, AliA. Al Zoobi, AnneA. Benoit, MathieuM. Faverge, LorisL. Marchal, GrégoireG. Pichon and PierreP. Ramet. Improving mapping for sparse direct solvers: A trade-off between data locality and load balancingEuroPar 2020 - 26th International European Conference on Parallel and Distributed ComputingWarsaw / Virtual, PolandAugust 2020, 1-16
  HALback to text
• 58 inproceedings FrédéricF. Havet, DorianD. Mazauric, Viet-HaV.-H. Nguyen and RémiR. Watrigant. Overlaying a hypergraph with a graph with bounded maximum degree CALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics Hyderabad, India February 2020
  HAL back to text
• 59 inproceedings FrédéricF. Havet, DorianD. Mazauric, Viet-HaV.-H. Nguyen and RémiR. Watrigant. Overlaying a hypergraph with a graph with bounded maximum degree ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL back to text
• 60 inproceedingsMartinM. Heusse, TakwaT. Attia, ChristelleC. Caillouet, FranckF. Rousseau and AndrzejA. Duda. Capacity of a LoRaWAN CellProceedings of the 23rd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2020)MSWiM '20alicante, Spain2020, 131–140
  HALDOIback to text
• 61 inproceedings Giuseppe DiG. Lena, AndreaA. Tomassilli, FrédéricF. Giroire, DamienD. Saucez, ThierryT. Turletti and ChidungC. Lac. A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation IEEE International Conference on Communications (ICC) Montréal, Canada June 2021
  HAL back to text
• 62 inproceedings CedricC. Morin, GéraldineG. Texier, ChristelleC. Caillouet, GillesG. Desmangles and Cao-ThanhC.-T. Phan. Algorithmes de placement de VNFs dans des contextes mono-et multi-propriétaire ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL back to text
• 63 inproceedings CedricC. Morin, GéraldineG. Texier, ChristelleC. Caillouet, GillesG. Desmangles and Cao-ThanhC.-T. Phan. Optimisation du coût de déploiement de services réseau virtualisés dans le cloud CORES 2020 – 5ème Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication Lyon, France September 2020
  HAL back to text
• 64 inproceedings CedricC. Morin, GéraldineG. Texier, ChristelleC. Caillouet, GillesG. Desmangles and Cao-ThanhC.-T. Phan. Optimization of Network Services Embedding Costs over Public and Private Clouds ICOIN 2020 Barcelone, Spain January 2020
  HAL back to text
• 65 inproceedings ThibaudT. Trolliet, NathannN. Cohen, FrédéricF. Giroire, LucL. Hogie and StéphaneS. Pérennes. Coefficient de Clustering d'intérêt : une nouvelle métrique pour les graphes dirigés comme Twitter ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications Lyon, France September 2020
  HAL back to text
• 66 inproceedings ThibaudT. Trolliet, NathannN. Cohen, FrédéricF. Giroire, LucL. Hogie and StéphaneS. Pérennes. Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter COMPLEX NETWORKS 2020 - 9th International Conference on Complex Networks and their Applications Madrid / Virtual, Spain December 2020
  HAL back to text
• 67 inproceedingsFrancescoF. d'Amore, AndreaA. Clementi and EmanueleE. Natale. Phase Transition of a Non-Linear Opinion Dynamics with Noisy InteractionsSIROCCO 2020 - 27th International Colloquium on Structural Information and Communication Complexity12156SIROCCO 2020. Lecture Notes in Computer Science, vol 12156. SpringerPaderborn, GermanyINRIA Sophia Antipolis - I3S; Università di Roma "Tor Vergata"February 2020, 255--272
  HALDOIback to text

Conferences without proceedings

Edition (books, proceedings, special issue of a journal)

• 68 bookChristelleC. Caillouet and NathalieN. Mitton. Optimization and Communication in UAV NetworksSensors2018September 2020, 5036
  HALDOI

Doctoral dissertations and habilitation theses

• 69 thesis JulienJ. Bensmail. A contribution to distinguishing labellings of graphs Université côte d'azur December 2020
  HAL back to text

Reports & preprints

• 70 report AliA. Al Zoobi, DavidD. Coudert and NicolasN. Nisse. Space and time trade-off for the k shortest simple paths problem Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France February 2020
  HAL back to text
• 71 report JulioJ. Araujo, JulienJ. Bensmail, VictorV. Campos, FrédéricF. Havet, AnaA. Karolinna Maia De Oliveira, NicolasN. Nisse and AnaA. Silva. On finding the best and worst orientations for the metric dimension Inria 2020
  HAL back to text
• 72 report JulienJ. Bensmail, SandipS. Das, SoumenS. Nandi, ThéoT. Pierron, SagnikS. Sen and EricE. Sopena. On the signed chromatic number of some classes of graphs Université Côte D'Azur; Université de Bordeaux; Université Lyon 1 2020
  HAL back to text
• 73 report JulienJ. Bensmail, FoivosF. Fioravantes, FionnF. Mc Inerney and NicolasN. Nisse. The Largest Connected Subgraph Game Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany 2021
  HAL
• 74 report JulienJ. Bensmail, FoivosF. Fioravantes and FionnF. Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture Université côte d'azur; Aix-Marseille Université 2020
  HAL back to text back to text
• 75 report JulienJ. Bensmail, FoivosF. Fioravantes and NicolasN. Nisse. On Proper Labellings of Graphs with Minimum Label Sum Inria - Sophia antipolis 2020
  HAL back to text back to text
• 76 report JulienJ. Bensmail, HervéH. Hocquard, DimitriD. Lajou and EricE. Sopena. Further Evidence Towards the Multiplicative 1-2-3 Conjecture Université côte d'azur; Université de bordeaux April 2020
  HAL back to text back to text back to text
• 77 report JulienJ. Bensmail. On a graph labelling conjecture involving coloured labels Université côte d'azur April 2020
  HAL back to text back to text
• 78 report CláudioC. Carvalho, JonasJ. Costa, Cláudia LinharesC. Sales, RaulR. Lopes, Ana KarolinnaA. Maia De Oliveira and NicolasN. Nisse. On the characterization of networks with multiple arc-disjoint branching flows UFC; INRIA; CNRS; Université Côte d’Azur; I3S; LIRMM; Université de Montpellier November 2020
  HAL back to text
• 79 report AndreaA. Clementi, FrancescoF. d'Amore, GeorgeG. Giakkoupis and EmanueleE. Natale. Search via Parallel Lévy Walks on ${}^2$' Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France; Università degli Studi di Roma "Tor Vergata"; Univ Rennes, Inria, CNRS, IRISA, France April 2020
  HAL back to text
• 80 reportGiuseppeG. Di Lena, AndreaA. Tomassilli, FrédéricF. Giroire, DamienD. Saucez, ThierryT. Turletti and ChidungC. Lac. Placement Module for Distributed SDN/NFV Network EmulationInria Sophia Antipolis - Méditerranée; I3S, Université Côte d'Azur; Orange Labs R&D [Lannion] (France Télécom)February 2021, 32
  HAL
• 81 report ThomasT. Dissaux, GuillaumeG. Ducoffe, NicolasN. Nisse and SimonS. Nivelle. Treelength of Series-parallel graphs Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France 2020
  HAL back to text
• 82 misc MatteoM. Frigo, EmilioE. Cruciani, DavidD. Coudert, RachidR. Deriche, EmanueleE. Natale and SamuelS. Deslauriers-Gauthier. Network alignment and similarity reveal atlas-based topological differences in structural connectomes December 2020
  HAL back to text
• 83 reportChangjiangC. Gou, AliA. Al Zoobi, AnneA. Benoit, MathieuM. Faverge, LorisL. Marchal, GrégoireG. Pichon and PierreP. Ramet. Improving mapping for sparse direct solvers: A trade-off between data locality and load balancingInria Rhône-AlpesFebruary 2020, 21
  HALback to text