On the public citation graph

Discrete topological complexity

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.1007/978-3-540-71962-5openalex-snapshot
Combinatorial Algebraic Topology
inferredcites →https://doi.org/10.1007/978-3-642-22003-6openalex-snapshot
Algebraic Topology of Finite Topological Spaces and Applications
inferredcites →https://doi.org/10.1007/s00454-002-0760-9openalex-snapshot
Topological Complexity of Motion Planning
inferredcites →https://doi.org/10.1007/s00454-011-9357-5openalex-snapshot
Strong Homotopy Types, Nerves and Collapses
inferredcites →https://doi.org/10.1016/j.topol.2015.08.001openalex-snapshot
Lusternik–Schnirelmann category of simplicial complexes and finite spaces
inferredcites →https://doi.org/10.1016/j.topol.2016.11.015openalex-snapshot
On the Lusternik–Schnirelmann category of a simplicial map
inferredcites →https://doi.org/10.1090/surv/103openalex-snapshot
Lusternik-Schnirelmann Category
inferredcites →https://doi.org/10.1090/trans2/055/03openalex-snapshot
The genus of a fiber space
inferredcites →https://doi.org/10.1142/9789814651448_0009openalex-snapshot
Lusternik-Schnirelmann category
inferredcites →https://doi.org/10.1215/ijm/1415023508openalex-snapshot
Lusternik–Schnirelmann category for simplicial complexes
inferredcites →https://doi.org/10.1215/ijm/1475266400openalex-snapshot
Lusternik–Schnirelmann category for cell complexes and posets
inferredcites →https://doi.org/10.4171/054openalex-snapshot
Invitation to Topological Robotics
inferredcites →https://doi.org/10.48550/arxiv.1701.07612openalex-snapshot
Simplicial Complexity: piecewise linear motion planning in robotics
inferredcites →https://doi.org/10.48550/arxiv.1710.09794openalex-snapshot
A strong collapse increasing the geometric simplicial Lusternik-Schnirelmann category
inferredcites →https://doi.org/10.5565/publmat6311909openalex-snapshot
Simplicial Lusternik-Schnirelmann category

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00009-025-02908-0openalex-snapshot
Some Notes and Comparisons on Topological Complexities
inferred← citeshttps://doi.org/10.1007/s11784-026-01293-9openalex-snapshot
Higher contiguity distance
inferred← citeshttps://doi.org/10.1007/s13398-020-00966-5openalex-snapshot
Simplicial fibrations
inferred← citeshttps://doi.org/10.1007/s13398-024-01623-xopenalex-snapshot
Higher analogues of discrete topological complexity
inferred← citeshttps://doi.org/10.1007/s40062-020-00269-xopenalex-snapshot
Homotopic distance between functors
inferred← citeshttps://doi.org/10.1016/j.topol.2024.108934openalex-snapshot
Strong digital topological complexity of digital maps
inferred← citeshttps://doi.org/10.1016/j.topol.2025.109634openalex-snapshot
A discrete topological complexity of discrete motion planning
inferred← citeshttps://doi.org/10.1016/j.topol.2026.109746openalex-snapshot
Contiguity distance between simplicial maps: Stability, product–wedge principles, and relative variants
inferred← citeshttps://doi.org/10.1017/s0305004121000116openalex-snapshot
Homotopic distance between maps
inferred← citeshttps://doi.org/10.1090/proc/15366openalex-snapshot
Simplicial approximation and refinement of monoidal topological complexity
inferred← citeshttps://doi.org/10.1142/s1793525321500709openalex-snapshot
Morse–Bott theory on posets and a homological Lusternik–Schnirelmann theorem
inferred← citeshttps://doi.org/10.12775/tmna.2019.048openalex-snapshot
Symmetric topological complexity for finite spaces and classifying spaces
inferred← citeshttps://doi.org/10.2206/kyushujm.79.93openalex-snapshot
TOPOLOGICAL COMPLEXITY OF KHALIMSKY CIRCLES
inferred← citeshttps://doi.org/10.3390/math9192358openalex-snapshot
A Randomized Greedy Algorithm for Piecewise Linear Motion Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1812.07604openalex-snapshot
The Topological Complexity of Finite Models of Spheres
inferred← citeshttps://doi.org/10.48550/arxiv.1908.07015openalex-snapshot
The Topological Complexity of Spaces of Digital Jordan Curves
inferred← citeshttps://doi.org/10.48550/arxiv.2007.13565openalex-snapshot
Morse-Bott Theory on posets and an homological Lusternik-Schnirelmann Theorem
inferred← citeshttps://doi.org/10.55730/1300-0098.3385openalex-snapshot
Contiguity distance between simplicial maps
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.