On the public citation graph
Perfect zero–one matrices
0 signed · 233 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0095-8956(72)90045-7openalex-snapshot
A characterization of perfect graphs
inferredcites →https://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/b978-0-12-358350-5.50006-3openalex-snapshot
On the Perfect Graph Theorem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199609)23:1<77::aid-jgt9>3.0.co;2-hopenalex-snapshot
The connectivity of minimal imperfect graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199909)32:1<73::aid-jgt7>3.0.co;2-7openalex-snapshot
Berge graphs with chordless cycles of bounded length
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199909)32:1<73::aid-jgt7>3.3.co;2-zopenalex-snapshot
Berge graphs with chordless cycles of bounded length
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<394::aid-jgt7>3.0.co;2-zopenalex-snapshot
On critically perfect graphs
inferred← citeshttps://doi.org/10.1002/1520-6750(199404)41:3<395::aid-nav3220410307>3.0.co;2-wopenalex-snapshot
Order-preserving assignments
inferred← citeshttps://doi.org/10.1002/jgt.10067openalex-snapshot
Recursive generation of partitionable graphs
inferred← citeshttps://doi.org/10.1002/jgt.20164openalex-snapshot
On the circular chromatic number of circular partitionable graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190110415openalex-snapshot
Ki‐covers. II. Ki‐perfect graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190170108openalex-snapshot
Perfect k‐line graphs and k‐total graphs
inferred← citeshttps://doi.org/10.1002/net.3230170402openalex-snapshot
An algorithmic framework for the matching problem in some hypergraphs
inferred← citeshttps://doi.org/10.1006/eujc.2002.0565openalex-snapshot
Elementary Bipartite Graphs and Unique Colourability
inferred← citeshttps://doi.org/10.1006/eujc.2002.0592openalex-snapshot
On the Laplacian Spectrum of (α, ω) -Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1995.1021openalex-snapshot
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1006/jctb.1996.0034openalex-snapshot
On Critical Edges in Minimal Imperfect Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2001.2044openalex-snapshot
About Skew Partitions in Minimal Imperfect Graphs
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_459openalex-snapshot
Set Covering, Packing and Partitioning Problems
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_29openalex-snapshot
Critical and Anticritical Edges in Perfect Graphs
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_23openalex-snapshot
The Optimal Cost Chromatic Partition problem for trees and interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_4openalex-snapshot
Characterizing Noninteger Polyhedra with 0–1 Constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_599openalex-snapshot
Set Covering, Packing and Partitioning Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_129openalex-snapshot
Integer and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-9188-7_26openalex-snapshot
A Solution for the Optimal Multiple Rectangle Search
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_599-1openalex-snapshot
Set Covering, Packing, and Partitioning Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_8openalex-snapshot
Complementation in T-perfect Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-5936-3_10openalex-snapshot
Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_10openalex-snapshot
Die Zwiebelstrukturen Einiger Klassen von Kombinatorischen und Graphentheoretischen Problemen
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_34openalex-snapshot
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_29openalex-snapshot
Characterizations of Total Dual Integrality
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_8openalex-snapshot
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8openalex-snapshot
Facets of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_2openalex-snapshot
Facets and Rank of Integer Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_6openalex-snapshot
Beyond Perfection: Computational Results for Superclasses
inferred← citeshttps://doi.org/10.1007/978-3-642-46631-1_15openalex-snapshot
On Inverse-Image of Non-Oriented Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-85966-3_9openalex-snapshot
Aspects of Bus Crew Scheduling Using a Set Partitioning Model
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-3-642-99747-1_7openalex-snapshot
Perfect Zero-One Matrices — II
inferred← citeshttps://doi.org/10.1007/978-3-662-12273-0_10openalex-snapshot
Combinatorial Optimization: An Introduction
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_14openalex-snapshot
Characterisations of Totally Unimodular, Balanced and Perfect Matrices
inferred← citeshttps://doi.org/10.1007/bf01581045openalex-snapshot
Polynomially bounded algorithms for locatingp-centers on a tree
inferred← citeshttps://doi.org/10.1007/bf01581189openalex-snapshot
Properties of balanced and perfect matrices
inferred← citeshttps://doi.org/10.1007/bf01582135openalex-snapshot
Testing balancedness and perfection of linear matrices
inferred← citeshttps://doi.org/10.1007/bf01588246openalex-snapshot
On perfect graphs and polyhedra with (0, 1)-valued extreme points
inferred← citeshttps://doi.org/10.1007/bf01589107openalex-snapshot
Odd cycles and matrices with integrality properties
inferred← citeshttps://doi.org/10.1007/bf01590960openalex-snapshot
Applying Lehman's theorems to packing problems
inferred← citeshttps://doi.org/10.1007/bf01844846openalex-snapshot
Minimal imperfect graphs: A simple approach
inferred← citeshttps://doi.org/10.1007/bf02186368openalex-snapshot
Generalized resolution and cutting planes
inferred← citeshttps://doi.org/10.1007/bf02986662openalex-snapshot
Perfect graphs with noP 5 and noK 5
inferred← citeshttps://doi.org/10.1007/bf02986675openalex-snapshot
Slightly triangulated graphs are perfect
inferred← citeshttps://doi.org/10.1007/bf03353015openalex-snapshot
Chair-Free Berge Graphs Are Perfect
inferred← citeshttps://doi.org/10.1007/bfb0083468openalex-snapshot
(K4-e)-free perfect graphs and star cutsets
inferred← citeshttps://doi.org/10.1007/bfb0120894openalex-snapshot
Balanced matrices and property (G)
inferred← citeshttps://doi.org/10.1007/bfb0121053openalex-snapshot
Classes of linear programs with integral optimal solutions
inferred← citeshttps://doi.org/10.1007/s00186-018-0650-4openalex-snapshot
On f-domination: polyhedral and algorithmic results
inferred← citeshttps://doi.org/10.1007/s001860200203openalex-snapshot
Rank-perfect and" weakly rank-perfect graphs
inferred← citeshttps://doi.org/10.1007/s00373-024-02817-1openalex-snapshot
The Robust Chromatic Number of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-003-0022-3openalex-snapshot
Imperfect and Nonideal Clutters: A Common Approach
inferred← citeshttps://doi.org/10.1007/s004930200001openalex-snapshot
Perfect Graphs, Partitionable Graphs and Cutsets
inferred← citeshttps://doi.org/10.1007/s10107-005-0655-7openalex-snapshot
Almost all webs are not rank-perfect
inferred← citeshttps://doi.org/10.1007/s10107-010-0383-5openalex-snapshot
Alternatives for testing total dual integrality
inferred← citeshttps://doi.org/10.1007/s10107-012-0512-4openalex-snapshot
Computing clique and chromatic number of circular-perfect graphs in polynomial time
inferred← citeshttps://doi.org/10.1007/s10801-014-0514-9openalex-snapshot
On circulant thin Lehman matrices
inferred← citeshttps://doi.org/10.1007/s10878-005-4104-6openalex-snapshot
Efficient Solutions for Special Zero-One Programming Problems
inferred← citeshttps://doi.org/10.1007/s10878-024-01252-5openalex-snapshot
Recognizing integrality of weighted rectangles partitions
inferred← citeshttps://doi.org/10.1007/s11425-010-4112-6openalex-snapshot
A class of polynomially solvable 0–1 programming problems and an application
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90077-1openalex-snapshot
A class of facet producing graphs for vertex packing polyhedra
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90041-8openalex-snapshot
A note on the total unimodularity of matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90053-xopenalex-snapshot
Classification de certaines matrices 0–1
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90065-7openalex-snapshot
Graphical properties related to minimal imperfection
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90114-6openalex-snapshot
Combinatorial designs related to the strong perfect graph conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90296-5openalex-snapshot
A classification of certain graphs with minimal imperfection properties
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90005-5openalex-snapshot
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90059-6openalex-snapshot
Uniquely colorable perfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90019-0openalex-snapshot
On circular critical graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90248-gopenalex-snapshot
Wings and perfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90623-nopenalex-snapshot
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90178-vopenalex-snapshot
Lehman's forbidden minor characterization of ideal 0–1 matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90373-5openalex-snapshot
New classes of Berge perfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00096-fopenalex-snapshot
Perfect graphs are kernel solvable
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00156-qopenalex-snapshot
Some properties of minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00325-qopenalex-snapshot
Order preserving assignments without contiguity
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90017-popenalex-snapshot
On a graph partition problem with application to VLSI layout
inferred← citeshttps://doi.org/10.1016/0024-3795(76)90079-3openalex-snapshot
Almost integral polyhedra related to certain combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90058-7openalex-snapshot
Local unimodularity of matrix-vector pairs
inferred← citeshttps://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90005-8openalex-snapshot
On the strong perfect graph conjecture
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90064-8openalex-snapshot
Critical perfect graphs and perfect 3-chromatic graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90033-2openalex-snapshot
On stable set polyhedra for K1,3-free graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90092-7openalex-snapshot
The strong perfect graph conjecture for toroifal graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90068-5openalex-snapshot
Meyniel graphs are strongly perfect
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90060-1openalex-snapshot
A family of perfect graphs associated with directed graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90019-0openalex-snapshot
A reduction procedure for coloring perfect K4-free graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90071-8openalex-snapshot
No antitwins in minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90010-uopenalex-snapshot
On a conjecture of berge
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00066-mopenalex-snapshot
Generalized perfect graphs: Characterizations and inversion
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00069-popenalex-snapshot
Directed Moore hypergraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00153-5openalex-snapshot
A min-max relation for K3-covers in graphs noncontractible to K5e
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90047-7openalex-snapshot
A note on clutter partitions
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90233-0openalex-snapshot
On the integer properties of scheduling set partitioning models
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50012-xopenalex-snapshot
Notes on Perfect Graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-682150-5.50014-3openalex-snapshot
References††The first comprehensive references list is due to Balinski and Spielberg (1969). A later list appears in the work of Garfinkel and Nemhauser (1972b).
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.cor.2009.03.023openalex-snapshot
The train driver recovery problem—A set partitioning based model and solution method
inferred← citeshttps://doi.org/10.1016/j.cor.2009.03.024openalex-snapshot
An iterative approach to robust and integrated aircraft routing and crew scheduling
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.042openalex-snapshot
On non-rank facets of stable set polytopes of webs with clique number four
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.027openalex-snapshot
On a certain class of nonideal clutters
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.045openalex-snapshot
On classes of minimal circular-imperfect graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.035openalex-snapshot
An extension of Lehman’s theorem and ideal set functions
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.001openalex-snapshot
Lift-and-project ranks of the stable set polytope of joined a -perfect graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.040openalex-snapshot
Grinstead's conjecture is true for graphs with a small clique number
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.041openalex-snapshot
A Berge-keeping operation for graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.068openalex-snapshot
The stable set polytope for some extensions of P4 -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.024openalex-snapshot
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.05.004openalex-snapshot
On the mixed set covering, packing and partitioning polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.07.001openalex-snapshot
The strength of Dantzig–Wolfe reformulations for the stable set and related problems
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.06.013openalex-snapshot
A construction for non-rank facets of stable set polytopes of webs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.025openalex-snapshot
Computing the clique number of a -perfect graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103224openalex-snapshot
On circular-perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.045openalex-snapshot
Packing and covering with linear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.049openalex-snapshot
On cliques associated to 3-set packing problems
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.004openalex-snapshot
On a certain class of nonideal clutters
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.071openalex-snapshot
On determining the imperfection ratio
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.024openalex-snapshot
On the Chvátal-rank of Antiwebs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.10.018openalex-snapshot
Computing the clique number of a-perfect graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.laa.2011.02.047openalex-snapshot
Thin Lehman matrices arising from finite groups
inferred← citeshttps://doi.org/10.1016/j.orl.2014.08.005openalex-snapshot
On a connection between facility location and perfect graphs
inferred← citeshttps://doi.org/10.1016/j.trc.2026.105723openalex-snapshot
A bi-objective tramp ship routing and scheduling problem to accelerate shipping sustainability transition
inferred← citeshttps://doi.org/10.1016/j.tre.2010.11.016openalex-snapshot
Models for the discrete berth allocation problem: A computational comparison
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104019openalex-snapshot
A rich model for the tramp ship routing and scheduling problem—Solved through column generation
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00755-0openalex-snapshot
Partitionable graphs arising from near-factorizations of finite groups
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00293-0openalex-snapshot
Cayley partitionable graphs and near-factorizations of finite groups
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00178-1openalex-snapshot
On transversals in minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00188-4openalex-snapshot
Perfect graphs with unique P4-structure
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00353-6openalex-snapshot
On a conjecture about uniquely colorable perfect graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81823-7openalex-snapshot
On essential components and critical sets of a graph
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00669-9openalex-snapshot
An approach to solving Ak=J−I
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00773-2openalex-snapshot
Perfect 0, ± 1 matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00012-8openalex-snapshot
On minimal imperfect graphs without induced P5
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00029-3openalex-snapshot
P4-domination in minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70068-2openalex-snapshot
Conjuncturally Stable Coalition Structures
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70725-8openalex-snapshot
Some Valid Inequalities for the Set Partitioning Problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70750-7openalex-snapshot
On the Complexity of Set Packing Polyhedra
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70819-7openalex-snapshot
The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70823-9openalex-snapshot
Blocking and Antiblocking Polyhedra
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70831-8openalex-snapshot
Covering, Packing and Knapsack Problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72811-1openalex-snapshot
Recent Results on The Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72918-9openalex-snapshot
Minimax Theorems for Normal Hypergraphs and Balanced Hypergraphs — A Survey
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72925-6openalex-snapshot
The Perfect Graph Conjecture for Toroidal Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72926-8openalex-snapshot
The Perfect Graph Conjecture on Special Graphs — A Survey
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72930-xopenalex-snapshot
The Validity of the Perfect Graph Conjecture for K4-Free Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72931-1openalex-snapshot
The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72932-3openalex-snapshot
A Characterization of Perfect Matrices
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72933-5openalex-snapshot
Graphical Properties Related to Minimal Imperfection
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72935-9openalex-snapshot
Combinatorial Designs Related to the Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72936-0openalex-snapshot
A Classification of Certain Graphs with Minimal Imperfection Properties
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00201-7openalex-snapshot
Forced color classes, intersection graphs and the strong perfect graph conjecture
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00203-0openalex-snapshot
Perfect (0,±1)-matrices and perfect bidirected graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00056-4openalex-snapshot
Perfect, ideal and balanced matrices
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)91259-2openalex-snapshot
Integer and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00446-9openalex-snapshot
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four–Extended Abstract–
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80179-9openalex-snapshot
Cayley partitionable graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511619748.009openalex-snapshot
Integer/Combinatorial Optimization
inferred← citeshttps://doi.org/10.1051/matecconf/201713703013openalex-snapshot
Optimal production size with partially inspected batches
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1080/00029890.1977.11994487openalex-snapshot
Monthly Research Problems 1969-77
inferred← citeshttps://doi.org/10.1103/physreva.88.032104openalex-snapshot
Basic exclusivity graphs in quantum correlations
inferred← citeshttps://doi.org/10.1109/tac.2022.3161876openalex-snapshot
A Structure-Tensor Approach to Integer Matrix Completion in Indivisible Resource Allocation
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2009.00744.xopenalex-snapshot
On the Chvátal rank of linear relaxations of the stable set polytope
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32832.xopenalex-snapshot
BERGE'S STRONG PERFECT GRAPH CONJECTURE
inferred← citeshttps://doi.org/10.1137/0604036openalex-snapshot
A Class of Balanced Matrices Arising from Location Problems
inferred← citeshttps://doi.org/10.1137/1.9780898718805.ch5openalex-snapshot
5. The Clique-Rank of 3-Chromatic Perfect Graphs
inferred← citeshttps://doi.org/10.1137/1.9780898719796.ch14openalex-snapshot
14. The Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1137/151006111openalex-snapshot
Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time
inferred← citeshttps://doi.org/10.1137/22m1530410openalex-snapshot
A Sum of Squares Characterization of Perfect Graphs
inferred← citeshttps://doi.org/10.1137/s0895480197329089openalex-snapshot
Recognizing Perfect 2-Split Graphs
inferred← citeshttps://doi.org/10.1142/s0219622003000495openalex-snapshot
COMBINATORIAL AUCTIONS MATHEMATICAL FORMULATIONS AND OPEN ISSUES
showing the first 200 of 224 · page through all 224
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.