-
A new lower bound on the independence number of graphs
International audience -
Exact and approximation methods by clique partition of graphs
This thesis takes place in the project ToDo 2 funded by the french National Research Agency. We deal with the resolution of two graph problems, by exact and... -
Beyond the worst case evaluation: Comparison and average evaluation of optimi...
The complexity theory distinguishes between problems that are known to be solved in polynomial time in the size of the data ( which can be described as reasonable ) ,... -
Coloring and Guarding Arrangements
Combinatorics
