On the public citation graph
The complexity of the fixed point property
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.
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-1-4612-0333-9openalex-snapshot
The Graph Isomorphism Problem
inferredcites →https://doi.org/10.1007/bf00337690openalex-snapshot
The fixed point property in ordered sets of width two
inferredcites →https://doi.org/10.1007/bf00338744openalex-snapshot
Dimension two, fixed points and dismantlable ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(80)90152-1openalex-snapshot
A note on fixed points in semimodular lattices
inferredcites →https://doi.org/10.1016/0097-3165(76)90003-0openalex-snapshot
A fixed point theorem for finite partially ordered sets
inferredcites →https://doi.org/10.1137/0210002openalex-snapshot
Some NP-Complete Problems Similar to Graph Isomorphism
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2140/pjm.1955.5.311openalex-snapshot
A characterization of complete 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/s00012-005-1882-8openalex-snapshot
A fixed point theorem with applications to truncated lattices
inferred← citeshttps://doi.org/10.1007/s11083-014-9337-5openalex-snapshot
The Fixed Vertex Property for Graphs
inferred← citeshttps://doi.org/10.1007/s11083-016-9401-4openalex-snapshot
The Fixed Point Property for Ordered Sets of Interval Dimension 2
inferred← citeshttps://doi.org/10.1007/s11083-019-09498-zopenalex-snapshot
Fixed Point Property for Finite Ordered Sets that Contain No Crowns with 6 or More Elements
inferred← citeshttps://doi.org/10.1007/s40065-012-0049-7openalex-snapshot
The fixed point property for ordered sets
inferred← citeshttps://doi.org/10.1007/s40065-022-00399-5openalex-snapshot
Minimal automorphic superpositions of crowns
inferred← citeshttps://doi.org/10.1016/b978-0-12-804295-3.50008-5openalex-snapshot
The Use of Retractions in the Fixed Point Theory for Ordered Sets
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.012openalex-snapshot
Isotone relations revisited
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.024openalex-snapshot
Forbidden retracts for finite ordered sets of width at most four
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00273-4openalex-snapshot
Algorithms for the fixed point property
inferred← citeshttps://doi.org/10.1023/a:1006029802751openalex-snapshot
The Fixed Point Property for Posets of Small Width
inferred← citeshttps://doi.org/10.1137/s0895480101389478openalex-snapshot
The Complexity of the Extendibility Problem for Finite Posets
inferred← citeshttps://doi.org/10.7155/jgaa.v28i1.2957openalex-snapshot
The Complexity of the Fixed Clique Property
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.