On the public citation graph

A separation algorithm for the matchable set polytope

https://doi.org/10.1007/bf01581694
0 signed · 21 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-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/bf01205074openalex-snapshot
b-matching degree-sequence polyhedra
inferredcites →https://doi.org/10.1007/bf02125345openalex-snapshot
The perfectly Matchable Subgraph Polytope of an arbitrary graph
inferredcites →https://doi.org/10.1007/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0066196openalex-snapshot
Facets of I-matching polyhedra
inferredcites →https://doi.org/10.1016/0167-6377(87)90027-7openalex-snapshot
On T-joins and odd factors
inferredcites →https://doi.org/10.1016/0167-6377(87)90055-1openalex-snapshot
On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
inferredcites →https://doi.org/10.1038/184320b0openalex-snapshot
Journal of Research of the National Bureau of Standards
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.1007/3-540-45535-3_13openalex-snapshot
Bisubmodular Function Minimization
inferred← citeshttps://doi.org/10.1007/bf01215915openalex-snapshot
The optimal path-matching problem
inferred← citeshttps://doi.org/10.1007/s10107-008-0242-9openalex-snapshot
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.006openalex-snapshot
Matchability and k -maximal matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114018openalex-snapshot
Perfectly matchable set polynomials and h⁎-polynomials for stable set polytopes of complements of graphs
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot
Chapter 3 Matching
inferred← citeshttps://doi.org/10.1051/ro/2010004openalex-snapshot
Perfectly matchable subgraph problem on a bipartite graph
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548466openalex-snapshot
The optimal path-matching problem
inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot
Bisubmodular Function Minimization
inferred← citeshttps://doi.org/10.1287/moor.28.1.92.14263openalex-snapshot
A Separation Algorithm for b -Matching Degree-Sequence Polyhedra
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.