On the public citation graph

Linear Programming Complementation

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.
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.1002/jgt.21898openalex-extracted
Deploying Robots With Two Sensors in K1, 6‐Free Graphs
inferredcites →https://doi.org/10.1007/978-1-4612-4540-7openalex-extracted
Mathematical Introduction to Linear Programming and Game Theory
inferredcites →https://doi.org/10.1007/bf02579273openalex-extracted
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-extracted
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0012-365x(79)90124-9openalex-extracted
Game theory: lectures for economists and systems scientists
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-extracted
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-extracted
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1145/3313906openalex-extracted
Tight Lower Bounds for the Complexity of Multicoloring
inferredcites →https://doi.org/10.1201/9781482246582openalex-extracted
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.1887/0750303123/b365c84openalex-extracted
Combinatorial optimization
inferredcites →https://doi.org/10.2307/2343865openalex-extracted
Introduction to Operations Research.
inferredcites →https://doi.org/10.2307/2582770openalex-snapshot
Theory of Linear and Integer Programming
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.