, On the set covering polyhedron of circulant matrices, Discrete Optimization, vol.6, pp.162-173, 2009.
, Polyhedra associated with identifying codes, vol.44, pp.175-180, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02047315
Wagler: Study of identifying code polyhedra for some families of split graphs, Lecture Notes in Computer Science, vol.8596, pp.13-25, 2014. ,
Identifying code polyhedra for families of split graphs, Proc. of ICGT, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-02045768
, On identifying code polyhedra of families of suns, VIII ALIO/EURO Workshop on Applied Combinatorial Optimization, 2014.
On the set covering polyhedron of q-roses, VI ALIO/EURO Workshop on Applied Combinatorial Optimization, 2008. ,
Minimal identifying codes in trees and planar graphs with large girth, European Journal of Combinatorics, vol.31, pp.1372-1384, 2010. ,
On the set covering polytope: I. All the facets with coefficients in {0,1,2}, Mathematical Programming 43, pp.57-69, 1989. ,
Identifying codes and the set cover problem, Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing, 2006. ,
Identifying and locating dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, pp.969-987, 2004. ,
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, pp.2109-2120, 2003. ,
, Combinatorial Optimization: Packing and Covering, SIAM, CBMS 74, 2001.
The complexity of the identifying code problem in restricted graph classes, Combinatorial Algorithms-Proceedings of IWOCA 2013, vol.8288, pp.150-163, 2013. ,
Identifying codes in line graphs, Journal of Graph Theory, vol.73, pp.425-448, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00605406
, Graph Theory and its Applications, pp.93-112, 1970.
Location with dominating sets, Congressus Numerantium, vol.151, pp.129-144, 2001. ,
On graphs having a V {x}-set as an identifying code, Discrete Mathematics, vol.307, pp.432-434, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00182314
Identifying codes of cycles, European Journal of Combinatorics, vol.27, pp.767-776, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00360168
On a new class of codes for identifying nodes in graphs, IEEE Transactions on Information Theory, vol.44, pp.599-611, 1998. ,
Facets and lifting procedures for the set covering polytope, Mathematical Programming, vol.45, pp.111-137, 1989. ,
On the facial structure of the set covering polytope, Mathematical Programming, vol.44, pp.181-202, 1989. ,