A generalization of antiwebs to independence systems and their canonical facets

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics

Rank inequalities and separation algorithms for packing designs and sparse triple systems

Theoretical Computer Science - Latin American theoretical informatics

Strong formulation for the spot 5 daily photograph scheduling problem

Journal of Combinatorial Optimization

Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

Discrete Optimization

Minimum partition of an independence system into independent sets

Discrete Optimization