On the public citation graph
Interval orders and circle orders
0 signed · 31 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/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00143891openalex-snapshot
Circle orders, N-gon orders and the crossing number
inferredcites →https://doi.org/10.1007/bf00337885openalex-snapshot
Angle orders, regular n-gon orders and the crossing number
inferredcites →https://doi.org/10.1016/0022-2496(70)90062-3openalex-snapshot
Intransitive indifference with unequal indifference intervals
inferredcites →https://doi.org/10.1016/0097-3165(76)90004-2openalex-snapshot
A bound on the dimension of interval orders
inferredcites →https://doi.org/10.1016/0097-3165(78)90030-4openalex-snapshot
The dimension of semiorders
inferredcites →https://doi.org/10.1016/s0167-5060(08)70478-3openalex-snapshot
Problems and Conjectures in the Combinatorial Theory of Ordered Sets
inferredcites →https://doi.org/10.2307/1905751openalex-snapshot
Semiorders and a Theory of Utility Discrimination
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-94-009-2639-4_11openalex-snapshot
Partial Orders and Euclidean Geometry
inferred← citeshttps://doi.org/10.1007/bf02034333openalex-snapshot
On invertibility and zero-augmentability ofN-gon orders
inferred← citeshttps://doi.org/10.1007/pl00009296openalex-snapshot
A combinatorial property of convex sets
inferred← citeshttps://doi.org/10.1007/s11083-020-09526-3openalex-snapshot
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels
inferred← citeshttps://doi.org/10.1007/s11083-023-09656-4openalex-snapshot
On Dually-CPT and Strongly-CPT Posets
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50010-5openalex-snapshot
10.1016/b978-044488002-4/50010-5
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00314-8openalex-snapshot
Finite three dimensional partial orders which are not sphere orders
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00180-3openalex-snapshot
Ray shooting from convex ranges
inferred← citeshttps://doi.org/10.1017/cbo9780511662119.009openalex-snapshot
New Perspectives on Interval Orders and Interval Graphs
inferred← citeshttps://doi.org/10.1023/a:1006110326269openalex-snapshot
Geometric Containment Orders: A Survey
inferred← citeshttps://doi.org/10.1080/09728600.2024.2334799openalex-snapshot
Containment orders – a lifelong journey
inferred← citeshttps://doi.org/10.1090/dimacs/049/24openalex-snapshot
Ramsey theory and partially ordered sets
inferred← citeshttps://doi.org/10.1145/220279.220287openalex-snapshot
Voronoi diagrams and containment of families of convex sets on the plane
inferred← citeshttps://doi.org/10.1177/0037549705054930openalex-snapshot
A Framework for Formalization and Strictness Analysis of Simulation Event Orderings
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.