Research themes

The research of the team Theory and Algorithms of Graphs are concerned with structural properties of graphs, and the conception of efficient algorithms for these structures.

More specifically, the team has a strong expertise on the structural properties of hereditary classes of graphs (with respect to the partial order of induced subgraphs as well as minor or homomorphism). A frequent approach for these questions is to look for so-called decomposition theorems for such classes. In this setting, it is relevant to find efficient algorithms for such decompositions, to get good recognition algorithms but also to get polynomial algorithms for problems that would be in general NP-Hard. Another topic the team is strongly attached to is the notion of graph colouring. More recently, the team has been involved in projects related to applications of graph algorithms to biology and biochemistry, and also to the topic of Graphs Limits (and limits of strucutres in general).

The domains of applications of the team researchs are mainly related to the conception of new protocols for P2P networks and the analysis of various type of social networks (web graph, small world graphs, etc.). Several members of the team are thus members of INRIA project GANG whose objective is to develop algorithmic methods for the conception and the control of large scale networks.


Permanent members

Chapuy Guillaume @ 01 57 27 94 04 4012 Senior Research Scientist - CNRS ASD combi , graphes
Charbit Pierre @ 01 57 27 94 07 4032 Associate Professor ASD gang , graphes
De Montgolfier Fabien @ 01 57 27 92 21 4029a Associate Professor ASD gang , graphes , distribue
Habib Michel @ 01 57 27 94 42 3042a Professor Emeritus ASD gang , graphes , distribue
Mitsou Valia @ 01 57 27 92 21 4029a Associate Professor ASD graphes
Naserasr Reza @ 01 57 27 94 07 4032 Research Scientist - CNRS ASD graphes
Ravelomanana Vlady @ 01 57 27 94 44 3025 Professor ASD combi , graphes
Viennot Laurent @ 01 57 27 92 50 3016 Senior Research Scientist - INRIA ASD gang , graphes , distribue

Non-permanent permanents