- A1.2.1. Dynamic reconfiguration
- A1.2.3. Routing
- A1.2.5. Internet of things
- A1.2.9. Social Networks
- A1.6. Green Computing
- A3.5.1. Analysis of large graphs
- A7.1. Algorithms
- A7.1.1. Distributed algorithms
- A7.1.3. Graph algorithms
- A8.1. Discrete mathematics, combinatorics
- A8.2. Optimization
- A8.2.1. Operations research
- A8.7. Graph theory
- A8.8. Network science
- A9.7. AI algorithmics
- A9.9. Distributed AI, Multi-agent
- B1.1.1. Structural biology
- B6.3.3. Network Management
- B6.3.4. Social Networks
- B7.2. Smart travel
- B9.5.1. Computer science
1 Team members, visitors, external collaborators
- David Coudert [Team leader, Inria, Senior Researcher, HDR]
- Ramon Aparicio Pardo [Univ Côte d'Azur, Researcher, HDR]
- Jean-Claude Bermond [CNRS, Emeritus, HDR]
- Christelle Caillouet [Univ Côte d'Azur, Researcher]
- Frédéric Giroire [CNRS, Senior Researcher, HDR]
- Frédéric Havet [CNRS, Senior Researcher, HDR]
- Emanuele Natale [CNRS, Researcher]
- Nicolas Nisse [Inria, Researcher, HDR]
- Stéphane Pérennes [CNRS, Senior Researcher, HDR]
- Julien Bensmail [Univ Côte d'Azur, Associate Professor, HDR]
- Alexandre Caminada [Univ Côte d'Azur, Professor]
- Joanna Moulierac [Univ Côte d'Azur, Associate Professor]
- Michel Syska [Univ Côte d'Azur, Associate Professor]
- Chuan Xu [Univ Côte d'Azur, Associate Professor, from Sep 2021]
- François Pirot [Inria, until Aug 2021]
- Malgorzata Sulkowska [Univ Côte d'Azur]
- Ali Al Zoobi [Inria]
- Arthur Carvalho Walraven Da Cunha [Inria]
- Giuseppe Di Lena [Orange Labs, CIFRE, until Mar 2021]
- Igor Dias Da Silva [Inria]
- Thomas Dissaux [Univ Côte d'Azur]
- Foivos Fioravantes [Univ Côte d'Azur]
- Adrien Gausseran [Univ Côte d'Azur, until Oct 2021]
- Hicham Lesfari [Univ Côte d'Azur]
- Zhejiayu Ma [Easybroadcast, CIFRE]
- Thi Viet Ha Nguyen [Inria]
- Lucas Picasarri Arrieta [Univ Côte d'Azur, from Sep 2021]
- Thibaud Trolliet [Univ Côte d'Azur, until Aug 2021]
- Francesco d'Amore [Inria]
- Luc Hogie [CNRS, Engineer]
Interns and Apprentices
- Hugo Boulier [Inria, from May 2021 until Jul 2021]
- Fedi Ghalloussi [Inria, from May 2021 until Jul 2021]
- Gregory Hoareau [CNRS, from Mar 2021 until Sep 2021]
- Imane Houbbane [Millionroads, from Mar 2021 until Aug 2021]
- Cyprien Michel-Deletie [École Normale Supérieure de Lyon, from May 2021 until Jul 2021]
- Kostiantyn Ohulchanskyi [Univ Côte d'Azur, from Mar 2021 until Aug 2021]
- Nacim Oijid [École Normale Supérieure de Lyon, from Apr 2021 until Jun 2021]
- Pierre Pebereau [Inria, from Jul 2021 until Aug 2021]
- Marcello Politi [Inria, from Mar 2021 until Jun 2021]
- Juliette Schabanel [École Normale Supérieure de Paris, from Jun 2021 until Jul 2021]
- Sofiia Shelest [Univ Côte d'Azur, from Mar 2021 until Aug 2021]
- Patricia Riveill [Inria]
- Redha Abderrahmane Alliche [Univ Côte d'Azur]
- Michel Cosnard [Univ Côte d'Azur, HDR]
2 Overall objectives
Coati is a joint team between INRIA Sophia Antipolis - Méditerranée and the I3S laboratory (Informatique Signaux et Systèmes de Sophia Antipolis) which itself belongs to CNRS (Centre National de la Recherche Scientifique) and Univ. Côte d'Azur. Its research fields are Algorithmics, Discrete Mathematics, and Combinatorial Optimization, with applications mainly in telecommunication networks.
The main objectives of the Coati project-team are to design networks and communication algorithms. In order to meet these objectives, the team studies various theoretical problems in Discrete Mathematics, Graph Theory, Algorithmics, and Operations Research and develops applied techniques and tools, especially for Combinatorial Optimization and Computer Simulation. In particular, Coati used in the last years both these theoretical and applied tools for the design of various networks, such as SDN (software defined networks), WDM, wireless (radio), satellite, and peer-to-peer networks. This research has been done within various industrial and international collaborations.
Coati also investigates other application areas such as bio-informatics and transportation networks.
The research done in Coati results in the production of prototypes and more advanced software, and in the contribution to large open source software such as Sagemath.
3 Research program
Since its creation in 2013, the objectives of Coati are to conduct fundamental research in Discrete Mathematics, Graph Theory, Digraph Theory, Algorithms and Operations Research, and to use these tools for studying specific network optimization problems. Notice that we are mostly interested in telecommunications networks. However, our expertise can be applied to solve many other problems in various areas (transport, biology, resource allocation, social sciences, smart-grids, speleology, etc.) and we collaborate with teams of these other domains. Coati also contributes to the development of software components in order to validate proposed algorithms and to boost their dissemination.
The research program of Coati is therefore structured as follows.
- We conduct fundamental research in graph and digraph theory. Our goal is to better understand the structure of (di)graphs and which particular (sub)structures make an optimization problem on (di)graphs difficult. We are particularly interested in digraphs which are less investigated than (undirected) graphs, although most optimization problems are naturally modeled using digraphs. This is certainly due to the fact that several problems that can be solved in polynomial time on graphs are hard to solve on digraphs.
- We use this knowledge to design algorithms on (di)graphs (exact, sub-exponential, parameterized, approximation, heuristics) in order to solve various optimization problems. We also investigate games on graphs as an algorithmic counterpart of some (di)graph theory studies to get more insight on problems and (di)graphs properties. One of the challenges we have to face in the design of algorithms is the increase in size of practical instances. It is difficult, if not impossible, to solve practical instances optimally using existing tools. Therefore, we have to find new ways to address problems using reduction and decomposition methods, characterization of polynomial instances (which are sometimes the practical ones), or design of algorithms with acceptable practical performances independently of the worst case time complexity.
- We study specific network optimization problems at both design and management levels such as energy efficiency in networks, routing reconfiguration of optical and software defined networks (SDN), placement and migration of chains of virtual functions (NFV), compact routing in large-scale networks, deployment and management of fleet of drones, design of reliable wireless networks, evolution of the routing in case of any kind of topological modifications (maintenance operations, failures, capacity variations, ...), survivability to single and multiple failures, ... These specific problems often come from questions of our industrial partners (CIENA, Huawei, Orange labs). We first contribute to the modeling of these problems; then we either use existing tools or develop new tools in Operation Research and (Di)Graph Theory to solve them.
We also investigate optimization problems in other application fields (see Section 7.4) such as structural biology, transportation networks, economy, sociology, etc. For instance, we collaborate in Structural Biology with the Inria project-team ABS (Algorithms Biology Structure) from Sophia Antipolis. In the area of intelligent transport systems, we collaborate with the SMEs BeNomad and Instant-System on routing problems in multi-modal transportation systems. We also collaborate with GREDEG (research center in economics, law, and management) and the SKEMA business school on the analysis of the impact of competitive funding on the evolution of scientific networks.
On the one side, these collaborations benefit to the considered domains via the dissemination of our tools. On the other side, they give rise to new problems of interest for our community, and help us to improve our knowledge and to test our algorithms on specific instances.
- Last but not the least, the research done in Coati results in the production of software (Grph, BigGrph, etc.), and in the contribution to large open source softwares such as Sagemath.
Note also that beside our research activity, we are deeply involved in the dissemination of our domain towards a general public.
4 Application domains
4.1 Telecommunication Networks
Coati is mostly interested in telecommunications networks but also in the network structure appearing in social, molecular and transportation networks.
We focus on the design and management of heterogeneous physical and logical networks. The project has kept working on the design of backbone networks (optical networks, radio networks, IP networks). However, the fields of Software Defined Networks and Network Function Virtualization are growing in importance in our studies. In all these networks, we study routing algorithms and the evolution of the routing in case of any kind of topological modifications (maintenance operations, failures, capacity variations, etc.).
4.2 Other Domains
Our combinatorial tools may be well applied to solve many other problems in various areas (transport, biology, resource allocation, chemistry, smart-grids, speleology, etc.) and we collaborate with experts of some of these domains.
For instance, we collaborate with project-team ABS (Algorithms Biology Structure) from Sophia Antipolis on problems from Structural Biology (co-supervision of a PhD student). In the area of transportation networks, we collaborate with SMEs Benomad and Instant-System on dynamic car-pooling combined with multi-modal transportation systems in the context of ANR project Multimod started in January 2018. We collaborate with SME MillionRoads since October 2019 on the modeling and exploration of the HumanRoads database that gathers more than 100 million curriculums (studies and career paths of persons). Last, we have started a collaboration with GREDEG (Groupe de Recherche en Droit, Economie et Gestion, Université Côte d'Azur) and the SKEMA business school on the analysis of the impact of competitive funding on the evolution of scientific collaboration networks.
5 Highlights of the year
- Małgorzata Sulkowska
- Primus award for publications in distinctive scientific journals from the Wrocław University of Science and Technology, Poland.
- Secundus award for the best young computer scientists at the Wrocław University of Science and Technology, Poland.
6 New software and platforms
Let us desribe new/updated software.
6.1 New software
Graph algorithmics, Java, Data Exploration, Data base
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.
Nicolas Chleq, Frédéric Giroire, Luc Hogie, Nicolas Nisse
6.1.2 Graph Hyperbolicity
Graph algorithmics, Algorithm engineering, Gromov hyperbolicity
Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix multiplication as building block, both are not practical for large graphs. This software implements state-of-the-art algorithms and in particular new algorithms enabling to compute the hyperbolicity of graphs with unprecedented size (up to a million nodes) and speeds up the computation of previously attainable graphs.
Implementation in C++ of algorithms for computing the hyperbolicity of graphs.
David Coudert, André Nusser, Laurent Viennot
6.1.3 k shortest simple paths
k shortest simple paths
Graph, Graph algorithmics
Implementation in C++ of algorithms for computing the k shortest simple paths from a source to a destination in a weighted directed graph.
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). It also implements the PNC algorithm proposed by Al Zoobi, Coudert and Nisse to reduce the execution time of the NC algorithm.
David Coudert, Nicolas Nisse, Ali Al Zoobi
Graph algorithmics, Graph, Combinatorics, Probability, Matroids, Geometry, Numerical optimization
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.
SageMath is a free mathematics software system written in Python and combining a large number of mathematical libraries under a common interface.
INRIA teams contribute in different ways to the software collection. COATI adds new graph algorithms along with their documentations and the improvement of underlying data structures. LFANT contributes through libraries such as ARB and PARI/GP, and directly through SageMath code for algebras and ring and field extensions.
- Release Contributions:
David Coudert, Xavier Caruso
Java, HPC, Graph algorithmics
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.
Java, Distributed, Distributed computing, Distributed Applications, Web Services, Parallel computing, Component models, Software Components, P2P, Dynamic components, Iot
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 makes it applicable in many contexts such as parallel and distributed computing, cloud, Internet of Things (IOT), P2P networks. Idawi components can be deployed anywhere a SSH connection is possible. They exhibit services which communicate with each other via explicit messaging. Messages can be sent synchronously or asynchronously, and can be handled in either a procedural (with the optional use of futures) or reactive (event-driven) fashion. In the latter case, multi-threading is used to maximize both the speed and the number of components in the system. Idawi message transport is done via TCP, UDP, SSH or shared-memory.
Idawi is a synthesis of 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 team-projects.
Java, Distributed computing, Graph algorithmics
OnlineGraph is a cloud graph library. It consists of a (HTTP) server (based on Idawi) which exposes a set of (Web) services for the storage, the manipulation and the graphical rendering of graphs.
7 New results
7.1 Network Design and Management
Network design is a very wide subject which concerns all kinds of networks. In telecommunications, networks can be either physical (backbone, access, wireless, ...) or virtual (logical). The objective is to design a network able to route a (given, estimated, dynamic, ...) traffic under some constraints (e.g. capacity) and with some quality-of-service (QoS) requirements. Usually the traffic is expressed as a family of requests with parameters attached to them. In order to satisfy these requests, we need to find one or several paths between their end-nodes. The set of paths is chosen according to the technology, the protocol or the QoS constraints.
The last years have been very lively for networks with the rises of several new paradigms like Software Defined Networks (SDN) and Network Function Virtualization (NVF), of new technologies like 5G, Elastic Optical Networks or LoRa, and of new usages like Internet of Things, 5G, High quality video streaming. All these changes have brought or renewed a large number of algorithmic and optimization problems for the design and management of networks. In this context, our work has mainly focused on the study of three types of problems:
- How to build scalable routing solutions for SDN?
- How to efficiently route and place virtual resources in networks using NFV?
- How to use efficiently wireless networks?
This very wide topic is considered by a lot of academic and industrial teams in the world. Our approach is to attack these problems with tools from operations research and discrete mathematics (some of them developed in our teams, see Sections 7.2 and 7.3). This approach is shared by a number of other teams worldwide, e.g. UFC and UNIFOR (Fortaleza, Brazil), Concordia Univ. (Montréal, Canada), Univ. Adolfo Ibañez (Santiago, Chile), Univ. Oran (Algeria), with which we have a direct collaboration.
7.1.1 Network slicing and Network Function Virtualization
Participants: Giuseppe Di Lena, Adrien Gausseran, Frédéric Giroire, Hicham Lesfari, Joanna Moulierac, Stéphane Pérennes.
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.
Reconfiguration of slices
In collaboration with Brigitte Jaumard (Concordia University, Montréal, Canada), we consider in 37, 36 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 (as in 37). 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 in 36) that solve large data instances in few seconds.
Protection against failures
In collaboration with Chidung Lac (Orange labs), we investigate in 53 on the protection against failures of VNF deployments. We use a representation of the VNFs as a set of VNF components (VNFCs). These VNFCs are typically designed with a redundancy scheme and need to be deployed against failures of, e.g., compute servers, and must be such deployed with respect a particular resiliency mechanism for protection purposes. Therefore, choosing an efficient mapping of VNFCs to the compute servers is a challenging problem in the optimization of the software-defined, virtualization-based next generation of networks. In 53, we model the problem of reliable VNFCs placement under anti-affinity constraints using several optimization techniques. A novel approach based on an extension of bin packing is proposed. We perform a comprehensive evaluation in terms of performance under real-world ISP networks along with synthetic traces. We show that our methods can calculate rapidly efficient solutions for large instances.
In collaboration with Chidung Lac (Orange labs), Damien Saucez and Thierry Turletti (DIANA), and Issam Tahiri, Ruslan Sadykov and François Vanderbeck (RealOpt), we consider in 41 a path-based protection scheme with the global rerouting strategy in which, for each failure situation, there may be a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. After discussing the hardness of the problem, we develop two scalable mathematical models that we handle using both Column Generation and Benders Decomposition techniques. Through extensive simulations on real-world IP network topologies and on randomly generated instances, we show the effectiveness of our methods: they lead to savings of 40 to 48% of the bandwidth to be installed in a network to protect against failures compared to traditional schemes. Finally, our implementation in OpenDaylight demonstrates the feasibility of the approach. Its evaluation with Mininet shows that our solution provides sub-second recovery times, but the way it is implemented may greatly impact the amount of signaling traffic exchanged. In our evaluations, the recovery phase requires only a few tens of milliseconds for the fastest implementation, compared to a few hundreds of milliseconds for the slowest one.
Emulation of SDN networks
Mininet is the most popular tool when it comes to evaluate SDN propositions. Mininet allows to emulate SDN networks on a single computer but shows its limitations with resource intensive experiments as the emulating host may become overloaded. To tackle this issue, we propose Distrinet 31, a distributed implementation of Mininet over multiple hosts, based on LXD/LXC, Ansible, and VXLAN tunnels. Distrinet uses the same API than Mininet, meaning that it is compatible with Mininet programs. It is generic and can deploy experiments on Linux clusters (e.g., Grid'5000), as well as on the Amazon EC2 cloud platform.
In 49 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. This is why we propose and implement a new placement module for distributed emulation. Our 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.
This work has been done in collaboration with Chidung Lac (Orange labs) and Damien Saucez and Thierry Turletti (DIANA).
7.1.2 Optical networks
Participants: David Coudert.
Make-before-break reoptimization in optical networks
Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving capex (capital expenditure).
In collaboration with Brigitte Jaumard and Huy Duong (Concordia Université, Montréal, Canada) and Armolavicius, Romualdas (Ciena), we focussed in 34 on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
In collaboration with Brigitte Jaumard and Huy Duong (Concordia Université, Montréal, Canada), we revisited in 52 MBB rerouting with the objective of identifying the reroute sequence planning that minimizes the number of reroutes in order to minimize the resource usage. We propose a Dantzig-Wolfe decomposition mathematical model to solve this complex rerouting problem. We investigate how multiple or parallel rerouting reduces the overall minimum number of rerouting events (shortest makespan), and achieve the best resource usage. Numerical results bring interesting insights on that question and show a computational time reduction by about one order of magnitude over the state of the art.
Dantzig-Wolfe Decomposition for the Design of Filterless Optical Networks
Filterless optical networks use passive splitters and combiners with coherent optics, providing wavelength selection in the digital domain, while forming a passive fiber-tree topology between nodes. In collaboration with Brigitte Jaumard and Yan Wang (Concordia Université, Montréal, Canada), we investigate in 38 the optimal design of filterless optical networks while minimizing the number of required wavelengths. We propose a Dantzig-Wolfe decomposition model in which each subproblem aims to generate a potential filterless optical subnetwork, with a directed tree topology. The master problem then selects the best combination of subnetworks. Numerical experiments demonstrate significant performance improvement over previous work, reducing previous computational results by a factor of 2 to 10 depending on the size of the data instances.
7.1.3 Optimization of LoRa networks for the IoT
Participants: Christelle Caillouet.
LoRa is a low-power and long range radio communication technology designed for low-power Internet of Things devices. These devices are often deployed in remote areas where the end-to-end connectivity provided through one or more gateways may be limited. In collaboration with Dimitrios Zorbas, Khaled Abdelfadeel Hassan and Dirk Pesch (Tyndall National Institute, Irland), we examine in 43 the case where the gateway is not available at all times. As a consequence, the sensing data need to be buffered locally and transmitted as soon as a gateway becomes available. However, due to the Aloha-style transmission policy of current LoRa-based standards, such as the LoRaWAN, delivering a large number of packets in a short period of time by a large number of nodes becomes impossible. To avoid bursts of collisions and expedite data collection, we propose a time-slotted transmission scheduling mechanism.We formulate the data scheduling optimisation problem, taking into account LoRa characteristics, and compare its performance to low complexity heuristics. Moreover, we conduct a set of simulations to show the benefits of synchronous communications on the data collection time and the network performance.
In collaboration with Martin Heusse and Franck Rousseau (Drakkar, LIG, Grenoble), we propose in 57 an optimization model for single-cell LoRaWAN planning which computes the limit range of each spreading factor (SF) in order to maximize the minimum packet delivery ratio (PDR) of every node in the network. It allows to balance the opposite effects of attenuation and collision of the transmissions and guarantee fairness among the nodes.
7.1.4 Optimizing drone coverage
Participants: Christelle Caillouet, David Coudert, Igor Dias da Silva.
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 50, we address the data collection problem using the minimum number of unmanned aerial vehicles (UAVs) in a disaster management scenario where mobile sensors are investigating the devastated area. Critical information needs to be quickly gathered for processing by the rescue team, so the use of UAVs in this situation is of great interest. We propose an optimal model for computing the trajectories of the UAVs while guaranteeing the total coverage of the ground mobile sensors and connectivity among the UAVs with a central base station dedicated to data processing. Our model is based on a decomposition model and is solved effectively using column generation. We show that we can provide a plan for deploying the UAVs minimizing the total traveled distance.
7.1.5 Optimizing the exchange of data
Participants: Giuseppe Di Lena, Frédéric Giroire, Hicham Lesfari, Zhejiayu Ma.
Live streaming traffic represents an increasing part of the global IP traffic. Hybrid CDN-P2P architectures have been proposed as a way to build scalable systems with a good Quality of Experience (QoE) for users, in particular, using the WebRTC technology which enables real-time communication between browsers and, thus, facilitates the deployment of such systems. An important challenge to ensure the efficiency of P2P systems is the optimization of peer selection. Most existing systems address this problem using simple heuristics, e.g. favor peers in the same ISP or geographical region. In collaboration with Soufiane Roubia (EasyBroadcast) and Guillaume Urvoy-Keller (I3S), we analyzed in 54 9 months of operation logs of a hybrid CDN-P2P system and demonstrate the sub-optimality of those classical strategies. Over those 9 months, over 18 million peers downloaded over 2 billion video chunks. We propose learning-based methods that enable the tracker to perform adaptive peer selection. Furthermore, we demonstrate that our best models, which turn out to be the neural network models can (i) improve the throughput by 22.7%, 14.5%, and 6.8% (reaching 89%, 20.4%, and 24.3% for low bandwidth peers) over random peer, same ISP, and geographical selection methods, respectively (ii) reduce by 18.6%, 18.3%, and 16% the P2P messaging delay and (iii) decrease by 29.9%, 29.5%, and 21.2% the chunk loss rate (video chunks not received before the timeout that triggers CDN downloads), respectively.
Many companies and organizations are moving their applications from on-premises data centers to the cloud. The cloud infrastructures can potentially provide an infinite amount of computation (e.g., Elastic Compute) and storage (e.g., Simple Service Storage). In addition, all cloud providers propose different offers: IaaS, PaaS, and SaaS. The demo 96, done in collaboration with Chidung Lac (Orange labs) and Thierry Turletti (DIANA), focuses on the IaaS services, presenting a simple tool to measure the network delay in a virtual infrastructure built entirely in the cloud. These measurements are useful for organizations that are moving current applications to, or creating new applications in, the cloud, but have requirements on the maximum, or average, network delay that these applications can tolerate. We present CloudTrace, a simple CLI tool that creates regional and multiregional experiments to measure delay, using Amazon AWS.
Traffic monitoring and anomaly detection
With the continuous growing level of dynamicity, heterogeneity, and complexity of traffic data, anomaly detection remains one of the most critical tasks to ensure an efficient and flexible management of a network. Recently, driven by their empirical success in many domains, especially bioinformatics and computer vision, graph kernels have attracted increasing attention. Our work aims at investigating their discrimination power for detecting vulnerabilities and distilling traffic in the field of networking. In 59, we propose Nadege, a new graph-based learning framework which aims at preventing anomalies from disrupting the network while providing assistance for traffic monitoring. Specifically, we design a graph kernel tailored for network profiling by leveraging propagation schemes which regularly adapt to contextual patterns. Moreover, we provide provably efficient algorithms and consider both offline and online detection policies. Finally, we demonstrate the potential of kernel-based models by conducting extensive experiments on a wide variety of network environments. Under different usage scenarios, Nadege significantly outperforms all baseline approaches.
7.2 Graph Algorithms
In the last years, Coati has conducted an intense research effort on the algorithmic aspects of graph theory. We are mainly interested in designing efficient algorithms for large graphs and in understanding how structural properties of networks can help for this purpose. In general we try to find the most efficient algorithms, either exact algorithms or approximation ones, to solve various problems of graph theory, often with applications in telecommunication networks. We are involved in many international and national collaborations with academic and industrial partners.
We mainly focus on four topics: efficient computation of graph parameters, graph decompositions, combinatorial games in graphs and distributed computing.
- We use graph theory to model various network problems. We study their complexity with the aim of identifying the key structural properties of graphs that make these problems hard or easy. We then search for the most efficient algorithms to solve the problems, sometimes focusing on specific graph classes from which the problems are polynomial-time solvable. Our algorithms are generally implemented (e.g., in Sagemath) and tested on real-life networks (e.g., road networks, Twitter, graph of co-publications from Scopus, etc.).
- Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. We propose different approaches, based on a pursuit-evasion perspective or on metric aspects of graphs, to compute optimal or approximate tree-decompositions of graphs.
- One important topic of Coati is the study of combinatorial games in graphs. For instance, we are strongly involved in the organization of GRASTA dedicated to pursuit-evasion games (and their relationships with tree-decompositions) and games in graphs (special issues 102, 99, organization of the 10th edition of GRASTA in May 2022...). We study combinatorial games for themselves by determining their complexity but also because they provide nice models for problems arising in telecommunication networks (e.g., localization games).
- Within the research area of the theory of distributed computing, Coati investigates the recent topics of computational dynamics on complex networks, namely the study of algorithmically-simple interaction rules among agents represented by nodes of a complex network. Such systems are of interest in many scientific areas, ranging from biology to sociology. We contribute to this research endeavour by focusing on the fundamental coordination problems, in which agents are required to agree on a configuration which satisfies some condition based on their initial input state.
7.2.1 Complexity of graph problems
Participants: Ali Al Zoobi, David Coudert, Thomas Dissaux, Foivos Fioravantes, Nicolas Nisse.
Treelength of series-parallel graphs
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same bag of the decomposition. The treelength of a graph is the minimum length among its tree-decompositions. Treelength of graphs has been studied for its algorithmic applications in classical metric problems such as Traveling Salesman Problem or metric dimension of graphs and also, in compact routing in the context of distributed computing. Deciding whether the treelength of a general graph is at most 2 is NP-complete (graphs of treelength one are precisely the chordal graphs), and it is known that the treelength of a graph cannot be approximated up to a factor less than (the best known approximation algorithm for treelength has an approximation ratio of 3). However, nothing is known on the computational complexity of treelength in planar graphs, except that the treelength of any outerplanar graph is equal to the third of the maximum size of its isometric cycles. This work initiates the study of treelength in planar graphs by considering the next natural superclass of outerplanar graphs, namely the one of series-parallel graphs.
In collaboration with Guillaume Ducoffe (Université Politehnica, Bucarest, Roumanie) and Simon Nivelle (INSPÉ Paris), we first fully describe in 51, 58 the treelength of melon graphs (set of pairwise internally disjoint paths linking two vertices), showing that, even in such a restricted graph class, the expression of the treelength is not trivial. Then, we show that treelength can be approximated up to a factor in series-parallel graphs. Our main result is a polynomial-time algorithm for deciding whether a series-parallel graph has treelength at most 2. Our latter result relies on a characterization of series-parallel graphs with treelength 2 in terms of infinite families of forbidden isometric subgraphs.
The shortest simple paths problem with dissimilarity constraints
The similarity between two paths can be measured according to the proportion of arcs they share. We study the complexity of several variants of the problem of computing “dissimilar" paths (whose measure of similarity does not exceed a certain threshold) between two given vertices of a weighted directed graph. For four of the most studied measures in the literature, we give in 71, 55 a unified and simple proof of the fact that finding shortest dissimilar paths is NP-Complete. We then consider the problem of finding an alternative to one or more given paths. We show that finding a path that is dissimilar to another given path can be done in polynomial time for one of the four considered measures while it is NP-Complete for the three remaining measures. In addition, we show that if paths are given, finding a new path that is dissimilar to the given ones is NP-Complete even on DAGs for the four considered measures. Moreover, for the four considered measures, we show that if a path is given, finding a shortest path among those that are dissimilar to is NP-Complete in DAGs.
Complexity of finding maximum locally irregular induced subgraphs
If a graph is such that no two adjacent vertices of have the same degree, we say that is locally irregular. In collaboration with Nikolaos Melissinos (LAMSADE, Université Paris-Dauphine) and Theofilos Triomatis (School of Electrical Engineering, University of Liverpool), we introduce and study in 84 the problem of identifying a largest induced subgraph of a given graph that is locally irregular. Equivalently, given a graph , find a subset of of minimum order, such that by deleting the vertices of from results in a locally irregular graph; we denote with the order of such a set . We first treat some easy graph families, namely paths, cycles, trees, complete bipartite and complete graphs. However, we show that the decision version of the introduced problem is NP-Complete, even for restricted families of graphs, such as subcubic bipartite, or cubic graphs.
Then, looking for more positive results, we turn towards computing the parameter through the lens of parameterised complexity. In particular, we provide two algorithms that compute , each one considering different parameters. The first one considers the size of the solution and the maximum degree of with running time , while the second one considers the treewidth and of , and has running time . Therefore, we show that the problem is FPT by both and if the graph has bounded maximum degree . Since these algorithms are not FPT for graphs with unbounded maximum degree (unless we consider or as the parameter), it is natural to wonder about the existence of an algorithm that does not include additional parameters (other than or ) in its dependency. We manage to settle negatively this question, and we show that our algorithms are essentially optimal. In particular, we prove that there is no algorithm that computes with dependence or , unless the ETH fails.
7.2.2 Combinatorial games in graphs
Participants: Julien Bensmail, Jean-Claude Bermond, Foivos Fioravantes, Hicham Lesfari, Nicolas Nisse, Thi Viet Ha Nguyen, Stéphane Pérennes, Malgorzata Sulkowska.
Eternal domination game on graphs
In the eternal domination game played on graphs, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices on their turn. The goal is to determine the eternal domination number of a graph, which is the minimum number of guards required to defend against an infinite sequence of attacks.
We have continued the study of the eternal domination game on strong grids. Cartesian grids have been vastly studied with tight bounds for small grids such as , , , and grids, and it was proven in 103 that the eternal domination number of these grids in general is within of their domination number which lower bounds the eternal domination number. Furthermore, it has been proved in 101 that the eternal domination number of strong grids is upper bounded by .
In 39, we prove that, for all such that , (note that is the domination number of ). We then generalize our technique to prove that for all graphs , where is a large family of -dimensional grids which are supergraphs of the -dimensional Cartesian grid and subgraphs of the -dimensional strong grid. In particular, includes both the -dimensional Cartesian grid and the -dimensional strong grid.
Protection numbers in simply generated trees and Pólya trees
The protection number of a tree is the length of the shortest path from the root to a leaf. It is interchangeably called the protection number of the root. We define the protection number of a vertex in tree as the protection number of a maximal subtree of having as its root. In collaboration with Bernhard Gittenberger (Technische Universität Wien, Austria), Isabella Larcher (Technische Universität Wien, Austria) and Zbigniew Gołębiewski (Wrocław University of Science and Technology, Poland), we determine in 40 the limit of the expected value and the variance of the protection number of the root in simply generated trees, in Pólya trees, and in unlabelled non-plane binary trees, when the number of vertices tends to infinity. Moreover, we compute expectation and variance of the protection number of a randomly chosen vertex in all those tree classes. We obtain exact formulas as sum representations, where the obtained sums are rapidly converging thus allowing an efficient numerical computation of high accuracy.
The largest connected subgraph game
In collaboration with Fionn Mc Inerney (Technical University of Denmark), we have introduced in 75, 56, 44 the largest connected subgraph game played on an undirected graph . In each round, Alice first colours an uncoloured vertex of red, and then, Bob colours an uncoloured vertex of blue, with all vertices initially uncoloured. Once all the vertices are coloured, Alice (Bob, resp.) wins if there is a red (blue, resp.) connected subgraph whose order is greater than the order of any blue (red, resp.) connected subgraph.
We have first proved that Bob can never win, and define a large class of graphs (called reflection graphs) in which the game is a draw. We have then showed that determining the outcome of the game is PSPACE-complete, even in bipartite graphs of small diameter, and that recognising reflection graphs is GI-hard. We have also proved that the game is a draw in paths if and only if the path is of even order or has at least 11 vertices, and that Alice wins in cycles if and only if the cycle is of odd length. Lastly, we have given an algorithm to determine the outcome of the game in cographs in linear time.
The vertex-capturing game
Inspired by the board game Kahuna, we have introduced and studied in 79, in collaboration with Fionn Mc Inerney (Technical University of Denmark), a new 2-player scoring game played on graphs called the vertex-capturing game. The game is played on a graph by two players, Alice and Bob, who take turns colouring an uncoloured edge of the graph. Alice plays first and colours edges red, while Bob colours edges blue. The game ends once all the edges have been coloured. A player captures a vertex if more than half of its incident edges are coloured by that player, and the player that captures the most vertices wins.
Using classical arguments from the field, we have first proved general properties of this game. Namely, we have proved that there is no graph in which Bob can win (if Alice plays optimally), while Alice can never capture more than 2 more vertices than Bob (if Bob plays optimally). Through dedicated arguments, we have then investigated more specific properties of the game, and have focused on its outcome when played in particular graph classes. Specifically, we have determined the outcome of the game in paths, cycles, complete bipartite graphs, and Cartesian grids, and have given partial results for trees and complete graphs.
Bootstrap percolation and the game of life
Let be any non negative integer and let be any undirected graph in which a subset of vertices are initially infected. In collaboration with Fabricio Benevides (Federal University of Ceará, Brasil), we consider in 72 the process in which, at every step, each non-infected vertex with at least infected neighbours becomes infected and an infected vertex never becomes non-infected. The problem consists in determining the minimum size of an initially infected vertices set that eventually infects the whole graph . This problem is closely related to cellular automata, to percolation problems and to the Game of Life studied by John Conway. Note that for any connected graph . The case when is the grid, , and is well known and appears in many puzzle books, in particular due to the elegant proof that shows that for all . We study the cases of square grids, , and tori, , when . We show that for every even and that for any odd. When is odd, we show that both bounds are reached, namely if or for any , and if . Finally, for all , we give the exact expression of .
Rikudo is NP-complete
Rikudo is a number-placement puzzle, where the player is asked to complete a Hamiltonian path on a hexagonal grid, given some clues (numbers already placed and edges of the path). In collaboration with Kévin Perrot (Aix Marseille Université), we prove in 88 that the game is complete for NP, even if the puzzle has no hole. When all odd numbers are placed it is in P, whereas it is still NP-hard when all numbers of the form are placed.
Complexity of Games Compendium
Since games and puzzles have been studied under a computational lens, researchers unearthed a rich landscape of complexity results showing deep connections between games and fundamental problems and models in computer science. Complexity of Games (CoG, steven3k.gitlab.io/isnphard-test/) is a compendium of complexity results on games and puzzles. It aims to serve as a reference guide for enthusiasts and researchers on the topic and is a collaborative and open source project that welcomes contributions from the community. Emanuele Natale is both a contributor and an administrator of CoG.
7.2.3 Algorithm engineering
Participants: Ali Al Zoobi, David Coudert, Nicolas Nisse.
Algorithm Engineering is concerned with the design, analysis, implementation, tuning, and experimental evaluation of computer programs for solving algorithmic problems. It provides methodologies and tools for developing and engineering efficient algorithmic codes and aims at integrating and reinforcing traditional theoretical approaches for the design and analysis of algorithms and data structures. This approach is particularly suited when formal analysis pessimistically suggests bounds which are unlikely to appear on inputs of practical interest.
Algorithms for the shortest simple paths problem
The shortest simple path problem (SSP) asks to compute a set of top- shortest simple paths from a vertex to a vertex in a digraph. Yen (1971) proposed the first algorithm with the best known theoretical complexity of for a digraph with vertices and arcs. Since then, the problem has been widely studied from an algorithm engineering perspective, and impressive improvements have been achieved. The most noticeable proposals are the node-classification (NC) algorithm (Feng, 2014) and the sidetracks-based (SB) algorithm (Kurz, Mutzel, 2016). The latest offers the best running time at the price of a significant working memory. In 70, we first show how to speed up the SB algorithm using dynamic updates of shortest path trees resulting in a faster algorithm (SB*) with same working memory. We then propose the parsimonious SB (PSB) algorithm that significantly reduces the working memory of SB at the cost of a small increase of the running time. Furthermore, we propose the postponed node classification (PNC) algorithm that combines the best of NC and SB. It offers a significant speed up compared to NC while using the same amount of working memory of NC. Our experimental results on complex networks show that all of the considered algorithms have low working memory, and that the PSB algorithm is the fastest. On road networks, the SB* algorithm is the fastest (on median) among the considered algorithms, but it suffers from a large working memory. The PNC algorithm has comparable running time to SB* on road networks while using the same working memory as NC. The code of all considered algorithms is available online 97.
Then, in collaboration with Arthur Finkelstein (I3S and Instant-System), we have extended in 80 the Yen's and PNC algorithms to find the earliest arrival time journeys in public transit networks. The proposed PNC-PT algorithm (PNC for public transit networks) is currently the fastest algorithm for solving the problem.
Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, computing the hyperbolicity of a graph remains challenging. Indeed, the best known algorithm has time complexity , which is prohibitive for large graphs, and the most efficient algorithms in practice have space complexity . Thus, time as well as space are bottlenecks for computing the hyperbolicity.
In collaboration with André Nusser (MPII, Saarbrücken, Germany) and Laurent Viennot (GANG, Inria Paris), we designed a tool for enumerating all far-apart pairs of a graph by decreasing distances 81, a key component that was previously used to drastically reduce the computation time for hyperbolicity in practice. However, it required the computation of the distance matrix to sort all pairs of nodes by decreasing distance. We proposed a new data structure that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several graphs with more than 100 000 nodes that were far out-of-reach using previous algorithms. As iterating over far-apart pairs in decreasing order without storing them explicitly is a very general tool, we believe that our approach might also be relevant to other problems.
We then proposed in 47 a new approach that uses a hierarchy of distance- dominating sets to reduce the search space. This technique, compared to the previous best practical algorithms, enables us to compute the hyperbolicity of graphs with unprecedented size (up to a million nodes) and speeds up the computation of previously attainable graphs by up to 3 orders of magnitude while reducing the memory consumption by up to more than a factor of 23.
The C++ code of all our algorithms is available at 98.
7.2.4 Algorithms for social networks
Participants: Frédéric Giroire, Luc Hogie, Nicolas Nisse, Stéphane Pérennes, Malgorzata Sulkowska, Thibaud Trolliet.
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter
In 42, we study the clustering of directed social graphs. The clustering coefficient has been introduced to capture the social phenomena that a friend of a friend tends to be my friend. This metric has been widely studied and has been shown to be of great interest to describe the characteristics of a social graph. But, the clustering coefficient is originally defined for a graph in which the links are undirected, such as friendship links (Facebook) or professional links (LinkedIn). For a graph in which links are directed from a source of information to a consumer of information, it is no more adequate. We show that former studies have missed much of the information contained in the directed part of such graphs. We introduce a new metric to measure the clustering of directed social graphs with interest links, namely the interest clustering coefficient. We compute it (exactly and using sampling methods) on a very large social graph, a Twitter snapshot with 505 million users and 23 billion links, as well as other various datasets. We additionally provide the values of the formerly introduced directed and undirected metrics, a first on such a large snapshot. We observe a higher value of the interest clustering coefficient than classic directed clustering coefficients, showing the importance of this metric. By studying the bidirectional edges of the Twitter graph, we also show that the interest clustering coefficient is more adequate to capture the interest part of the graph while classic ones are more adequate to capture the social part. We also introduce a new model able to build random networks with a high value of interest clustering coefficient. We finally discuss the interest of this new metric for link recommendation.
A Random Growth Model with any Real or Theoretical Degree Distribution
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose in 60 a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections-commonly chosen as linear. We compute this attachment function for some classical distributions, as the power-law, broken power-law, geometric and Poisson distributions. We also use the model on an undirected version of the Twitter network, for which the degree distribution has an unusual shape.
Preferential attachment hypergraph with high modularity
Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and no general model allows to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. In 85, we present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularity. We compare its characteristics with a real-life co-authorship network and show that our model achieves good performances. We believe that our hypergraph model will be an interesting tool that may be used in many research domains in order to reflect better real-life phenomena.
In collaboration with Michał Lasoń (Wroclaw University of Science and Technology, Poland), we prove in 92 that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.
7.2.5 Distributed algorithms
Participants: Francesco D'Amore, Emanuele Natale.
Parallel Lévy walks
In collaboration with George Giakkoupis (WIDE Team, IRISA, Rennes) and Andrea Clementi (Univ. of Rome 2 "Tor Vergata", Rome, Italy), we investigate in 46 a parallel version of the famous Lévy walk stochastic process, the most famous general model of animal movement. More precisely, motivated by the Lévy foraging hypothesis – the premise that various animal species have adapted to follow Lévy walks to optimize their search efficiency – the authors study the parallel hitting time of Lévy walks on the infinite two-dimensional grid. They consider independent discrete-time Lévy walks, with the same exponent , that start from the same node, and analyze the number of steps until the first walk visits a given target at distance . They show that for any choice of and from a large range, there is a unique optimal exponent , for which the hitting time is w.h.p., while modifying the exponent by an term increases the hitting time by a polynomial factor, or the walks fail to hit the target almost surely. Based on that, they propose a surprisingly simple and effective parallel search strategy, for the setting where and are unknown: the exponent of each Lévy walk is just chosen independently and uniformly at random from the interval . This strategy achieves optimal search time (modulo polylogarithmic factors) among all possible algorithms (even centralized ones that know ). These results should be contrasted with a line of previous work showing that the exponent is optimal for various search problems. In their setting of parallel walks, the authors show that the optimal exponent depends on and , and that randomizing the choice of the exponents works simultaneously for all and .
Phase transitions of the -majority dynamics in a biased communication model
In collaboration with Hlafo Alfie Mimun and Matteo Quattropani (LUISS, Roma, Italy) and Sara Rizzo (GSSI, L'Aquila, Italy), we analyze in 48 the binary-state (either or ) -majority dynamics in a biased communication model where nodes have some fixed probability , independent of the dynamics, of being seen in state by their neighbors. In this setting we study how , as well as the initial unbalance between the two states, impact on the speed of convergence of the process, identifying sharp phase transitions.
In collaboration with Isabella Ziccardi (UNIVAQ, L'Aquila, Italy), we study in 94 the behavior of the 3-Majority dynamics in presence of noise. Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try to achieve agreements on some opinion must implement resilient dynamics that are not strongly affected by noisy communications. In this work, the authors study the popular 3-Majority dynamics, an opinion dynamics which has been proved to be an efficient protocol for the majority consensus problem, in which they introduce a simple feature of uniform communication noise, following 104. They prove that in the fully connected communication network of agents and in the binary opinion case, the process induced by the 3-Majority dynamics exhibits a phase transition. For a noise probability , the dynamics reaches in logarithmic time an almost-consensus metastable phase which lasts for a polynomial number of rounds with high probability. Furthermore, departing from previous analyses, the authors further characterize this phase by showing that there exists an attractive equilibrium value for the bias of the system, i.e. the difference between the majority community size and the minority one. Moreover, the agreement opinion turns out to be the initial majority one if the bias towards it is of magnitude in the initial configuration. If, instead, , no form of consensus is possible, and any information regarding the initial majority opinion is lost in logarithmic time with high probability. Despite more communications per-round are allowed, the 3-Majority dynamics surprisingly turns out to be less resilient to noise than the Undecided-State dynamics proposed in 104, whose noise threshold value is .
On some opinion dynamics in multi-agent systems.
The poster 95 by Francesco d'Amore and Emanuele Natale, in collaboration with Emilio Cruciani (University of Salzburg, Austria), has been presented at MOMI2021: Le Monde des Mathématiques Industrielles (Sophia Antipolis, France). Some recent results about opinion dynamics have been summarized: the community detection properties of the 2-Choices dynamics on core-periphery networks, and the phase transition of the Undecided-State dynamics in fully connected networks with uniform communication noise,
7.3 Graph and digraph theory
Coati works mainly on two important topics in graph theory, namely graph colouring and directed graphs (digraphs), as well as on the interaction between the two.
We are putting an effort on understanding better directed graphs and partitioning problems, and in particular colouring problems. We also try to better understand the many relations between orientations and colourings. We study various substructures and partitions in (di)graphs. For each of them, we aim at giving sufficient conditions that guarantee its existence and at determining the complexity of finding it.
7.3.1 Distinguishing labelling problems and the 1-2-3 Conjecture
Participants: Julien Bensmail, Foivos Fioravantes, Nicolas Nisse.
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 collaboration with Hervé Hocquard, Dimitri Lajou and Éric Sopena (LaBRI, Université de Bordeaux), we have investigated, through several works, the multiplicative version of the 1-2-3 Conjecture. In that variant of the 1-2-3 Conjecture, adjacent vertices are required to be distinguished, through a labelling, by their products of incident labels. The main conjecture here, is due to Skowronek-Kaziów, who conjectured in 2012 that labels should suffice for (nearly) all graphs. The best result towards that question, proved back in 2012, was that labels suffice in general.
In 23, we have made many progress towards that Multiplicative 1-2-3 Conjecture, proving that the conjecture holds for 4-colourable graphs, and providing a result that is very close to what is actually conjectured. Later on, in 76, building upon that earlier study, we have come up with a full proof of the Multiplicative 1-2-3 Conjecture. This stands as one of the most important results of the field, in the recent years.
In 77, we have also initiated the study of a list version of the Multiplicative 1-2-3 Conjecture, which is a standard way to generalise colouring/labelling problems. In particular, we conjecture that any list of three labels should permit to design labellings distinguishing adjacent vertices by products. Towards that presumption, we have provided several results and bounds as support.
In a few more works, we have investigated several side aspects of the 1-2-3 Conjecture, resulting in the study of related variants. Notably, interesting questions relate to the labels , which are at the heart of the conjecture. One can indeed legitimately wonder about the importance of these precise label values, and whether a similar question would still make sense when considering other label values.
For instance, in 26, with Fionn Mc Inerney (CISPA Helmholtz Center for Information Security, Saarbrücken, Germany) and Kasper Lyngsie (Technical University of Denmark), we have investigated the generalisation of existing results with labels to any pair of odd labels . While our results show that some results adapt naturally, they also highlight that some subtle discrepancies sometimes exist.
With Bi Li and Binlong Li (from Northwestern Polytechnical University and Xidian University, Xi'an, China), we have investigated proper labellings achieving additional constraints, such as minimising the sum of assigned labels 21 or the maximum vertex sum 25, the main point being to understand proper labellings further. From these questions, with Fionn Mc Inerney, we have run into the question of designing proper 3-labellings minimising the number of assigned 3's 20, 45. This last question has led us to also consider, with Fionn Mc Inerney, so-called equitable proper 3-labellings in 19, for which we have provided new results.
- In 28, we have investigated the so-called Weak -Conjecture, which, roughly put, stands as a weaker form of the 1-2-3 Conjecture where label 3 is replaced with a pair of two particular labels (through the notion of coloured labels). In particular, we have provided a result that gets very close to what is actually conjectured.
- In a last few works, we have also introduced new variants of distinguishing labelling problems, and have provided a few results on them. For instance, in 24, with Bi Li and Binlong Li, we have investigated a variant of proper labellings where one aims, through a labelling, at constructing an injective vertex-colouring (that is, no vertex should have two neighbours with the same sum of incident labels). In 78, with Hervé Hocquard and Pierre-Marie Marcille (ÉNS de Lyon), we have introduced a variant of the 1-2-3 Conjecture where the vertex sums are fetched within a larger radius , and it is required that vertices at distance at most from each other must be distinguished. This problem encapsulating the exact 1-2-3 Conjecture (when ), we have mainly investigated how existing results from the field generalise to larger 's. Lastly, in 27, with Fionn Mc Inerney we have introduced a few directed variants of the AVD Conjecture, which are, essentially, proper edge-colourings through which adjacent vertices can be distinguished through their sets of incident colours. Notably, we have introduced a general terminology that resulted in the introduction of four new problems, on which we have provided several results.
7.3.2 Graph and digraph colourings
Participants: Julien Bensmail, Foivos Fioravantes, Frédéric Havet.
In 63, 69, with Pierre Aboulker (DI ENS Paris) and Kolja Knauer and Clément Rambaud (Aix Marseille Université), we give bounds on the dichromatic number of a surface , which is the maximum dichromatic number of an oriented graph embeddable on . We determine the asymptotic behaviour of by showing that there exist constants and such that, for every surface with Euler characteristic . We then give more explicit bounds for some surfaces with high Euler characteristic. In particular, we show that the dichromatic numbers of the projective plane , the Klein bottle , the torus , and Dyck's surface are all equal to 3, and that the dichromatic numbers of the 5-torus and the 10-cross surface are equal to 4. We also consider the complexity of deciding whether a given digraph or oriented graph embeddable on a fixed surface is -dicolourable. In particular, we show that for any fixed surface, deciding whether a digraph embeddable on this surface is 2-dicolourable is NP-complete, and that deciding whether a planar oriented graph is 2-dicolourable is NP-complete unless all planar oriented graphs are 2-dicolourable (which was conjectured by Neumann-Lara).
Colouring decorated graphs
In two works 17, 18 with Sandip Das, Soumen Nandi and Sagnik Sen (from various institutes in India) and Théo Pierron and Éric Sopena (LaBRI, Université de Bordeaux), we have pursued the study of the usual chromatic theory of graphs to the realm of decorated graphs. Namely, we have considered the analogue of the chromatic number for pushable graphs (oriented graphs in which vertices can be pushed at will, i.e., have the direction of their incident arcs reversed) and signed graphs (2-edge-coloured graphs in which vertices can be switched at will, i.e., have the polarity of their incident edges interchanged). We have mainly focused of graphs with bounded maximum degree. Notably, we have managed to determine the exact value of the analogues of the chromatic number for pushable graphs and signed graphs with maximum degree 3.
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
The chromatic number, which refers to the minimum number of colours required to colour the vertices of graphs properly, is one of the most central notions of the graph chromatic theory. Several of its aspects of interest have been investigated in the literature, including variants for modifications of proper colourings. These variants include, notably, the achromatic number of graphs, which is the maximum number of colours required to colour the vertices of graphs properly so that each possible combination of distinct colours is assigned along some edge. The behaviours of this parameter have led to many investigations of interest, bringing to light both similarities and discrepancies with the chromatic number.
73 takes place in a recent trend aiming at extending the chromatic theory of graphs to the realm of signed graphs, and, in particular, at investigating how classic results adapt to the signed context. Most of the works done in that line to date are with respect to two main generalisations of proper colourings of signed graphs, attributed to Zaslavsky and Guenin. Generalising the achromatic number to signed graphs was initiated recently by Lajou, his investigations being related to Guenin's colourings. With François Dross and Éric Sopena (LaBRI, Université de Bordeaux) and Nacim Oijid (LIRIS Lyon) we have pursued this line of research in 73, but with taking Zaslavsky's colourings as our notion of proper colourings. We have studied the general behaviour of our resulting variant of the achromatic number, mainly by investigating how known results on the classic achromatic number generalise to our context. Our results cover, notably, bounds, standard operations on graphs, and complexity aspects.
On -colouring of planar digraphs
In a recent work 100 motivated by applications for time division multiple access (TDMA) scheduling problems in wireless networks, we have introduced the notion of -colouring of digraphs, which is a type of arc-colouring with specific colouring constraints.
In 22, we have pursued these investigations on planar digraphs by answering some of the questions left open in 100. We have exhibited planar digraphs needing 8 colours to be -coloured, thus showing that the upper bound of 100 cannot be decreased in general. We have also generalized the complexity result of 100 by showing that the problem of deciding whether a planar digraph can be --coloured is NP-hard for every . Finally, we have investigated the connection between the girth of a planar digraph and the least number of colours in its -colourings.
7.3.3 Graph drawing
Participants: Julien Bensmail.In the recent studies of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of the complete graph was found recently. With Alan Arroyo (IST Austria) and Bruce Richter (University of Waterloo, Canada), we have extended this characterization to all graphs in 16, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.
7.3.4 Substructures in graphs and digraphs
Participants: Frédéric Havet, Malgorzata Sulkowska.
Motivated by the proper orientations and the 1-2-3 Conjecture, we investigate the semi-proper orientations. A weighted orientation of graph is a pair where is an orientation of and is an arc-weighting . A semi-proper orientation is a weighted orientation such that for every two adjacent vertices and , , where is the sum of the weights of arcs with head in . The semi-proper orientation number of a graph , denoted by , is , where is the set of all semi-proper orientations of . Every proper orientation of a graph is a semi-proper orientation where the weight of each arc is 1. Consequently, we have , where , and are the chromatic number, the proper orientation number and the maximum degree of , respectively.
A semi-proper orientation is optimal if . With Ali Dehghan (Carleton University, Canada), we show in 30 that every graph has an optimal semi-proper orientation such that the weight of each arc is 1 or 2. We then give some bounds on the semi-proper orientation number: we show and for all graph , where and are the maximum average degree and the degeneracy of , 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 is NP-complete for planar graphs with ; we also show that deciding whether is NP-complete for planar bipartite graphs .
Unavoidable subdigraphs in tournaments
A tournament is an orientation of a complete graph. A digraph is -unavoidable if it is contained (as a subdigraph) in every tournament of order . It is well-known that only acyclic digraphs can be unavoidable, and that every acyclic digraph of order is -unavoidable. The unavoidability of an acyclic digraph , denoted by , is the minimum integer such that is -unavoidable. Determining tight upper bounds on the unavoidability of some special classes of acyclic digraphs has been largely studied since the celebrated theorems of Redei (1934) and Camion (1959) which solved the cases of directed paths and cycles, respectively. Special attention has been devoted to oriented trees and Sumner's conjecture (1972) stating that every tree is is -unavoidable, and the stronger one due to Havet and Thomassé (2000) stating that every tree tree of order with leaves is -unavoidable.
With François Dross (LaBRI, Université de Bordeaux), we improve in 33 on the results towards those conjectures. We first prove that every arborescence (tree in which all arcs are directed away from the root) of order with leaves is -unavoidable. We then prove that every oriented tree of order () with leaves is -unavoidable and -unavoidable, and thus -unavoidable. Finally, we prove that every oriented tree of order with leaves is -unavoidable.
With David Munhá Correia, Nemanja Draganić and Benny Sudakov (ETH Zürich, Switzerland), François Dross (LaBRI, Université de Bordeaux), Jacob Fox (Stanford University, CA, USA), António Girão (Heidelberg University, Germany), Dániel Korándi and Alex Scott (University of Oxford, England) and William Lochet (University of Bergen, Norway), we consider in 32 powers of directed paths. We show that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also give a complete solution for the problem in the special case of , showing that there is always a square of a directed path of length, which is best possible.
All these results were obtained using the notion of median order.
Spanning eulerian subdigraphs in semicomplete digraphs
A digraph is eulerian if it is connected and every vertex has its in-degree equal to its outdegree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In 86, together with Jørgen Bang-Jensen and Anders Yeo (University of Southern Denmark), we first characterize the pairs of a semicomplete digraph and an arc such that has a spanning eulerian subdigraph containing . In particular, we show that if is 2-arc-strong, then every arc is contained in a spanning eulerian subdigraph. We then characterize the pairs of a semicomplete digraph and an arc such that has a spanning eulerian subdigraph avoiding . In particular, we prove that every 2-arc-strong semicomplete digraph has a spanning eulerian subdigraph avoiding any prescribed arc. We also prove the existence of a (minimum) function such that every -arc-strong semicomplete digraph contains a spanning eulerian subdigraph avoiding any prescribed set of arcs. We conjecture that and establish this conjecture for and when the arcs that we delete form a forest of stars. A digraph is eulerian-connected if for any two distinct vertices , the digraph has a spanning -trail. We prove that every 2-arc-strong semicomplete digraph is eulerian-connected. All our results may be seen as arc analogues of well-known results on hamiltonian paths and cycles in semicomplete digraphs.
Counting embeddings of rooted trees into families of rooted trees
The number of embeddings of a partially ordered set in a partially ordered set is the number of subposets of isomorphic to . If both and have only one unique maximal element, we define good embeddings as those in which the maximal elements of and overlap. With Bernhard Gittenberger and Isabella Larcher (Technische Universität Wien, Austria), and Zbigniew Gołębiewski (Wroclaw University of Science and Technology, Poland), we investigate in 89 the number of good and all embeddings of a rooted poset in the family of all binary trees on elements considering two cases: plane (when the order of descendants matters) and non-plane. Furthermore, we study the number of embeddings of a rooted poset in the family of all planted plane trees of size . We derive the asymptotic behaviour of good and all embeddings in all cases and we prove that the ratio of good embeddings to all is of the order in all cases, where we provide the exact constants. Furthermore, we show that this ratio is non-decreasing with in the plane binary case and asymptotically non-decreasing with in the non-plane binary case and in the planted plane case. Finally, we comment on the case when is disconnected.
7.4 Other domains
We collaborate with experts in various areas (transport, bio-informatics, e-health, etc.). In this section, we present the results we have obtained in the context of these collaborations.
One important objective of Coati is to use its expertise on graph algorithms and Operations Research to address problems in other scientific domains (transport, bio-informatics, e-health, ed-tech, etc.). During the last years, we have initiated several collaborations with academic and industrial partners in this direction. In this section, we present the last results we have obtained in the context of these collaborations.
7.4.1 Bio-informatics motivated problems
Participants: David Coudert, Emilio Cruciani, Frédéric Havet, Emanuele Natale, Thi Viet Ha Nguyen.
Overlaying a hypergraph with a graph with bounded maximum degree
A major problem in structural biology is the characterization of low resolution structures of macro-molecular assemblies. One subproblem of this very difficult question is to determine the plausible contacts between the subunits (e.g. proteins) of an assembly, given the lists of subunits involved in all the complexes. This problem can be conveniently modelled by graphs and hypergraphs, and we collaborate with Dorian Mazauric (ABS) in order to better understand its computational complexity.
Let and be respectively a graph and a hypergraph defined on a same set of vertices, and let be a fixed graph. We say that -overlays a hyperedge of if the subgraph of induced by contains as a spanning subgraph, and that -overlays if it -overlays every hyperedge of . For a fixed graph and a fixed integer , the problem --Overlay consists in deciding whether there exists a graph with maximum degree at most that -overlays a given hypergraph . In 87, we prove that for any graph which is neither complete nor anti-complete, there exists an integer such that --Overlay is NP-complete for all .
Graph alignment for brain networks
In collaboration with Rachid Deriche, Samuel Deslauriers-Gauthier and Matteo Frigo (ATHENA), we investigated in 35 the problem of aligning brain atlases. More precisely, the interactions between different brain regions can be modeled as a graph, called connectome, whose nodes correspond to parcels from a predefined brain atlas, and whose edges encode the strength of the axonal connectivity between regions of the atlas that can be estimated via diffusion magnetic resonance imaging (MRI) tractography. In 35, we have provided a novel perspective on the problem of choosing a suitable atlas for structural connectivity studies by assessing how robustly an atlas captures the network topology across different subjects in a homogeneous cohort. We have measured this robustness by assessing the alignability of the connectomes, namely the possibility to retrieve graph matchings that provide highly similar graphs. We have introduced two novel concepts. First, the graph Jaccard index (GJI), a graph similarity measure based on the well-established Jaccard index between sets; the GJI exhibits natural mathematical properties that are not satisfied by previous approaches. Second, we have devised WL-align, a new technique for aligning connectomes obtained by adapting the Weisfeiler-Leman (WL) graph-isomorphism test. We have validated the GJI and WL-align on data from the Human Connectome Project database, inferring a strategy for choosing a suitable parcellation for structural connectivity studies.
7.4.2 Machine learning algorithms
Participants: Arthur Carvalho da Cunha, Emanuele Natale, Chuan Xu.
In collaboration with Laurent Viennot (GANG, Inria Paris), we investigate in 82 the problem of making a neural network perform some hidden computation whose result can be easily retrieved from the network output. In particular, we consider the following scenario. A user is provided a neural network for a classification task by a company. We further assume that the company has limited access to the user's computation, and can only observe the output of the network when the user evaluates it. The user's input to the network contains some sensible information. We provide a simple and efficient training procedure, called Hidden Learning, that produces two networks such that i) One of the networks solves the original classification task with comparable performance to state of the art solutions of the task; ii) The other network takes as input the output of the first and solves another classification task that retrieves the sensible information with considerable accuracy. Our result might expose important issues from an information security point of view, as for the use of artificial neural networks in sensible applications.
Privacy leakage in federated learning
Federated learning (FL) offers naturally a certain level of privacy, as clients’ data is not collected at a third party. However, maintaining the data locally does not provide itself formal privacy guarantees. An (honest-but-curious) adversary can still infer some sensitive client information just by eavesdropping the exchanged messages (e.g., gradients).
We initiate, in collaboration with Giovanni Neglia (NEO), the study of local model reconstruction attacks for federated learning, where a honest-but-curious adversary eavesdrops the messages exchanged between the client and the server and reconstructs the local model of the client 61. The success of this attack enables better performance of other known attacks, such as the membership attack, attribute inference attacks, etc. We provide analytical guarantees for the success of this attack when training a linear least squares problem with full batch size and arbitrary number of local steps. One heuristic is proposed to generalize the attack to other machine learning problems. Experiments are conducted on logistic regression tasks, showing high reconstruction quality, especially when clients’ datasets are highly heterogeneous (as it is common in federated learning).
In collaboration with Giovanni Neglia (NEO) and Oualid Zari (Intern, Université Côte d'Azur), we study in 62 the membership inference attack, where the adversary can infer whether the client owns a specific data instance. We propose a new passive inference attack that requires much less computation power and memory than existing methods. Our empirical results show that our attack achieves a higher accuracy on CIFAR100 dataset (more than 4 percentage points) with three orders of magnitude less memory space and five orders of magnitude less calculations.
8 Bilateral contracts and grants with industry
8.1 Bilateral contracts with industry
Participants: Frédéric Giroire, Nicolas Nisse.
- Duration: March 2021 - August 2021
- Project title: HumanRoads
- Coordinator: Nicolas Nisse
- Other partners: SME MillionRoads
- 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. In a previous project with MillionRoads, we have developed methods to optimize queries using algorithms on graphs. In this project, supporting the internship of Imane Houbbane, we have analyzed the data to detect career changes. The objective is to provide students and professionals relevant information for the evolution of their careers.
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 Partnerships and cooperations
9.1 International initiatives
9.1.1 Inria associate team not involved in an IIL or an international program
Participants: David Coudert, Adrien Gausseran, Frédéric Giroire, Joanna Moulierac.
Efficient Dynamic Resource Allocation in Networks
2019 - 2021
- Department of Electrical Engineering, Concordia University (Canada)
Networks are evolving rapidly in two directions. On the one hand, new network technologies are developed for different layers, and in particular flexible optical technologies (enabling to allocate a fraction of the optical spectrum rather than a fixed wavelength), Software Defined Networks, and Network Function Virtualization. On the other hand, the traffic patterns evolve and become less predictable due to the increase of cloud and mobile traffic. In this context, there are new possibilities and needs for dynamic resource allocations. We will study this problem mainly in two directions: network reconfiguration and the allocation of virtualized resources. The associated team will build on an already fruitful collaboration between COATI and Concordia. The two teams address design and management optimization problems in networks (WDM, wireless, SDN) with complementary tools and expertise.
9.1.2 STIC/MATH/CLIMAT AmSud project
Participants: Julien Bensmail, David Coudert, Foivos Fioravantes, Frédéric Giroire, Frédéric Havet, Nicolas Nisse.
Graphs ALgorithms for Optimization Problems
2019 - 2021
- Universidade Federal do Ceará
- Universidad Adolfo Ibañez
This project aims at studying the Computational Complexity of several important problems arising in networks. In particular, we will focus on the computation of metric or structural properties and parameters of large networks. We plan to design efficient exact algorithms for solving these problems or to theoretically prove that such algorithms cannot exist. In the latter case, we will then design approximation algorithms, or prove that none exists. In all cases, we aim at implementing our algorithms and use them on real-world instances such as large road networks or huge social networks.
9.1.3 Participation in other International Programs
Participants: Julien Bensmail, Foivos Fioravantes, Nicolas Nisse.
Décompositions arborescentes et problèmes de graphes (DESPROGES).
- Xidian University (Xi’an, Chine).
2020 - 2021.
Partenariats Hubert Curien (PHC) Xu Guangqi.
This project aims at studying relationships between tree-decompositions and distinguishing labellings in graphs.
9.2 International research visitors
9.2.1 Visits of international scientists
Institution of origin:
Gran Sasso Science Institute (GSSI), L'Aquila
October 18-22, 2021
Context of the visit:
Mobility program/type of mobility:
Institution of origin:
Indian Statistical Institute Kolkata
November 2-5, 2021
Context of the visit:
Mobility program/type of mobility:
9.3 National initiatives
DGA/Inria Brainside, 2019-2023
Participants: Francesco D'Amore, Arthur Carvalho Walraven Da Cunha, Emanuele Natale.
Algorithms for simplifying neural networks
October 2019 - March 2023
- Inria Paris, EP GANG
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.
Scalable routing in Multi Modal transportation networks
January 2018 - June 2023
- Inria Paris, EP GANG
- team CeP, I3S laboratory
- SME Instant-System
- SME Benomad
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.
ANR-19-CE48-0013-01 Digraphs, 2020-2023
Participants: Julien Bensmail, David Coudert, Frédéric Havet, Nicolas Nisse, Stéphane Pérennes.
January 2020 - December 2023
- LIRMM, Montpellier
- LIP, Lyon
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 ?
Défi Inria-Cerema ROAD-AI, 2021-2024
Participants: Christelle Caillouet, David Coudert.
Routes et Ouvrages d'Art Diversiformes, Augmentés & intégrés
July 2021 - June 2024
Nathalie Mitton (head, Inria, EP FUN), Christophe Biernacki (vice-head, Inria, EP MODAL), Pierre Marchand (Cerema, DTEC ITM), André Orcési (Cerema, DTEC ITM)
Inria project-teams ACENTAURI, COATI, FUN, MODAL, STATIFY, MODAL
Integrated management of infrastructure assets is an approach which aims at reconciling long-term issues with short-term constraints and operational logic. The main objective is to enjoy more sustainable, safer and more resilient transport infrastructure through effective, efficient and responsible management. To achieve this, CEREMA and Inria are joining forces in this Inria Challenge (DEFI) which main goals are to overcome scientific and technical barriers that lead to the asset management of tomorrow for the benefit of road operators: (i) build a “digital twin” of the road and its environment at the scale of a complete network; (ii) define “laws” of pavement behavior; (iii) instrument system-wide bridges and tunnels and use the data in real time; (iv) define methods for strategic planning of investments and maintenance.
9.3.1 GDR Actions
GDR RSD, ongoing (since 2006)
Members of Coati are involved in the working group RESCOM (Réseaux de communications) of GDR RSD, CNRS (gdr-rsd.fr/?page_id=159). In particular, David Coudert is co-chair of this working group since 2017.
We are also involved in the working group "Energy" of GDR RSD (gdr-rsd.fr/?page_id=166). In particular, Frédéric Giroire is co-chair of this working group.
GDR IM, ongoing (since 2006)
Members of Coati are involved in the working group "Graphes" of GDR IM, CNRS. (gtgraphes.labri.fr/). In particular, Frédéric Havet is member of the steering committee.
GDR MADICS, ongoing (since 2017)
Members of Coati are involved in the working group GRAMINEES (GRaph data Mining in Natural, Ecological and Environnemental Sciences) of GDR MADICS (Masses de Données, Informations et Connaissances en Sciences). (www.madics.fr/actions/actions-en-cours/graminees/).
9.4 Regional initiatives
Participants: David Coudert, Frédéric Giroire, Nicolas Nisse, Stéphane Pérennes, Malgorzata Sulkowska, Thibaud Trolliet.
Innovation project of IDEX UCA.
Scientific Networks and IDEX Funding
September 2018 - August 2021
- I3S (SigNet)
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 compared 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.
Bourse “Emplois Jeunes Doctorants”, Région SUD PACA, 2018-2021
Participants: Ali Al Zoobi, David Coudert, Nicolas Nisse.
Bourse “Emplois Jeunes Doctorants”, Région SUD PACA
Algorithmes pour le transport collectif à la demande dynamique en zone urbaine
October 2018 - September 2021
We aim at designing algorithms that will eventually make it possible to consistently deploy a real-time on-demand public transport service in urban areas by integrating it with the regular public transport offer. To reach this goal, we must design a set of algorithms to respond very quickly (less than a second) to a user's request, made from their smartphone. This raises many difficult questions related to the dial-a-ride-problem.
10.1 Promoting scientific activities
10.1.1 Scientific events: organisation
General chair, scientific chair
10.1.2 Scientific events: selection
Chair of conference program committees
- David Coudert and Emanuele Natale.
- SEA'21: 19th Symposium on Experimental Algorithms, Nice (online), France, June 7-9, 2021 (sea2021.i3s.unice.fr)
Member of the conference program committees
- Ramon Aparicio :
- ACM MMSys'21: International Conference on Multimedia Systems, Istanbul, Turkey, September 28 - October 1st, 2021;
- IEEE Globecom'21: IEEE Global Communications Conference, Madrid, Spain, December 7-11, 2021.
- Christelle Caillouet :
- CoRes'21: 6ème Rencontres Francophones sur la Conception de Protocoles, l’Evaluation de Performance et l’EXpérimentation des Réseaux de Communication, La Rochelle, September 20-24, 2021.
- David Coudert :
- ALGOCLOUD'21: International Symposium on Algorithmic Aspects of Cloud Computing, online, September 6-7, 2021;
- IEEE ICC'21: IEEE International Conference on Communications, Virtual Conference, June 14-23, 2021;
- IEEE Globecom'21: IEEE Global Communications Conference, Madrid, Spain, December 7-11, 2021;
- ONDM'21: 25th Conference on Optical Network Design and Management, online, June 28 - July 1st, 2021.
- Frédéric Havet :
- LAGOS 2021: XI Latin and American Algorithms, Graphs and Optimization, Sao Paulo, Brazil, May 17-21, 2021;
- JGA 2021: Journées Graphes et Algorithmes, Montpellier (on-line), November 15-19, 2021.
- Joanna Moulierac :
- CoRes'21: 6ème Rencontres Francophones sur la Conception de Protocoles, l’Evaluation de Performance et l’EXpérimentation des Réseaux de Communication, La Rochelle, September 20-24, 2021.
- Emanuele Natale
- AAMAS'21: 20th International Conference on Autonomous Agents and Multiagent Systems, virtual event, May 3-7, 2021;
- Euro-Par'21: 27th International European Conference on Parallel and Distributed Computing, virtual event, August 30 - September 3, 2021.
- Nicolas Nisse :
- AlgoTel'21: 23es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Rochelle, September 20-24, 2021.
Members of COATI have reviewed numerous manuscripts submitted to national and international conferences, including:
AAAI'22; AAMAS'21; ACM MMSys; ALGOCLOUD'21; ALGOSENSORS'21; AlgoTel'21; CoRes'21; Euro-Par'21; IEEE ICC'21; IEEE Globecom'21; LAGOS'21; MFCS'21; NeurIPS'21; ONDM'21; PODC'21; SEA'21; STACS'22; WADS'21.
Member of the editorial boards
- Ramon Aparicio-Pardo :
- Guest Editor: Special Issue on Optical Network Automation for MDPI Sensors (ISSN 1424-8220).
- Jean-Claude Bermond :
- Computer Science Reviews (Elsevier);
- Discrete Applied Mathematics (Elsevier);
- Discrete Mathematics (Elsevier);
- Discrete Mathematics, Algorithms and Applications (World Scientific);
- Journal of Graph Theory (Wiley);
- Advisory board of Journal of Interconnection Networks (World Scientific);
- Networks (Wiley);
- Parallel Processing Letters (World Scientific);
- the SIAM book series on Discrete Mathematics (SIAM).
- Alexandre Caminada :
- IEEE Transactions on Mobile Computing (IEEE);
- IEEE Transactions on Vehicular Technology (IEEE);
- Journal of Traffic and Transportation Engineering (Elsevier);
- Sensors — Open Access Journal (MDPI);
- Soft Computing (Springer).
- David Coudert :
- Discrete Applied Mathematics (Elsevier);
- Networks (Wiley).
- Frédéric Giroire :
- Journal of Interconnection Networks (World Scientific);
- Telecom (MDPI).
- Frédéric Havet
- Discrete Mathematics and Theoretical Computer Science (DMTCS).
- Emanuele Natale
- The WikiJournal of Science (Wikimedia Foundation).
Reviewer - reviewing activities
Members of COATI have reviewed numerous manuscripts submitted to international journals, including:
ACM Journal of Experimental Algorithmics; Combinatorics, Probability and Computing; Computer Networks (COMNET); Computers & Operations Research (COR); Discrete Mathematics; Discrete Applied Mathematics (DAM); Discrete Mathematics and Theoretical Computer Sciences (DMTCS); European Journal of Operational Research (EJOR); IEEE Internet of Things Journal; IEEE Transactions on Mobile Computing (TOMC); IEEE Transactions on Network and Service Management; IEEE Transactions on Network Science and Engineering; INFORMS Journal on Computing; Journal of Combinatorial Theory Ser. B; MDPI Future Internet; MDPI Sensors; Networks (Wiley); SIAM Journal of Discrete Mathematics (SIDMA); Springer Photonic Network Communications; The Computer Journal; Theoretical Computer Science (TCS).
10.1.4 Invited talks
- Julien Bensmail :
- An introduction to the 1-2-3 Conjecture (and related problems). Invited speaker at “42èmes Journées Franciliennes de Recherche Opérationnelle” (JFRO), online, September 2021;
- A proof of the Multiplicative 1-2-3 Conjecture. Séminaire du groupe de travail Graphes et Optimisation, LaBRI, Université de Bordeaux, September 2021.
- David Coudert :
- On the Flinders Hamiltonian Cycle Problem Challenge. Seminar of the Romanian Young Academy (RYA), online, November 18, 2021.
- Francesco d'Amore :
- Search via Parallel Lévy Walks on , online seminar at Dipartimento di Logica ed Informatica Teorica, Università Roma Tre (IT), online, April 2021.
- Hicham Lesfari :
- Graph learning for networking, meeting of the Scientific and Pedagogical Advisory Board (SPAB) of EUR DS4H, Université Nice Côte d'Azur, July 28-29, 2021
- Nicolas Nisse :
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. Graph Searching in Canada (GRASCAN), August 5, 2021 and Seminar of the Romanian Young Academy (RYA), online, November 4, 2021.
- Thi Viet Ha Nguyen
- Graph problems motivated by resolution models of large protein assemblies. seminar of the ALGCO team, LIRMM Montpellier, October, 2021.
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 since 2005;
- President of the PhD prize committee ; Graphes "Charles Delorme".
10.1.6 Scientific expertise
- Julien Bensmail :
- External reviewer for the OPUS-21 program by the National Science Center (NSC) of Poland.
- Jean-Claude Bermond :
- Expert for DRTT-MESR Crédit impôt recherche (CIR et agréments).
- David Coudert :
- Expert for ANR and ANRT;
- External reviewer for the Central Research Development Fund of the University of Bremen.
- Frédéric Giroire :
- Member of the expert committee of the MESRI-BMBF German-French Joint Call For Proposals on “Artificial Intelligence” ;
- External reviewer for the European CHIST-ERA Call 2020;
- Reviewer for the Inria associated team process.
- Frédéric Havet :
- Expert for ANR and FNRS (Belgium).
- Emanuele Natale :
- Grant reviewer for the National Science Center of Poland, SONATA-16 call.
- Nicolas Nisse :
- Expert for European Science Foundation;
- Natural Sciences and Engineering Research Council of Canada;
- National Research and Development Agency, ANID, Chile.
- Michel Syska :
- Expert for DRTT-MESR Crédit impôt recherche (CIR et agréments).
10.1.7 Research administration
- Ramon Aparicio:
- Principal investigator of ARTIC project (ARTificial Intelligence-based Cloud network control), 220 k€ over 42 months funded by ANR JCJC 2019, March 2020 - Sept. 2023.
- Jean-Claude Bermond
- Responsible for the cooperation between Inria and Greece.
- Christelle Caillouet
- Elected member of Conseil de Laboratoire I3S since 2017;
- Member of selection committee MCF27 749, Université Côte d'Azur, 2021;
- Member of selection committee MCF27 4270, INSA Lyon, 2021.
- 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 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 since 2018;
- Member of the “Bureau du comité des équipe-projets” of Inria research center Sophia Antipolis - Méditerranée since 2018;
- Member of selection committee MCF27 749, Université Côte d'Azur, 2021.
- 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.
- Emanuele Natale :
- Member of selection committee MCF27 749, Université Côte d'Azur, 2021.
- Nicolas Nisse :
- Elected member for the "Comité de centre", Inria Sophia Antipolis - Méditerranée, since 2017;
- Elected member for Inria at the CoSP of EUR DS4H since October 2020;
- Member of the CoSP Terra Numerica, since 2020.
- Michel Syska
- Nominated deputy director of the computing science department of Université Côte d'Azur (Département Disciplinaire Informatique) : March 2020 - March 2021.
10.2 Teaching - Supervision - Juries
10.2.1 Teaching Responsibilities
- Julien Bensmail :
- Head of the Licence Professionnelle “Managements des Processus Logistiques” (MPL) of Université Côte d'Azur, since September 2019.
- 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).
- Michel Syska :
- Vice Head of the Bachelor’s degree in Artificial Intelligence (Licence Sciences et Technologies parcours IA), of Université Côte d'Azur;
- Head of "Campus des Métiers et des Qualifications - défi du numérique", Université Côte d'Azur, Rectorat et Région PACA (since May 2021).
Members of Coati have taught for more that 1650 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: Thomas Dissaux, Introduction aux Bases de données et SQL, 30h ETD, Level L1, Département Informatique of IUT, Université Côte d'Azur, France;
- DUT: Thomas Dissaux, Bases de la Conception Orientée Objet, 64h ETD, Level L1, Département Informatique of IUT, Université Côte d'Azur, France;
- DUT: Foivos Fioravantes, Bases de Données, 32h ETD, Level L1, Département Informatique of IUT, Université Côte d'Azur, France;
- DUT: Foivos Fioravantes, Conception Orientée Objet, 32h 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, 30h ETD, Level L2, IUT, Université Côte d'Azur, France;
- DUT: Thi Viet Ha Nguyen, Algorithmique, 24h ETD, Level L1, Département QLIO of IUT, Université Côte d'Azur, France;
- DUT: Thibaud Trolliet, Introduction aux bases de données, 64h ETD, 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, 48h ETD, Level L2, IUT, Université Côte d'Azur, France;
- DUT: Michel Syska, Algorithmics, 53h ETD, Level L2, IUT, Université Côte d'Azur, France;
- DUT: Michel Syska, Distributed programming, 87h ETD, Level L2, IUT, Université Côte d'Azur, France;
- DUT: Luc Hogie, Distributed programming, 24h 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;
- Licence: Redha Abderrahmane Alliche, Systèmes et Réseaux, 24h ETD, Level L3, Polytech Nice-Sophia, France;
- Licence: Ali Al Zoobi, Programmation et structures en C, 24h ETD, Level L2, Faculté des sciences, Université Côte D'Azur, France;
- Licence: 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;
- Licence: Michel Syska, Networks, 31h ETD, Level L3, MIAGE - Université Côte d’Azur, France;
- Licence: Luc Hogie, Programmation et Conception Orientée Objet, 24h ETD, Level L3, IA - Université Côte d’Azur, France;
- License: Chuan Xu, Programmation fonctionnelle, 36h ETD, Level L3, Université Côte d’Azur, France;
- License: Chuan Xu, Python pour l'IA, 30h ETD, Level L3, Université Côte d’Azur, France;
- Master: Christelle Caillouet, Data Mining for Networks, 9h ETD, M2 Ubinet, 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: 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: Frédéric Giroire, ICT and Environment, Green algorithm design, 4.5h ETD, Master 2, minor, Université Côte d'Azur, France;
- Master: Nicolas Nisse, Graphs, 36h ETD, M1 Informatique et Interaction, 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.
- PhD in progress: Redha Abderrahmane Alliche, Artificial Intelligence-based cloud network control, since October 2020. Co-supervisors: Ramon Aparicio and Lucile Sassatelli;
- PhD in progress: Arthur Carvalho Walraven Da Cunha, Algorithmic Principles for Artificial Neural Network Compression, since October 2020. Supervisor: Emanuele Natale;
- PhD in progress: Francesco d'Amore, Dynamics for multi-agent system coordination in noisy and stochastic environments, since October 2019. Co-supervisors: Emanuele Natale and Nicolas Nisse;
- PhD in progress: Thomas Dissaux, Graph decompositions and treelength, since October 2020. Supervisor: Nicolas Nisse;
- PhD in progress: Foivos Fioravantes, Distinguishing labellings of graphs, since October 2019. Co-supervisors: Julien Bensmail and Nicolas Nisse;
- PhD in progress: Igor Dias da Silva, Optimization of UAVs deployment and coordination for exploration and monitoring applications, since October 2020. Co-supervisors: Christelle Caillouet and David Coudert;
- PhD in progress: Hicham Lesfari, Machine learning for dynamic network resource allocation, since October 2019. Supervisor: Frédéric Giroire;
- PhD in progress: Zhejiayu Ma, Learning problem for the diffusion of multimedia contents, since October 2018. Co-Supervisors: Guillaume Urvoy-Keller, Frédéric Giroire, Soufiane Rouiba (Easybroadcast, Nantes). CIFRE grant with Easybroadcast;
- PhD in progress: Lucas Picassari-Arrieta , digraphs coloring, since October 2021. Supervisor: Frédéric Havet;
- PhD: Ali Al Zoobi, Algorithms for shared on demand public transportation system in the city, Université Côte d'Azur, November 25, 2021. Co-supervisors: David Coudert and Nicolas Nisse;
- PhD: Giuseppe Di Lena, Resilience of virtualized networks 65, March 22, 2021. Co-supervisors: Thierry Turletti (DIANA), Chidung Lac (Orange Labs Lannion) and Frédéric Giroire. CIFRE grant with Orange;
- PhD: Adrien Gausseran, Optimization Algorithms for Network Slicing for 5G 66, November 9, 2021. Supervisors: Joanna Moulierac and Nicolas Nisse;
- PhD: Thi Viet Ha Nguyen, Graph Algorithms techniques for (low and high) resolution model of large protein assemblies 67, December 13, 2021. Co-supervisors: Frédéric Havet and Dorian Mazauric (ABS);
- PhD: Thibaud Trolliet, Exploring Trust on Twitter 68, June 25, 2021. Co-supervisors: Arnaud Legout (DIANA) and Frédéric Giroire.
- DUT: Fedi Ghalloussi, Réalisation d’une interface web pour l’intergiciel Idawi, Inria, from May 2021 until Jul 2021. Supervisor: Luc Hogie;
- Licence: Hugo Boulier, Affectation de longueurs d'ondes dans les réseaux optiques sans filtres, ENS Rennes, France, from May 15 until July 5 2021. Supervisor: David Coudert, Frédéric Havet and François Pirot;
- Licence: Cyprien Michel-Deletie, Null Processes for Computational Neuroscience, L3 ENS Lyon, May 31 till July 09, 2021. Supervisors: Emanuele Natale, Matteo Frigo (ATHENA), Samuel Deslauriers-Gauthier (ATHENA);
- Licence: Nacim Oijid, The Maker-Breaker Largest Connected Subgraph Game, L3 ENS Lyon, from Apr 2021 until Jun 2021. Supervisor: Nicolas Nisse;
- Licence: Juliette Schabanel, Dichromatic number of surfaces, L3 ENS Paris, from Jun 2021 until Jul 2021. Supervisors: Frédéric Havet and François Pirot;
- Master 1 (PFE): Khadidiatou Dieye, Web dev/ergonomics : Conception and implementation of a Web graph library/plaform, Master 1 MIAGE, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisor: Luc Hogie;
- Master 1: Pierre Pebereau Calcul exact de la pathlength par branch-and-bound, 2nd year Télécom Paris, from July 5 until August 31, 2021. Supervisors: David Coudert and Nicolas Nisse;
- Master 2 (PFE): Maria Darido, Data acquisition and collection in harsh environment, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Christelle Caillouet and David Coudert;
- Master 2 (PFE): Tiago Da Silva Barros, Network simulator for reinforcement learning, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Ramon Aparicio-Pardo;
- Master 2 (PFE): Barbara Da Silva Oliveira, Quantum Entanglement Routing, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Ramon Aparicio-Pardo;
- Master 2 (PFE): Hassan El Chokraallah, Using semantic graph clustering to explore study and career paths with the goal to help student and professional counselling, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Frédéric Giroire and Nicolas Nisse;
- Master 2 (PFE): Mohamed Jadar, Federated Learning On Heterogeneous Systems, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Chuan Xu;
- Master 2 (PFE): Mohamed Lahsini, Deep Reinforcement Learning for Video caching, aster 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Ramon Aparicio-Pardo;
- Master 2 (PFE): Leonardo Serilli, Evolution over time of the structure of social graphs: Clustering, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from November 2021 until December 2021. Supervisors: Frédéric Giroire, Nicolas Nisse, Małgorzata Sulkowska;
- Master 2: Gregory Hoareau, Programming a firendly interface for playing to cops and robber games, Polytech’Nice, 5th year, speciality HCI, Université Côte d'Azur, France, from Mar 2021 until Sep 2021. Supervisors: Frédéric Havet, Dorian Mazauric, Nicolas Nisse and Michel Syska;
- Master 2: Imane Houbbane, Explore study and career paths with the goal to help student and professional counselling, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from March 2021 until August 2021. Supervisors: Frédéric Giroire and Nicolas Nisse;
- Master 2: Kostiantyn Ohulchanskyi, Random preferential attachment hypergraph with vertex deactivation, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from March 2021 until August 2021. Supervisors: Frédéric Giroire, Nicolas Nisse, Małgorzata Sulkowska, Thibaud Trolliet;
- Master 2: Marcello Politi, A computational study of iterative pruning algorithms, University of Rome 2 "Tor Vergata", Rome, Italy. From March to July 2021. Supervisor: Emanuele Natale;
- Master 2: Sofiia Shelest, Evolution over time of the structure of social graphs, Master 2 IFI, international track Ubinet, Université Côte d'Azur, France, from March 2021 until August 2021. Supervisors: Frédéric Giroire, Nicolas Nisse, Małgorzata Sulkowska, Thibaud Trolliet.
- Jean-Claude Bermond :
- invited member for the HDR of Dorian Mazauric, Université Côte d'Azur, November 5, 2021.
- Christelle Caillouet :
- Member of the Comité de Suivi individuel of the PhD thesis of Masoud Taghavian, IMT Atlantique, June 14, 2021;
- Member of the PhD committee of Takwa Attia, Optimization and experimental characteriza- tion of Low Power Wide Area Networks, LIG, Université de Grenoble Alpes, December 15, 2021.
- David Coudert :
- Member of the PhD committee of Antonin Lentz, Calcul de plus courts chemins multicritères et problèmes géométriques connexes, LaBRI, Bordeaux, France, July 5, 2021;
- Member of the Comité de Suivi individuel of the PhD thesis of Federico Brunero, Eurecom, Sophia Antipolis, January 15 2021 and September 30, 2021;
- Referee and member of the PhD committee of Samuel Masseport, Consensus blockchain: incitation des utilisateurs à la participation et à la loyauté, LIRMM, Université de Montpellier, October 12, 2021;
- President of the PhD committee of Nicolas Isoart, Le problème du voyageur de commerce en programmation par contraintes, I3S, Université Côte d'Azur, Sophia Antipolis, France, November 19, 2021.
- Frédéric Havet :
- Member of PhD committee of Florian Hoersch, Université Grenoble Alpes, September 27, 2021;
- Member of PhD committee of Valentin Bartier, Université Grenoble Alpes, November 29, 2021.
- Joanna Moulierac :
- Member of the PhD committee of Sihem Bakri, Vers l’application du découpage du réseau en 5G, Eurecom, Sophia Antipolis, France, January 28, 2021.
- Michel Syska :
- Member of the jury of the CAPES (certificate of aptitude for secondary school teachers) Numérique et Sciences Informatiques, written tests and oral tests at Université Claude Bernard, Lyon 1, France, June 23-30, 2021.
10.3.1 Internal or external Inria responsibilities
- Frédéric Havet is head of the “Comité Scientifique, Pédagogique et Technique” and member of the executive board of Terra Numerica (see terra-numerica.org/);
- Frédéric Havet is vice-president and member of the scientific committee of the association Institut Esope 21 (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)). See galejade.inria.fr/.
10.3.2 Articles and contents
Many members of Coati are importantly involved in Terra Numerica (see terra-numerica.org/) and participate to the creation of several popularization systems of science popularization : games, activities, on-line resources, ...
We have published a popularization article on optimization problems in telecommunications networks in a special issue on operations research of the science popularization journal Tangente 29.
- Frédéric Havet : Formation de professeurs de collège à la MIA. February 17, 2021;
- Frédéric Havet : Formation de médiateur à la Maison de l'Intelligence Artificielle, April 06, 2021;
- Frédéric Havet and Nicolas Nisse : Formation de médiateur à la Maison de l'Intelligence Artificielle, May 27, 2021;
- Frédéric Havet and Nicolas Nisse : Formation de professeurs des écoles et de collège à la méthode Galejade. November 19, 2021;
- Hicham Lesfari is scientific mediator at Maison de l’Intelligence Artificielle and Terra Numerica.
- Ali Al Zoobi:
- Fête de la science, “machine learning with dogs and cats”, Villeneuve Loubet, October 16-17, 2021;
- Presenting “games on graphs” at the Maison de l'intelligence Artificelle (MIA), Sophia Antipolis, November 18-19, 2021.
- Frédéric Giroire :
- Participation to a Projet pédagogique sur éthique de l’information et des données (Collège Sidney Bechet, Antibes - Terra Numerica). 3 interventions on recommendation algorithms in social networks in the collège Bechet and in the Maison de l'Intelligence Articificielle Sophia, April-May, 2021.
- Frédéric Havet :
- Organization of “Carrefour des sciences”, Institut Esope 21 at Collège de Vinon-sur-Verdon, October 4-8, 2021;
- A dozen of conferences at “Carrefour des sciences”, Collège de Vinon-sur-Verdon, October 4-8, 2021;
- Conference grand public “Vers l'infini et au delà” , Rians, Var, March 26, 2021;
- Conference grand public “Les algorithmes: des origines à l'I.A.” Brignoles, Var, October 6, 2021;
- Conference “Maths et magie” and “L'élégance des mathématiques”, Collège Henri Nans, Aups, October 22, 2021.
- Hicham Lesfari
- Fête de la science, Nice, October 10, 2021.
- Nicolas Nisse :
- Fête de la science, Villeneuve Loubet, October 3, 2021; Nice, October 10, 2021; Antibes-Juan les Pins, October 16-17, 2021;
- Musée des arts concrets, Mouans Sartoux, October 5 and 8, 2021.
11 Scientific production
11.1 Major publications
- 1 articleUnveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems.Molecular and Cellular Proteomics14April 2015, 2274-2284
- 2 inproceedingsFinding a Bounded-Degree Expander Inside a Dense One.Proceedings of the thirty-first Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Salt Lake City, United StatesJanuary 2020
- 3 articleEdge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.Combinatorica392April 2019, 239-263
- 4 articleEfficient Data Collection and Tracking with Flying Drones.Ad Hoc Networks89C2019, 35-46
- 5 articleSubdivisions of oriented cycles in digraphs with large chromatic number.Journal of Graph Theory894April 2018, 439-456
- 6 articleTo Approximate Treewidth, Use Treelength!SIAM Journal on Discrete Mathematics3032016, 13
- 7 articleP-FPT algorithms for bounded clique-width graphs.ACM Transactions on Algorithms153June 2019, 1-57
- 8 inproceedingsDistributed Community Detection via Metastability of the 2-Choices Dynamics.AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial IntelligenceHonolulu, United StatesJanuary 2019
- 9 articleOn the Unavoidability of Oriented Trees.Electronic Notes in Theoretical Computer Science346August 2019, 425-436
- 10 articleOn the Complexity of Compressing Two Dimensional Routing Tables with Order.Algorithmica801January 2018, 209-233
- 11 inproceedingsCapacity of a LoRaWAN Cell.Proceedings of the 23rd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2020)MSWiM '20alicante, SpainAssociation for Computing MachineryNovember 2020, 131--140
- 12 patentBigGraphs: distributed graph computing.IDDN.FR.001.410005.000.S.P.2015.000.31235FranceSeptember 2016
- 13 articleImmersion of transitive tournaments in digraphs with large minimum outdegree.Journal of Combinatorial Theory, Series BMay 2018, 4
- 14 articleMinnie : An SDN world with few compressed forwarding rules.Computer Networks121July 2017, 185-207
- 15 inproceedingsProvably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.IEEE INFOCOM 2018 - IEEE Conference on Computer CommunicationsHonolulu, United StatesIEEEApril 2018
11.2 Publications of the year
International peer-reviewed conferences
National peer-reviewed Conferences
Conferences without proceedings
Scientific book chapters
Edition (books, proceedings, special issue of a journal)
Doctoral dissertations and habilitation theses
Reports & preprints
Other scientific publications
11.4 Cited publications
- 99 articlePreface to special issue on Theory and Applications of Graph Searching.Theoretical Computer Science794November 2019, 1-2
- 100 articleBackbone colouring and algorithms for TDMA scheduling.Discrete Mathematics and Theoretical Computer Science213July 2019, 1-24
- 101 articleEternal domination on 3 ×n grid graphs.Australas. J Comb.612015, 156--174URL: http://ajc.maths.uq.edu.au/pdf/61/ajc_v61_p156.pdf
- 102 bookForewords: Special issue on Theory and Applications of Graph Searching Problems.655Part AElsevierDecember 2016
- 103 articleEternally dominating large grids.Theor. Comput. Sci.7942019, 27--46URL: https://doi.org/10.1016/j.tcs.2018.09.008
- 104 inproceedingsPhase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions.SIROCCO 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