Personal tools
Laboratoire d'InfoRmatique en Image et Systèmes d'information

Skip to content. | Skip to navigation

Laboratoire d'InfoRmatique en Image et Systèmes d'information
UMR 5205 CNRS / INSA Lyon / Université Claude Bernard Lyon 1 / Université Lumière Lyon 2 / École Centrale de Lyon
You are here: Home > membres

Valentin Gledel


PhD student

Team Graphes, AlgOrithmes et AppLications
Institution Claude Bernard University of Lyon 1
Location Nautibus (Université Lyon1)
E-mail valentin.gledel at
Contact details Publications Thesis
Subject Study of domination problems in graphs
Abstract This PhD concerns the domination problem in graphs. It consists in selecting a set S of vertices of a graph such that all vertices are either in S or adjacent to a vertex of S. This problem is well known and numerous variants have been introduced, for which several problems remain open today. The objective of this PhD is to deepen or solve some of these variants.
This PhD is composed of two parts. The first one consist of the study of variants of the domination problem that might be linked to real world’s issues. Such problems can often be linked to surveillance issues and are either more constraint variants of the domination problem or variants in which the rules of domination change.
The second part deal with two players domination games on graphs. The players can either have the same goal (i.e. pure combinatorial games), or opposite goals (i.e. maker-breaker games).
Advisor Eric Duchene
Advisor Aline Parreau

Last update : 2018-01-16 13:50:28