On the public citation graph

Notes on CD-independent subsets

0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-46248-1openalex-snapshot
Theory of Symmetric Lattices
inferredcites →https://doi.org/10.1007/bf01278596openalex-snapshot
Weakly independent subsets in lattices
inferredcites →https://doi.org/10.1007/bf02022041openalex-snapshot
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions
inferredcites →https://doi.org/10.1007/bf02170068openalex-snapshot
Two notes on independent subsets in lattices
inferredcites →https://doi.org/10.1016/j.ejc.2008.02.005openalex-snapshot
The number of rectangular islands by means of distributive lattices
inferredcites →https://doi.org/10.1016/j.ejc.2010.10.001openalex-snapshot
Elementary proof techniques for the maximum number of islands
inferredcites →https://doi.org/10.1016/j.fss.2010.04.019openalex-snapshot
Cut approach to islands in rectangular fuzzy relations
inferredcites →https://doi.org/10.1017/cbo9780511665578openalex-snapshot
Semimodular Lattices
inferredcites →https://doi.org/10.1023/a:1024643815068openalex-snapshot
On tolerance lattices of algebras in congruence modular varieties
inferredcites →https://doi.org/10.5486/pmd.2009.4320openalex-snapshot
CD-independent subsets in distributive lattices
inferredcites →https://doi.org/10.56021/9780801844256openalex-snapshot
Combinatorics and Partially Ordered Sets
inferredcites →https://doi.org/10.7151/dmgaa.1078openalex-snapshot
On interval decomposition lattices

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-07248-7_7openalex-snapshot
Directed Tree Decompositions
inferred← citeshttps://doi.org/10.1007/s10474-013-0371-3openalex-snapshot
CD-independent subsets in meet-distributive lattices
inferred← citeshttps://doi.org/10.13164/ma.2017.06openalex-snapshot
Classification trees in a box extent lattice
inferred← citeshttps://doi.org/10.13164/ma.2020.08openalex-snapshot
Huffman coding and chains in partition lattices
inferred← citeshttps://doi.org/10.14232/actasm-013-279-7openalex-snapshot
A general framework for island systems
inferred← citeshttps://doi.org/10.1515/dema-2016-0023openalex-snapshot
Interval Decomposition Lattices are Balanced
inferred← citeshttps://doi.org/10.1515/math-2017-0078openalex-snapshot
Classification lattices are geometric for complete atomistic lattices
inferred← citeshttps://doi.org/10.18514/mmn.2013.798openalex-snapshot
Islands: from coding theory to enumerative combinatorics and to lattice theory - overview and open problems
inferred← citeshttps://doi.org/10.48550/arxiv.1307.0900openalex-snapshot
CD-independent subsets in meet-distributive lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05109openalex-snapshot
Classification trees in a box extent lattice
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.