On the public citation graph
A nonuniform matroid which violates the isotopy conjecture
0 signed · 15 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/bf01166556openalex-snapshot
Teilungen der Ebene durch Geraden oder topologische Geraden
inferredcites →https://doi.org/10.1007/bf02187702openalex-snapshot
On the coordinatization of oriented matroids
inferredcites →https://doi.org/10.1016/0095-8956(78)90080-1openalex-snapshot
Orientability of matroids
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-642-58043-7_6openalex-snapshot
Allowable Sequences and Order Types in Discrete and Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf02187717openalex-snapshot
Uniform oriented matroids without the isotopy property
inferred← citeshttps://doi.org/10.1007/bf02187794openalex-snapshot
Nonrealizability proofs in computational geometry
inferred← citeshttps://doi.org/10.1007/s00454-015-9714-xopenalex-snapshot
Universality Theorems for Inscribed Polytopes and Delaunay Triangulations
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90068-8openalex-snapshot
The complexity of point configurations
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-0994170-3openalex-snapshot
On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
inferred← citeshttps://doi.org/10.1137/24m1660516openalex-snapshot
Distances between Realizations of Order Types
inferred← citeshttps://doi.org/10.1142/s0218195901000547openalex-snapshot
ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
inferred← citeshttps://doi.org/10.1145/2582112.2582119openalex-snapshot
Delaunay triangulations with disconnected realization spaces
inferred← citeshttps://doi.org/10.11606/d.45.2019.tde-25042019-000504openalex-snapshot
Extremal and probabilistic problems in order types
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.