**Permanent staff:**

* Denise Amar

Hamiltonian graphs

* Olivier Baudon

Graph partitioning, graph decomposing, graph colorings

* Olivier Beaumont

Scheduling, ressource allocation, parallel algorithms, combinatorial optimization

* Marthe Bonamy

Graph colorings, structural graph theory, graph algorithms

* Nicolas Bonichon

Maps, Bijective Combinatorics, geometric graphs

* Arnaud Casteigts

Dynamic graphs, temporal graphs

* Olivier Delmas

Graph algorithms, graph theory, applications, communications in the interconnection networks

* Philippe Duchon

Exact and asymptotic enumeration, Random generation

* Lionel Eyraud-Dubois

Parallel computing, scheduling algorithms, combinatorial optimization

* Cyril Gavoille

Distributed computing, graph algorithms (distributed or not), compact routing, distance labeling, distance oracles, spanners, graph minor theory, small-world, quantum information

* Nicolas Hanusse

Distributed computing, dynamic networks, compact routing, graph exploration, visualization, data mining

* Hervé Hocquard

Edge and vertex colorings of graphs

* David Ilcinkas

Distributed computing, Mobile agent computing

* František Kardoš

Graph coloring, Chemical graph theory

* Ralf Klasing

Distributed algorithms, Approximation algorithms for combinatorially hard problems, Algorithmic methods for telecommunication, Communication algorithms in networks

* Frédéric Mazoit

Graph decompositions, graphs on surfaces, graph minor theory

* Arnaud Pêcher

Graph theory: graph colorings, polyhedral graph theory, perfect graph theory, algebraic graph theory mathematical programming : mixed integer linear programming, semi-definite programming

* André Raspaud

Vertex colorings of graphs. Edge colorings of graphs (strong, star, incidence). Flow. Cycle cover. Coloring of signed graphs. Flows in signed graphs

* Mike Robson

Distributed algorithms, randomized algorithms, graph algorithms

* Éric Sopena

Graph colorings and homomorphisms (oriented graphs, signed graphs, graph coloring games...) and combinatorial games

**Non permanent staff:**

* Alexandre Blanché (PhD student)

Graph theory, graph decompositions

* Florent Foucaud (postdoc)

Identification in (hyper)graphs, Graph domination, Graph homomorphisms and colourings, Signed graphs, Graph algorithms (classical, approximation, parameterized)

* Dimitri Lajou (PhD student)

Signed graphs homomorphisms

* Jonathan Narboni(PhD student)

Colorings and structural properties of graphs

* Paul Ouvrard (PhD student)

Graph theory, reconfiguration

* Théo Pierron (PhD)

Colorings, graph morphisms, algorithms