On the public citation graph
Pivoting Local Max-Cut: Deactivation Fan-Out and Subpolynomial Degree
0 signed · 12 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-3-642-13073-1_24openalex-snapshot
On the Power of Nodes of Degree Four in the Local Max-Cut Problem
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1016/j.jcss.2011.10.003openalex-snapshot
Local search: Is brute-force avoidable?
inferredcites →https://doi.org/10.1016/j.tcs.2012.02.033openalex-snapshot
Convergence and approximation in potential games
inferredcites →https://doi.org/10.1073/pnas.79.8.2554openalex-snapshot
Neural networks and physical systems with emergent collective computational abilities.
inferredcites →https://doi.org/10.1137/0220004openalex-snapshot
Simple Local Search Problems that are Hard to Solve
inferredcites →https://doi.org/10.1137/16m1104834openalex-snapshot
Slightly Superexponential Parameterized Problems
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.1145/1007352.1007445openalex-snapshot
The complexity of pure Nash equilibria
inferredcites →https://doi.org/10.1145/3011870openalex-snapshot
Smoothed Analysis of Local Search for the Maximum-Cut Problem
inferredcites →https://doi.org/10.1145/3357713.3384325openalex-snapshot
Smoothed complexity of local max-cut and binary max-CSP
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.