The facets and the symmetries of the approval-voting polytope
Journal of Combinatorial Theory Series B
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality"
Discrete Applied Mathematics - Special issue: Max-algebra
A Min-Max Relation on Packing Feedback Vertex Sets
Mathematics of Operations Research
Fractional packing in ideal clutters
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
The nonidealness index of rank-ideal matrices
Discrete Applied Mathematics
Design of network topology in an adversarial environment
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
Note: Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Discrete Applied Mathematics
Packing cycles exactly in polynomial time
Journal of Combinatorial Optimization
A superclass of Edge-Path-Tree graphs with few cliques
Operations Research Letters
Recognition algorithms for binary signed-graphic matroids
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Mengerian quasi-graphical families and clutters
European Journal of Combinatorics
On asteroidal sets in chordal graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Combinatorial Optimization: Packing and Covering presents new and elegant proofs of classical results for the integer programming models known as set packing and covering and makes difficult results accessible.