Clique family inequalities for the stable set polytope of quasi-line graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the commutativity of antiblocker diagrams under lift-and-project operators
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On a certain class of nonideal clutters
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On classes of minimal circular-imperfect graphs
Discrete Applied Mathematics
Note: A note on kernels and Sperner's Lemma
Discrete Applied Mathematics
On packing and covering polyhedra of consecutive ones circulant clutters
Discrete Applied Mathematics
$t$-Perfection Is Always Strong for Claw-Free Graphs
SIAM Journal on Discrete Mathematics
Circular-perfect concave-round graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Computing the clique number of a-perfect graphs in polynomial time
European Journal of Combinatorics
Discrete Applied Mathematics
Hi-index | 0.00 |