On the public citation graph

Covering Problems for Dichotomized Matching

0 signed · 33 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.1002/mana.19670330506openalex-snapshot
On the characterization of plane projective and complex MOEBIUS‐transformations
inferredcites →https://doi.org/10.1090/psapm/010/0119146openalex-snapshot
On homomorphisms of projective planes
inferredcites →https://doi.org/10.1093/qmath/1.1.284openalex-snapshot
COVERING THEOREMS FOR GROUPS
inferredcites →https://doi.org/10.1112/jlms/s1-26.1.71openalex-snapshot
A Covering Theorem for Abelian Groups
inferredcites →https://doi.org/10.1112/jlms/s1-27.2.242openalex-snapshot
Covering Problems Concerning Abelian Groups
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.60openalex-snapshot
A Combinatorial Problem in Matching
inferredcites →https://doi.org/10.2140/pjm.1968.26.131openalex-snapshot
Maximal and minimal coverings of (k− 1)-tuples byk-tuples
inferredcites →https://doi.org/10.4153/cmb-1968-082-6openalex-snapshot
On a Certain Set of Linear Inequalities

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00010-009-2971-0openalex-snapshot
Extremal problems on sum-free sets and coverings in tridimensional spaces
inferred← citeshttps://doi.org/10.1007/s002000050061openalex-snapshot
Covering Radius 1985-1994
inferred← citeshttps://doi.org/10.1007/s10623-005-6404-3openalex-snapshot
New Results on Codes with Covering Radius 1 and Minimum Distance 2
inferred← citeshttps://doi.org/10.1007/s10623-007-9156-4openalex-snapshot
On the minimum size of binary codes with length 2R + 4 and covering radius R
inferred← citeshttps://doi.org/10.1016/0097-3165(71)90051-3openalex-snapshot
On covering sets and error-correcting codes
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90010-eopenalex-snapshot
Bounds on packings and coverings by spheres inq-ary and mixed Hamming spaces
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90013-2openalex-snapshot
Lower bounds for q-ary coverings by spheres of radius one
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90027-kopenalex-snapshot
Independent domination in hypercubes
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81825-0openalex-snapshot
New upper bounds for binary covering codes
inferred← citeshttps://doi.org/10.1023/a:1008326409439openalex-snapshot
Constructing Covering Codes with Given Automorphisms
inferred← citeshttps://doi.org/10.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferred← citeshttps://doi.org/10.1109/18.243462openalex-snapshot
Some new lower bounds for binary and ternary covering codes
inferred← citeshttps://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of codes
inferred← citeshttps://doi.org/10.1109/18.2644openalex-snapshot
Lower bounds for binary covering codes
inferred← citeshttps://doi.org/10.1109/18.335963openalex-snapshot
New lower bounds for binary covering codes
inferred← citeshttps://doi.org/10.1109/18.45285openalex-snapshot
On normal and subnormal q-ary codes
inferred← citeshttps://doi.org/10.1109/18.75253openalex-snapshot
Modified bounds for covering codes
inferred← citeshttps://doi.org/10.1109/18.79914openalex-snapshot
Linear inequalities for covering codes. I. Pair covering inequalities
inferred← citeshttps://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferred← citeshttps://doi.org/10.1109/tit.1986.1057227openalex-snapshot
Further results on the covering radius of codes
inferred← citeshttps://doi.org/10.1109/tit.2002.807307openalex-snapshot
Disproof of a conjecture on the existence of balanced optimal covering codes
inferred← citeshttps://doi.org/10.1109/tit.2005.860449openalex-snapshot
Unidirectional covering codes
inferred← citeshttps://doi.org/10.1137/0117123openalex-snapshot
Intersection Inequalities for the Covering Problem
inferred← citeshttps://doi.org/10.2140/pjm.1968.26.131openalex-snapshot
Maximal and minimal coverings of (k− 1)-tuples byk-tuples
inferred← citeshttps://doi.org/10.7146/math.scand.a-10952openalex-snapshot
On Group and Nongroup Perfect Codes in $q$ Symbols.
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.