On the public citation graph
On minimal convex pairs of convex compact sets
0 signed · 23 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/bf01189892openalex-snapshot
Minimal pairs of convex compact sets
inferredcites →https://doi.org/10.1007/bf01414153openalex-snapshot
Some criteria for the minimality of pairs of compact convex sets
inferredcites →https://doi.org/10.1007/bf01581143openalex-snapshot
Reduction of quasidifferentials and minimal representations
inferredcites →https://doi.org/10.1007/bf02589354openalex-snapshot
Sur la fonction d’appui des ensembles convexes dans un espace localement convexe
inferredcites →https://doi.org/10.1080/02331939208843757openalex-snapshot
Difference of compact sets in the sense of demyanov and its application to non-smooth analysis
inferredcites →https://doi.org/10.1090/s0002-9939-1952-0045938-2openalex-snapshot
An Embedding Theorem for Spaces of Convex Sets
inferredcites →https://doi.org/10.1112/s002557930001500xopenalex-snapshot
Minimal pairs of convex bodies in two dimensions
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-1-4757-3137-8_8openalex-snapshot
Minimal Pairs of Compact Convex Sets, with Application to Quasidifferential Calculus
inferred← citeshttps://doi.org/10.1007/s10474-005-0020-6openalex-snapshot
On inclusion and summands of bounded closed convex sets
inferred← citeshttps://doi.org/10.1007/s10898-009-9444-9openalex-snapshot
Reduction of finite exhausters
inferred← citeshttps://doi.org/10.1007/s10957-015-0860-3openalex-snapshot
Reduced Pairs of Compact Convex Sets and Ordered Median Functions
inferred← citeshttps://doi.org/10.1080/02331930701779971openalex-snapshot
Decomposition of the polyhedron from Albrecht Dürer's ‘Melencolia I’ to a minimal pair of compact convex sets
inferred← citeshttps://doi.org/10.1080/10556780903187460openalex-snapshot
On the amount of minimal pairs of convex sets
inferred← citeshttps://doi.org/10.4064/bc64-0-13openalex-snapshot
Minimal pairs of compact convex sets
inferred← citeshttps://doi.org/10.4064/bc84-0-2openalex-snapshot
Minimal pairs of bounded closed convex sets as minimal representations of elements of the Minkowski–Rådström–Hörmander spaces
inferred← citeshttps://doi.org/10.4064/sm158-1-5openalex-snapshot
On the number of minimal pairs of compact convex sets that are not translates of one another
inferred← citeshttps://doi.org/10.4064/sm189-1-1openalex-snapshot
On the reduction of pairs of bounded closed convex sets
inferred← citeshttps://doi.org/10.4171/zaa/1111openalex-snapshot
On Summands of Closed Bounded Convex Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1801.06946openalex-snapshot
Yet Another Convex Sets Subtraction with Application in Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.5209/rev_rema.2003.v16.n2.16838openalex-snapshot
On reduced pairs of bounded closed convex sets
inferred← citeshttps://doi.org/10.68381/jca04018openalex-snapshot
Decompositions of Compact Convex Sets
inferred← citeshttps://doi.org/10.68381/jca06021openalex-snapshot
Invariants of Pairs of Compact Convex Sets
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.