On the public citation graph

A lower bound for the optimal crossing-free Hamiltonian cycle problem

https://doi.org/10.1007/bf02187887
0 signed · 18 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.1016/0095-8956(80)90041-6openalex-snapshot
Optimal crossing-free Hamiltonian circuit drawings of Kn
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferredcites →https://doi.org/10.1080/00029890.1981.11995362openalex-snapshot
Research Problems Become Unsolved Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02187898openalex-snapshot
Polygonizations of point sets in the plane
inferred← citeshttps://doi.org/10.1007/s00607-005-0133-3openalex-snapshot
On the Crossing Number of Complete Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00193-xopenalex-snapshot
Onion polygonizations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.05.004openalex-snapshot
Upward planar embedding of an n -vertex oriented path on O(n2) points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.11.007openalex-snapshot
Reprint of: Upward planar embedding of an n -vertex oriented path on O(n2) points
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.030openalex-snapshot
On asymptotic packing of geometric graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00491-0openalex-snapshot
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70193-6openalex-snapshot
Chapter 2 Exact Algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00010-9openalex-snapshot
Lower bounds on the number of crossing-free subgraphs of KN
inferred← citeshttps://doi.org/10.1023/a:1021231927255openalex-snapshot
Enumerating Order Types for Small Point Sets with Applications
inferred← citeshttps://doi.org/10.1137/050636036openalex-snapshot
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
inferred← citeshttps://doi.org/10.1145/378583.378596openalex-snapshot
Enumerating order types for small sets with applications
inferred← citeshttps://doi.org/10.1145/513400.513403openalex-snapshot
On the crossing number of complete graphs
inferred← citeshttps://doi.org/10.5555/1109557.1109652openalex-snapshot
On the number of crossing-free matchings, (cycles, and partitions)
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.