Membres
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
* Vincent Delecroix
Surfaces, random graphs
* Olivier Delmas
Graph algorithms, graph theory, applications, communications in the interconnection networks
* François Dross
Graph partitions, structural graph theory, graph algorithms
* 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é (ATER)
Graph theory, graph decompositions
* Timothée Corsini (PhD student)
Temporal graphs
* Claire Hilaire (PhD student)
Graph labellings
* Dimitri Lajou (ATER)
Signed graphs homomorphisms
* Clément Legrand-Duchesne (PhD student)
Graph recolouring
* Pierre-Marie Marcille (PhD student)
Edge labeling
* Jonathan Narboni(PhD student)
Colorings and structural properties of graphs
* Paul Ouvrard (ATER)
Graph theory, reconfiguration
* Ivan Yakovlev (PhD student)
Counting surfaces