On the public citation graph

On the longest circuit in an alterable digraph

https://doi.org/10.1007/bf01279452
0 signed · 23 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/3-540-57155-8_267openalex-snapshot
On approximating the longest path in a graph
inferredcites →https://doi.org/10.1007/978-1-4613-3557-3openalex-snapshot
Minimax and Applications
inferredcites →https://doi.org/10.1007/978-1-4613-3557-3_15openalex-snapshot
On the Complexity of Min-Max Optimization Problems and their Approximation
inferredcites →https://doi.org/10.1007/bf01302963openalex-snapshot
Recursive construction for 3-regular expanders
inferredcites →https://doi.org/10.1007/bf02523689openalex-snapshot
On approximating the longest path in a graph
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
inferredcites →https://doi.org/10.1145/167088.167190openalex-snapshot
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
inferredcites →https://doi.org/10.1287/moor.18.1.1openalex-snapshot
The Traveling Salesman Problem with Distances One and Two

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032916.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118595091.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_15openalex-snapshot
On the Complexity of Min-Max Optimization Problems and their Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_1openalex-snapshot
In Memoriam: Ker-I Ko (1950–2018)
inferred← citeshttps://doi.org/10.1007/s00037-005-0193-yopenalex-snapshot
The complexity of the covering radius problem
inferred← citeshttps://doi.org/10.1109/ccc.2006.23openalex-snapshot
Hardness of the Covering Radius Problem on Lattices
inferred← citeshttps://doi.org/10.1109/sct.1995.514862openalex-snapshot
Optimizing TRIEs for ordered pattern matching is Π/sub 2//sup P/-complete
inferred← citeshttps://doi.org/10.1145/3319627.3319641openalex-snapshot
In Memoriam
inferred← citeshttps://doi.org/10.1145/568425.568432openalex-snapshot
SIGACT news complexity theory column 34
inferred← citeshttps://doi.org/10.1145/582475.582484openalex-snapshot
SIGACT news complexity theory comun 37
inferred← citeshttps://doi.org/10.1145/601819.601829openalex-snapshot
SIGACT news complexity theory column 38
inferred← citeshttps://doi.org/10.4086/toc.2007.v003a003openalex-snapshot
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.