On the public citation graph
Entropy splitting for antiblocking corners and perfect graphs
0 signed · 101 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/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90087-0openalex-snapshot
Relaxations of vertex packing
inferredcites →https://doi.org/10.1016/b978-0-12-358350-5.50006-3openalex-snapshot
On the Perfect Graph Theorem
inferredcites →https://doi.org/10.1016/s0195-6698(88)80048-9openalex-snapshot
New Bounds for Perfect Hashing via Information Theory
inferredcites →https://doi.org/10.1017/cbo9780511606267openalex-snapshot
The Theory of Information and Coding
inferredcites →https://doi.org/10.1109/tit.1973.1055109openalex-snapshot
Two-step encoding for finite sources
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1137/0607062openalex-snapshot
Fredman–Komlós bounds and information theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527693245.ch4openalex-snapshot
Entropy, Counting, and Fractional Chromatic Number
inferred← citeshttps://doi.org/10.1002/jgt.20252openalex-snapshot
Cross‐intersecting couples of graphs
inferred← citeshttps://doi.org/10.1006/eujc.1999.0299openalex-snapshot
Geometrical Techniques for Estimating Numbers of Linear Extensions
inferred← citeshttps://doi.org/10.1006/jcta.2000.3153openalex-snapshot
Energy of Convex Sets, Shortest Paths, and Resistance
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_2openalex-snapshot
Discrete Mathematics and Radio Channel Assignment
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_11openalex-snapshot
Zero-error capacities and very different sequences
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_15openalex-snapshot
On the Shannon Capacity of Graph Formulae
inferred← citeshttps://doi.org/10.1007/978-3-319-67885-6_5openalex-snapshot
Simplicial Complex Entropy
inferred← citeshttps://doi.org/10.1007/978-3-540-44485-5_8openalex-snapshot
Equilibrium Statistical Mechanicsof Network Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_9openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_12openalex-snapshot
On Generalized Comparison-Based Sorting Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_7openalex-snapshot
The Normal Graph Conjecture for Classes of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_29openalex-snapshot
The Normal Graph Conjecture is True for Circulants
inferred← citeshttps://doi.org/10.1007/bf01285815openalex-snapshot
The number of edges of many faces in a line segment arrangement
inferred← citeshttps://doi.org/10.1007/bf01787419openalex-snapshot
On the capacity of boolean graph formulæ
inferred← citeshttps://doi.org/10.1007/s00224-011-9371-2openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00373-017-1868-2openalex-snapshot
The Normal Graph Conjecture for Two Classes of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00493-013-2821-5openalex-snapshot
Sorting under partial information (without the ellipsoid algorithm)
inferred← citeshttps://doi.org/10.1007/s00493-017-3559-2openalex-snapshot
Minimal Normal Graph Covers
inferred← citeshttps://doi.org/10.1007/s00493-020-4324-5openalex-snapshot
Probabilistic Refinement of the Asymptotic Spectrum of Graphs
inferred← citeshttps://doi.org/10.1007/s004930070022openalex-snapshot
Graph Pairs and their Entropies: Modularity Problems
inferred← citeshttps://doi.org/10.1007/s10107-004-0545-4openalex-snapshot
?Cone-free? primal-dual path-following and potential-reduction polynomial time interior-point methods
inferred← citeshttps://doi.org/10.1007/s10107-016-1041-3openalex-snapshot
An axiomatic duality framework for the theta body and related convex corners
inferred← citeshttps://doi.org/10.1007/s11083-015-9346-zopenalex-snapshot
Poset Entropy Versus Number of Linear Extensions: The Width-2 Case
inferred← citeshttps://doi.org/10.1007/s11083-017-9439-yopenalex-snapshot
Linear Extensions and Comparable Pairs in Partial Orders
inferred← citeshttps://doi.org/10.1007/s11856-023-2506-8openalex-snapshot
Attempting perfect hypergraphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-374485-2.00008-1openalex-snapshot
Zero-error Distributed Source Coding
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2007.09.007openalex-snapshot
Structural information content of networks: Graph entropy based on local vertex functionals
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.021openalex-snapshot
Constructions for normal graphs and some consequences
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.023openalex-snapshot
On equistable, split, CIS, and related classes of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.001openalex-snapshot
Almost all regular graphs are normal
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.072openalex-snapshot
Line-graphs of cubic graphs are normal
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103779openalex-snapshot
Generalizing Körner’s graph entropy to graphons
inferred← citeshttps://doi.org/10.1016/j.ins.2010.08.041openalex-snapshot
A history of graph entropy measures
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105302openalex-snapshot
Sandwich theorems and capacity bounds for non-commutative graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.04.001openalex-snapshot
Disproving the normal graph conjecture
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00018-9openalex-snapshot
On the odd cycles of normal graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80185-4openalex-snapshot
Perfection, Imperfection, and Graph Entropy
inferred← citeshttps://doi.org/10.1017/s0963548397003271openalex-snapshot
Recovering Set Systems and Graph Entropy
inferred← citeshttps://doi.org/10.1080/01969720802435925openalex-snapshot
A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
inferred← citeshttps://doi.org/10.1090/s0273-0979-1989-15821-7openalex-snapshot
An ergodic theorem for constrained sequences of functions
inferred← citeshttps://doi.org/10.1109/18.79909openalex-snapshot
The stability region of the finite-user slotted ALOHA protocol
inferred← citeshttps://doi.org/10.1109/cdc.1989.70180openalex-snapshot
The stability region of the finite-user slotted ALOHA protocol
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848850openalex-snapshot
Broadcast Function Computation with Complementary Side Information
inferred← citeshttps://doi.org/10.1109/isit.1994.394705openalex-snapshot
Entropy splitting hypergraphs
inferred← citeshttps://doi.org/10.1109/isit.1997.612928openalex-snapshot
Modularity properties of graph entropy
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206770openalex-snapshot
Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654028openalex-snapshot
Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
inferred← citeshttps://doi.org/10.1109/itw.2016.7606785openalex-snapshot
On Distributed Computing for Functions With Certain Structures
inferred← citeshttps://doi.org/10.1109/tit.2002.806154openalex-snapshot
On zero-error source coding with decoder side information
inferred← citeshttps://doi.org/10.1109/tit.2003.819334openalex-snapshot
On zero-error coding of correlated sources
inferred← citeshttps://doi.org/10.1109/tit.2009.2018182openalex-snapshot
On Complementary Graph Entropy
inferred← citeshttps://doi.org/10.1109/tit.2011.2162178openalex-snapshot
Improved Source Coding Exponents via Witsenhausen's Rate
inferred← citeshttps://doi.org/10.1109/tit.2014.2303802openalex-snapshot
Distributed Computing and the Graph Entropy Region
inferred← citeshttps://doi.org/10.1109/tit.2018.2884490openalex-snapshot
Function Computation Through a Bidirectional Relay
inferred← citeshttps://doi.org/10.1109/tit.2023.3298988openalex-snapshot
Asymptotic Equipartition Property for a Markov Source Having Ambiguous Alphabet
inferred← citeshttps://doi.org/10.1109/tit.2023.3315304openalex-snapshot
Conditional Graph Entropy as an Alternating Minimization Problem
inferred← citeshttps://doi.org/10.1137/090759860openalex-snapshot
An Efficient Algorithm for Partial Order Production
inferred← citeshttps://doi.org/10.1137/22m1530410openalex-snapshot
A Sum of Squares Characterization of Perfect Graphs
inferred← citeshttps://doi.org/10.1145/1007352.1007377openalex-snapshot
Graph entropy and quantum sorting problems
inferred← citeshttps://doi.org/10.1145/1536414.1536430openalex-snapshot
An efficient algorithm for partial order production
inferred← citeshttps://doi.org/10.1145/1806689.1806740openalex-snapshot
Sorting under partial information (without the ellipsoid algorithm)
inferred← citeshttps://doi.org/10.1155/2020/3562382openalex-snapshot
Some Bounds of Weighted Entropies with Augmented Zagreb Index Edge Weights
inferred← citeshttps://doi.org/10.1155/2022/5958913openalex-snapshot
The Edge-Weighted Graph Entropy Using Redefined Zagreb Indices
inferred← citeshttps://doi.org/10.1215/00192082-9799163openalex-snapshot
Information theoretic parameters of noncommutative graphs and convex corners
inferred← citeshttps://doi.org/10.1287/moor.2016.0845openalex-snapshot
Graph Orientations and Linear Extensions
inferred← citeshttps://doi.org/10.3390/e26040338openalex-snapshot
Side Information Design in Zero-Error Coding for Computing
inferred← citeshttps://doi.org/10.37236/5642openalex-snapshot
Symmetric Graphs with Respect to Graph Entropy
inferred← citeshttps://doi.org/10.3990/1.9789036556675openalex-snapshot
Graph entropy and related topics
inferred← citeshttps://doi.org/10.4134/jkms.2006.43.1.215openalex-snapshot
GRAPH REPRESENTATIONS OF NORMAL MATRICES
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0086openalex-snapshot
Sorting under Partial Information (without the Ellipsoid Algorithm)
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5024openalex-snapshot
Poset Entropy versus Number of Linear Extensions: the Width-$2$ Case
inferred← citeshttps://doi.org/10.48550/arxiv.1405.4880openalex-snapshot
Graph Orientations and Linear Extensions
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05683openalex-snapshot
On Equistable, Split, CIS, and Related Classes of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.00162openalex-snapshot
Weighted theta functions for non-commutative graphs
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.