On the public citation graph

Reducing Matching to Polynomial Size Linear Programming

https://doi.org/10.1137/0803035
0 signed · 38 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/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01580600openalex-snapshot
On cuts and matchings in planar graphs
inferredcites →https://doi.org/10.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1007/bfb0121050openalex-snapshot
On the simplex algorithm for networks and generalized networks
inferredcites →https://doi.org/10.1016/0022-0000(91)90024-yopenalex-snapshot
Expressing combinatorial optimization problems by Linear Programs
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0167-6377(83)90016-0openalex-snapshot
The max-cut problem on graphs not contractible to K5
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0211053openalex-snapshot
On Linear Characterizations of Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1137/s0895480190182666openalex-snapshot
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
inferredcites →https://doi.org/10.1137/s0895480190182678openalex-snapshot
Compositions of Graphs and Polyhedra II: Stable Sets
inferredcites →https://doi.org/10.1145/3828.3829openalex-snapshot
Optimal attack and reinforcement of a network
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/moor.4.4.414openalex-snapshot
Combinatorial Optimization with Rational Objective Functions
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230220507openalex-snapshot
A pseudopolynomial network flow formulation for exact knapsack separation
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_12openalex-snapshot
b-Matchings und T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_12openalex-snapshot
b-Matchings und T-Joins
inferred← citeshttps://doi.org/10.1007/bf01580600openalex-snapshot
On cuts and matchings in planar graphs
inferred← citeshttps://doi.org/10.1007/s10288-010-0122-zopenalex-snapshot
Extended formulations in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10479-012-1269-0openalex-snapshot
Extended formulations in combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00188-ropenalex-snapshot
Computing maximum mean cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90025-jopenalex-snapshot
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.09.005openalex-snapshot
Minimum mean cycle problem in bidirected and skew-symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107299openalex-snapshot
A note on the core of 2-matching games
inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00052-xopenalex-snapshot
A compact linear program for testing optimality of perfect matchings
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot
Chapter 3 Matching
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1090/dimacs/001/01openalex-snapshot
Matrix cones, projection representations, and stable set polyhedra
inferred← citeshttps://doi.org/10.1103/physrevb.49.12864openalex-snapshot
Ground-state magnetization of Ising spin glasses
inferred← citeshttps://doi.org/10.1137/s1052623402420346openalex-snapshot
Subset Algebra Lift Operators for 0-1 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.