Near-perfect matrices
Data up to Jan 2025
Total Citations Per Year
Abstract
References (22)
Graph Theory with Applications
1976 • 8,904 citations
Theory of Linear and Integer Programming
2000 • 5,990 citations
Theory of Linear and Integer Programming.
1987 • 2,206 citations
The ellipsoid method and its consequences in combinatorial optimization
1981 • 2,062 citations
Normal hypergraphs and the perfect graph conjecture
1972 • 775 citations
On certain polytopes associated with graphs
1975 • 620 citations
On the facial structure of set packing polyhedra
1973 • 588 citations
Annals of Discrete Mathematics
1982 • 505 citations
A characterization of perfect graphs
1972 • 356 citations
Perfect zero–one matrices
1974 • 241 citations
Graph theory and applications
1989 • 232 citations
Polyhedral Combinatorics
1991 • 208 citations
Integer Rounding for Polymatroid and Branching Optimization Problems
1981 • 86 citations
Critical perfect graphs and perfect 3-chromatic graphs
1977 • 69 citations
Graphical properties related to minimal imperfection
1979 • 68 citations
On the Perfect Graph Theorem
1973 • 52 citations
On the strong perfect graph conjecture
1976 • 48 citations
Almost integral polyhedra related to certain combinatorial optimization problems
1976 • 47 citations
Combinatorial designs related to the strong perfect graph conjecture
1979 • 45 citations
Polyhedral and algorithmic ramifications of antichains
1982 • 29 citations
Polyhedra for Composed Independence Systems
1982 • 11 citations
An Equivalent Version of the Strong Perfect Graph Conjecture
1984 • 7 citations