On the public citation graph
On balanced matrices
0 signed · 120 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/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/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/nav.22146openalex-snapshot
Optimal design of line replaceable units
inferred← citeshttps://doi.org/10.1006/jctb.1999.1932openalex-snapshot
Decomposition of Balanced Matrices
inferred← citeshttps://doi.org/10.1006/jctb.2000.2010openalex-snapshot
Balanced 0, ±1 Matrices I. Decomposition
inferred← citeshttps://doi.org/10.1007/0-387-23639-2_2openalex-snapshot
(Generalized) Convexity and Discrete Optimization
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_15openalex-snapshot
Circuit Mengerian Directed Graphs
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-3-030-51117-3_10openalex-snapshot
Fractional Dominating Parameters
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_23openalex-snapshot
Decomposing Probability Marginals Beyond Affine Requirements
inferred← citeshttps://doi.org/10.1007/978-3-031-60924-4_2openalex-snapshot
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_16openalex-snapshot
On Complexities of Minus Domination
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_12openalex-snapshot
Fifty-Plus Years of Combinatorial Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_52openalex-snapshot
Core Stability of Vertex Cover Games
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf01261318openalex-snapshot
Perfect matchings in balanced hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01581196openalex-snapshot
Structural properties and decomposition of linear balanced matrices
inferred← citeshttps://doi.org/10.1007/bf01582277openalex-snapshot
On the 0, 1 facets of the set covering polytope
inferred← citeshttps://doi.org/10.1007/bf01590956openalex-snapshot
Balanced 0, ±1-matrices, bicoloring and total dual integrality
inferred← citeshttps://doi.org/10.1007/bf02592142openalex-snapshot
Resolution and the integrality of satisfiability problems
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/s004930200020openalex-snapshot
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach
inferred← citeshttps://doi.org/10.1007/s00574-022-00323-7openalex-snapshot
On the Equality of Symbolic and Ordinary Powers of Binomial Edge Ideals
inferred← citeshttps://doi.org/10.1007/s10107-005-0647-7openalex-snapshot
Recognizing Balanceable Matrices
inferred← citeshttps://doi.org/10.1007/s10801-018-0831-5openalex-snapshot
Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
inferred← citeshttps://doi.org/10.1007/s10878-015-9887-5openalex-snapshot
A note on the duality between matchings and vertex covers in balanced hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01252-5openalex-snapshot
Recognizing integrality of weighted rectangles partitions
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90067-0openalex-snapshot
Total weak unimodularity: testing and applications
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90193-3openalex-snapshot
Minimax relations for the partial q- colorings of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90194-5openalex-snapshot
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00578-fopenalex-snapshot
Balanced matrices with row sum 3
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90058-7openalex-snapshot
Local unimodularity of matrix-vector pairs
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90183-4openalex-snapshot
Complement total unimodularity
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90028-4openalex-snapshot
Alpha-balanced graphs and matrices and GF(3)-representability of matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90045-yopenalex-snapshot
A decomposition theory for matroids. VII. Analysis of minimal violation matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90061-1openalex-snapshot
Domination, independent domination, and duality in strongly chordal graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90125-4openalex-snapshot
A note on odd/even cycles
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00055-vopenalex-snapshot
Restrictions and preassignments in preemptive open shop scheduling
inferred← citeshttps://doi.org/10.1016/0167-6377(84)90029-4openalex-snapshot
On the integrality of an extreme solution to pluperfect graph and balanced systems
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90050-8openalex-snapshot
Recognizing max-flow min-cut path matrices
inferred← citeshttps://doi.org/10.1016/0167-6377(94)00047-aopenalex-snapshot
Reliability, covering and balanced matrices
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90028-2openalex-snapshot
Characterizations of totally balanced matrices
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/0377-2217(94)90334-4openalex-snapshot
An exact algorithm for multiple depot bus scheduling
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50024-9openalex-snapshot
Convexity and Discrete Optimization
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50009-9openalex-snapshot
10.1016/b978-044488002-4/50009-9
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.001openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.021openalex-snapshot
Broadcast domination and multipacking in strongly chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.019openalex-snapshot
On some graph classes related to perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.049openalex-snapshot
Minimum fractional dominating functions and maximum fractional packing functions
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.002openalex-snapshot
Balanced Cayley graphs and balanced planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.005openalex-snapshot
Perfect f -matchings and f -factors in hypergraphs—A combinatorial approach
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.04.002openalex-snapshot
On complexities of minus domination
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.2019.01.002openalex-snapshot
Star partitions on graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.008openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.142openalex-snapshot
Balancedness of some subclasses of circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.02.006openalex-snapshot
A polynomial recognition algorithm for balanced matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2015.08.001openalex-snapshot
A characterization of oriented hypergraphic balance via signed weak walks
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.236openalex-snapshot
Characterization of balanced graphs within claw-free graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00164-1openalex-snapshot
One-node cutsets and the dominating set polytope
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00208-7openalex-snapshot
Restricted coloring models for timetabling
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00019-2openalex-snapshot
Maximum h-colourable subgraph problem in balanced graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70293-0openalex-snapshot
Minimax Relations for the Partial q- Colorings of a Graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70294-2openalex-snapshot
A Min-Max Relation for the Partial q-Colourings of a Graph. Part II: Box Perfection
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)70831-8openalex-snapshot
Covering, Packing and Knapsack Problems
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/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1023/a:1021363810398openalex-snapshot
On Clique-Transversals and Clique-Independent Sets
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1080/00927872.2022.2042546openalex-snapshot
Classes of normally and nearly normally torsion-free monomial ideals
inferred← citeshttps://doi.org/10.1080/00927872.2023.2300760openalex-snapshot
Algebraic implications of neighborhood hypergraphs and their transversal hypergraphs
inferred← citeshttps://doi.org/10.1080/02331939708844298openalex-snapshot
Stable Payment Schemes of Tu-Games With Multiple Crieria1
inferred← citeshttps://doi.org/10.1080/09728600.2006.12088808openalex-snapshot
A survey on graphs which have equal domination and closed neighborhood packing numbers
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129174openalex-snapshot
Core Stability of Vertex Cover Games
inferred← citeshttps://doi.org/10.1090/s0002-9947-08-04461-9openalex-snapshot
Standard graded vertex cover algebras, cycles and leaves
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267784openalex-snapshot
A class of logic problems solvable by linear programming
inferred← citeshttps://doi.org/10.1137/0604036openalex-snapshot
A Class of Balanced Matrices Arising from Location Problems
inferred← citeshttps://doi.org/10.1137/0606012openalex-snapshot
Covering, Packing and Generalized Perfection
inferred← citeshttps://doi.org/10.1137/0607039openalex-snapshot
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
inferred← citeshttps://doi.org/10.1137/1.9780898718805.ch4openalex-snapshot
4. Bicolorings and Equitable Bicolorings of Matrices
inferred← citeshttps://doi.org/10.1137/140981496openalex-snapshot
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
inferred← citeshttps://doi.org/10.1142/s0219498820500553openalex-snapshot
Stability of depth functions of cover ideals of balanced hypergraphs
inferred← citeshttps://doi.org/10.1145/210118.210137openalex-snapshot
A class of logic problems solvable by linear programming
inferred← citeshttps://doi.org/10.1145/22145.22189openalex-snapshot
Doubly lexical orderings of matrices
inferred← citeshttps://doi.org/10.1147/rd.284.0476openalex-snapshot
Aspects of the traveling salesman problem
inferred← citeshttps://doi.org/10.1287/moor.10.2.280openalex-snapshot
On a Class of Totally Unimodular Matrices
inferred← citeshttps://doi.org/10.1287/moor.1070.0250openalex-snapshot
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
inferred← citeshttps://doi.org/10.1287/moor.19.1.21openalex-snapshot
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
inferred← citeshttps://doi.org/10.1287/opre.24.2.272openalex-snapshot
Network Flows, Minimum Coverings, and the Four-Color Conjectures
inferred← citeshttps://doi.org/10.1287/trsc.27.1.81openalex-snapshot
On the Core of Cost Allocation Games Defined on Location Problems
inferred← citeshttps://doi.org/10.3390/a14010022openalex-snapshot
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
inferred← citeshttps://doi.org/10.4134/jkms.2008.45.3.871openalex-snapshot
CORE STABILITY OF DOMINATING SET GAMES
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1772openalex-snapshot
On 2-partitionable clutters and the MFMC property
inferred← citeshttps://doi.org/10.48550/arxiv.0910.4197openalex-snapshot
Matchings in balanced hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1307.6663openalex-snapshot
On Complexities of Minus Domination
inferred← citeshttps://doi.org/10.5402/2011/540834openalex-snapshot
Weighted Maximum-Clique Transversal Sets of Graphs
inferred← citeshttps://doi.org/10.5555/314464.314484openalex-snapshot
Recognizing balanced 0,±matrices
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.