, Stable Set Polytopes for a Class of Circulant Graphs, SIAM Journal on Optimization, vol.9, issue.2, pp.493-503, 1999.
DOI : 10.1137/S1052623497321973
, Facets of 1-Matching Polyhedra, Hypergraph Seminar, pp.214-242, 1974.
, The Rank Facets of the Stable Set Polytope for Claw-Free Graphs, Journal of Combinatorial Theory, Series B, vol.69, issue.1, pp.1-38, 1997.
DOI : 10.1006/jctb.1996.1715
, On Stable Set Polyhedra for K 1,3 -free Graphs, J. Combin. Theory B, pp.31-313, 1981.
, Geometric Algorithms and Combinatorial Optimization, 1988.
, Mobilitätsmodelle für zellulare Mobilfunknetze: Produktformen und Blockierung, 2000.
, On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs, Mathematical Methods of Operations Research (ZOR), vol.59, issue.1, pp.25-35, 2004.
DOI : 10.1007/s001860300317
, Clique family inequalities for the stable set polytope of quasi-line graphs, Discrete Applied Mathematics, vol.132, issue.1-3, pp.185-201, 2004.
DOI : 10.1016/S0166-218X(03)00400-1
, Perfect zero???one matrices, Mathematical Programming, vol.5, issue.1, pp.180-196, 1974.
DOI : 10.1007/BF01580235
URL : https://hal.archives-ouvertes.fr/inria-00076517
, Near-perfect matrices, Mathematical Programming, vol.23, issue.1-3, pp.295-323, 1994.
DOI : 10.1007/BF01582578
, A class of facet producing graphs for vertex packing polyhedra, Discrete Mathematics, vol.12, issue.4, pp.373-388, 1975.
DOI : 10.1016/0012-365X(75)90077-1
, Rank-perfect and" weakly rank-perfect graphs, Mathematical Methods of Operations Research (ZOR), vol.56, issue.1, pp.127-149, 2002.
DOI : 10.1007/s001860200203
, Relaxing Perfectness: Which Graphs are " Almost " Perfect? In: The Sharpest Cut ? The Impact of Manfred Padberg and His Work, MPS/SIAM series on Optimization, pp.77-96, 2004.