The research groups of the Department cover a comprehensive range of research topics related to the study of algorithms, ranging from algorithmic modeling through algorithm design and analysis. Some of the research questions addressed by the Department include:

• Foundations of Algorithms and Data Structures
• New challenges arising from emerging technologies, as well as challenges related to big data processing, both centralized and distributed
• Applying algorithmic thinking and combinatorial tools to expand research horizons in other disciplines of science, extending beyond their use for processing scientific data, to gain a better understanding of these disciplines

The Department's groups interact closely with each other in three major areas of common interest: algorithms, probabilities, and graphs. Some topics include random graphs, complex networks and other complex biological systems, efficient algorithms, distributed algorithms, structural properties of networks and graph algorithms.

Close research ties are also maintained with the two other Departments of the Institute in several lines of research, with collaboration in the following subject areas: algebraic rewriting and combinatorics, algorithms for databases, complex biological systems, verification of distributed systems, combinatorics on words and symbolic dynamics.

The scientific objectives of the Department focus on the design, optimization, and analysis of algorithms, calling for deep insights into the combinatorial structures involved in these algorithms. Our research involves not only fundamental challenges of theoretical computer science, but also those arising from real applications (networks, databases) and from interactions with other sciences (mathematics, physics, and biology).

Representative examples of projects carried out in the Department include:

• Quantum Computing (PCQC Federation, ERC project QCC)
• Combinatorics of maps and their interactions (Emergences Project, ERC CombiTop)
• Complex biological systems (ERC DBA)
• Algorithms for Networks (Inria GANG Project)
• Formal methods for the design of distributed algorithms (ANR FREDDA)
• Homomorphisms of signed graphs (ANR HOSIGRA)

• Seminars
  • Algorithms and complexity
  • Algorithms and discrete structures
  • Enumerative and analytic combinatorics
  • Graphs and distributed computing
• Meetings Algorithms and discrete structures