On the public citation graph
Balanced matrices
0 signed · 146 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.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1016/s0021-9800(70)80033-3openalex-snapshot
Subgraphs with prescribed valencies
inferredcites →https://doi.org/10.1090/psapm/010/0114759openalex-snapshot
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb56451.xopenalex-snapshot
SUR UN THEOREMS DU TYPE KÖNIG POUR HYPERGRAPHES
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190110415openalex-snapshot
Ki‐covers. II. Ki‐perfect graphs
inferred← citeshttps://doi.org/10.1002/net.20459openalex-snapshot
Coverings and matchings in r‐partite hypergraphs
inferred← citeshttps://doi.org/10.1002/net.3230060406openalex-snapshot
On totally unimodular matrices
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/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-45771-6_1openalex-snapshot
Idealness of k-wise Intersecting Families
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_87openalex-snapshot
Degree Conditions for Tight Hamilton Cycles
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-540-68279-0_12openalex-snapshot
Fifty-Plus Years of Combinatorial Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_35openalex-snapshot
Probe Matrix Problems: Totally Balanced Matrices
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/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-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-011-7557-9_14openalex-snapshot
Characterisations of Totally Unimodular, Balanced and Perfect Matrices
inferred← citeshttps://doi.org/10.1007/bf01068342openalex-snapshot
Two classes of location problems on tree networks
inferred← citeshttps://doi.org/10.1007/bf01069466openalex-snapshot
Certain class of problems in integral linear programming
inferred← citeshttps://doi.org/10.1007/bf01581189openalex-snapshot
Properties of balanced and perfect matrices
inferred← citeshttps://doi.org/10.1007/bf01581196openalex-snapshot
Structural properties and decomposition of linear balanced matrices
inferred← citeshttps://doi.org/10.1007/bf01582135openalex-snapshot
Testing balancedness and perfection of linear 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/bf01589107openalex-snapshot
Odd cycles and matrices with integrality properties
inferred← citeshttps://doi.org/10.1007/bf01589329openalex-snapshot
On some characterisations of totally unimodular matrices
inferred← citeshttps://doi.org/10.1007/bf01590956openalex-snapshot
Balanced 0, ±1-matrices, bicoloring and total dual integrality
inferred← citeshttps://doi.org/10.1007/bf02591932openalex-snapshot
A decomposition property of polyhedra
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/s00373-024-02836-yopenalex-snapshot
Note on Polychromatic Coloring of Hereditary Hypergraph Families
inferred← citeshttps://doi.org/10.1007/s00453-009-9358-4openalex-snapshot
Improved Approximations for Guarding 1.5-Dimensional Terrains
inferred← citeshttps://doi.org/10.1007/s10107-005-0647-7openalex-snapshot
Recognizing Balanceable Matrices
inferred← citeshttps://doi.org/10.1007/s10107-020-01587-xopenalex-snapshot
Idealness of k-wise intersecting families.
inferred← citeshttps://doi.org/10.1007/s10107-024-02155-3openalex-snapshot
From coordinate subspaces over finite fields to ideal multipartite uniform clutters
inferred← citeshttps://doi.org/10.1007/s10618-022-00893-6openalex-snapshot
Making clusterings fairer by post-processing: algorithms, complexity results and experiments
inferred← citeshttps://doi.org/10.1007/s10801-007-0088-xopenalex-snapshot
Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs
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(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(84)90067-0openalex-snapshot
Total weak unimodularity: testing and applications
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/0012-365x(92)90697-eopenalex-snapshot
The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90054-xopenalex-snapshot
The domatic number problem on some perfect graph families
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(86)90044-2openalex-snapshot
Strong unimodularity for matrices and hypergraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00054-hopenalex-snapshot
Permuting matrices to avoid forbidden submatrices
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00148-7openalex-snapshot
Decomposition of wheel-and-parachute-free balanced bipartite graphs
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(94)00047-aopenalex-snapshot
Reliability, covering and 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(90)90004-uopenalex-snapshot
Optimisation and hypergraph theory
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00115-sopenalex-snapshot
Graph theoretic relaxations of set covering and set partitioning problems
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/0377-2217(96)00013-6openalex-snapshot
Extensions of coloring models for scheduling purposes
inferred← citeshttps://doi.org/10.1016/b978-0-12-358350-5.50007-5openalex-snapshot
A Survey of Integer Programming Emphasizing Computation and Relations among Models
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/j.comgeo.2023.102020openalex-snapshot
Colouring bottomless rectangles and arborescences
inferred← citeshttps://doi.org/10.1016/j.cor.2014.07.012openalex-snapshot
Integer programming methods for large-scale practical classroom assignment problems
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.2019.05.019openalex-snapshot
On some graph classes related to perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2025.09.036openalex-snapshot
On a geometric graph-covering problem related to optimal safety-landing-site location
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.044openalex-snapshot
Good and nice colorings of balanced hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.01.002openalex-snapshot
Strongly simplicial vertices of powers of trees
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.disopt.2016.05.004openalex-snapshot
On the mixed set covering, packing and partitioning polytope
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.endm.2013.10.062openalex-snapshot
Forbidden induced subgraph characterizations of subclasses and variations of perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.fss.2007.01.016openalex-snapshot
Dioïds and semirings: Links to fuzzy sets and other applications
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.jctb.2018.10.006openalex-snapshot
Deltas, extended odd holes and their blockers
inferred← citeshttps://doi.org/10.1016/j.jpaa.2007.11.010openalex-snapshot
Cohen–Macaulay, shellable and unmixed clutters with a perfect matching of König type
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/s0166-218x(97)00034-6openalex-snapshot
Transversal partitioning in balanced hypergraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00064-xopenalex-snapshot
On testing consecutive-ones property in parallel
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00092-4openalex-snapshot
A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
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)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)72918-9openalex-snapshot
Minimax Theorems for Normal Hypergraphs and Balanced Hypergraphs — A Survey
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)72960-8openalex-snapshot
Linear Algebra in Dioids: A Survey of Recent Results
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00056-4openalex-snapshot
Perfect, ideal and balanced matrices
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1080/00207160.2014.881994openalex-snapshot
Clique-perfectness and balancedness of some graph classes
inferred← citeshttps://doi.org/10.1080/02522667.1983.10698769openalex-snapshot
Extensions of the Minimum Dominating Set Problem
inferred← citeshttps://doi.org/10.1080/03081088608817703openalex-snapshot
A generalization of a theorem of König
inferred← citeshttps://doi.org/10.1109/icccn61486.2024.10637612openalex-snapshot
Lightweight Coordinated Sampling for Dynamic Flows under Budget Constraints
inferred← citeshttps://doi.org/10.1109/sfcs.1980.27openalex-snapshot
On a class of totally unimodular matrices
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267784openalex-snapshot
A class of logic problems solvable by linear programming
inferred← citeshttps://doi.org/10.1109/tit.2007.892768openalex-snapshot
Grid Colorings in Steganography
inferred← citeshttps://doi.org/10.1109/tit.2018.2792045openalex-snapshot
Topological Interference Management With Decoded Message Passing
inferred← citeshttps://doi.org/10.1109/ton.2025.3644238openalex-snapshot
Efficient Lightweight Coordinated Sampling for Dynamic Flows: Theory and Implementation
inferred← citeshttps://doi.org/10.1112/jlms.12561openalex-snapshot
Minimum degree conditions for tight Hamilton cycles
inferred← citeshttps://doi.org/10.1134/s1064226917120105openalex-snapshot
On Balanced Clustering (Indices, Models, Examples)
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/140981496openalex-snapshot
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
inferred← citeshttps://doi.org/10.1137/s0097539700380754openalex-snapshot
Approximating theDomatic Number
inferred← citeshttps://doi.org/10.1145/210118.210137openalex-snapshot
A class of logic problems solvable by linear programming
inferred← citeshttps://doi.org/10.1145/335305.335321openalex-snapshot
Approximating the domatic number
inferred← citeshttps://doi.org/10.1287/ijoc.2021.0233openalex-snapshot
Recognizing Series-Parallel Matrices in Linear Time
inferred← citeshttps://doi.org/10.1287/inte.31.1.30.9688openalex-snapshot
Optimized Crew Scheduling at Air New Zealand
inferred← citeshttps://doi.org/10.1287/mnsc.2023.02996openalex-snapshot
An Integer Programming Approach for Quick-Commerce Assortment Planning
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.2019.1048openalex-snapshot
Resistant Sets in the Unit Hypercube
inferred← citeshttps://doi.org/10.1287/opre.51.2.240.12779openalex-snapshot
Record Matching in Data Warehouses: A Decision Model for Data Consolidation
inferred← citeshttps://doi.org/10.1287/trsc.1100.0362openalex-snapshot
Routing Trains Through Railway Junctions: A New Set-Packing Approach
inferred← citeshttps://doi.org/10.15476/elte.2022.266openalex-snapshot
Coloring Geometric Graphs and Hypergraphs
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.