On the public citation graph
The Schrijver system of odd join polyhedra
0 signed · 44 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-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01889914openalex-snapshot
On the structure of factorizable graphs
inferredcites →https://doi.org/10.1007/bf01902352openalex-snapshot
2-Matchings and 2-covers of hypergraphs
inferredcites →https://doi.org/10.1007/bf02579233openalex-snapshot
Brick decompositions and the matching rank of graphs
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02591852openalex-snapshot
Total dual integrality implies local strong unimodularity
inferredcites →https://doi.org/10.1007/bf02592020openalex-snapshot
Finding thet-join structure of graphs
inferredcites →https://doi.org/10.1007/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1016/0012-365x(87)90246-9openalex-snapshot
A quick proof of Seymour's theorem on t-joins
inferredcites →https://doi.org/10.1016/0024-3795(81)90005-7openalex-snapshot
On total dual integrality
inferredcites →https://doi.org/10.1016/0095-8956(77)90031-4openalex-snapshot
The matroids with the max-flow min-cut property
inferredcites →https://doi.org/10.1016/0166-218x(85)90013-7openalex-snapshot
A note on matchings and separability
inferredcites →https://doi.org/10.1016/0167-6377(81)90021-3openalex-snapshot
Total dual integrality and b-matchings
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.1137/0604022openalex-snapshot
A Minimal Totally Dual Integral Defining System for the b -Matching Polyhedron
inferredcites →https://doi.org/10.1287/moor.12.1.97openalex-snapshot
Linear Systems for Constrained Matching Problems
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_9openalex-snapshot
A Refinement of the Frank-Sebő-Tardos Theorem and Its Applications
inferred← citeshttps://doi.org/10.1007/bf02592020openalex-snapshot
Finding thet-join structure of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90032-sopenalex-snapshot
On shortest T-joins and packing T-cuts
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.054openalex-snapshot
The Schrijver system of the flow cone in series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.020openalex-snapshot
The Schrijver system of the length polyhedron of an interval order
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.01.004openalex-snapshot
On the feedback vertex set polytope of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.09.003openalex-snapshot
Trader multiflow and box-TDI systems in series–parallel graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00397-7openalex-snapshot
Minimum T-cuts and optimal T-pairings
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00318-2openalex-snapshot
On a min–max theorem on bipartite graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80189-1openalex-snapshot
On min-max theorems in matching theory
inferred← citeshttps://doi.org/10.1137/s0097539790186704openalex-snapshot
Potentials in Undirected Graphs and Planar Multiflows
inferred← citeshttps://doi.org/10.11606/d.45.1999.tde-20210729-205403openalex-snapshot
T-junções, T-cortes e funções conservativas
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.1287/moor.1030.0070openalex-snapshot
On Metric Generators of Graphs
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
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.