On the public citation graph
Objects that cannot be taken apart with two hands
0 signed · 37 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-4615-4038-0openalex-snapshot
Computer-Aided Mechanical Assembly Planning
inferredcites →https://doi.org/10.1007/bf01840373openalex-snapshot
On the existence and synthesis of multifinger positive grips
inferredcites →https://doi.org/10.1016/0095-8956(71)90042-6openalex-snapshot
On the upper-bound conjecture for convex polytopes
inferredcites →https://doi.org/10.1080/0025570x.1984.11977071openalex-snapshot
On Removing a Ball Without Disturbing the Others
inferredcites →https://doi.org/10.1109/iros.1992.594555openalex-snapshot
Partitioning An Assembly For Infinitesimal Motions In Translation And Rotation
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1142/s0129054190000072openalex-snapshot
PLANAR POINT LOCATION REVISITED
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
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-00312-7_26openalex-snapshot
Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact
inferred← citeshttps://doi.org/10.1007/s00454-023-00572-3openalex-snapshot
Throwing a Sofa Through the Window
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90085-nopenalex-snapshot
On the complexity of assembly partitioning
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.06.001openalex-snapshot
On reconfiguration of disks in the plane and related problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00171-2openalex-snapshot
Interlocked open and closed linkages with few joints
inferred← citeshttps://doi.org/10.1017/s0956792518000086openalex-snapshot
Physically feasible decomposition of Engino® toy models: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1063/1.4952257openalex-snapshot
Quadrangles which cannot be separated with two hands
inferred← citeshttps://doi.org/10.1109/coase.2017.8256076openalex-snapshot
On the separation of a polyhedron from its single-part mold
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196854openalex-snapshot
PuzzleFlex: kinematic motion of chains with loose joints
inferred← citeshttps://doi.org/10.1109/iros.1998.727456openalex-snapshot
Efficiently testing for unboundedness and m-handed assembly
inferred← citeshttps://doi.org/10.1109/robot.1995.525642openalex-snapshot
A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions
inferred← citeshttps://doi.org/10.1109/tase.2013.2242327openalex-snapshot
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact
inferred← citeshttps://doi.org/10.1142/s0218195998000102openalex-snapshot
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
inferred← citeshttps://doi.org/10.1145/218013.218037openalex-snapshot
Assembly sequencing with toleranced parts
inferred← citeshttps://doi.org/10.1145/3799902.3811068openalex-snapshot
Computational Design of Coordinate-Motion Assemblies
inferred← citeshttps://doi.org/10.1145/513400.513424openalex-snapshot
Interlocked open linkages with few joints
inferred← citeshttps://doi.org/10.1177/02783640022067193openalex-snapshot
Efficient Linear Unboundedness Testing: Algorithm and Applications to Translational Assembly Planning
inferred← citeshttps://doi.org/10.15607/rss.2009.v.018openalex-snapshot
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3240openalex-snapshot
Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.1708.04203openalex-snapshot
Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold
inferred← citeshttps://doi.org/10.70675/80c88fa3z3629z4b71z8cabz67deb1d534cdopenalex-snapshot
(Dis)assembly path planning for complex objects and applications to structural biology
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.