On the public citation graph

Dual integrality in b-matching problems

https://doi.org/10.1007/bfb0120895
0 signed · 41 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/978-0-8176-4842-8_13openalex-snapshot
The Factors of Graphs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01588228openalex-snapshot
Minimum node covers and 2-bicritical graphs
inferredcites →https://doi.org/10.1007/bf01889914openalex-snapshot
On the structure of factorizable graphs
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.4153/cjm-1952-028-2openalex-snapshot
The Factors of Graphs
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781119272182.ch5openalex-snapshot
Scaffolding Algorithms
inferred← citeshttps://doi.org/10.1002/net.3230130408openalex-snapshot
Dynamic matchings and quasidynamic fractional matchings. II
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_12openalex-snapshot
b-couplages et T-joints
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_12openalex-snapshot
b-Matchings und T-Joins
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-642-25510-6_9openalex-snapshot
Truth, Envy, and Truthful Market Clearing Bundle Pricing
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_56openalex-snapshot
Subgraph Packing — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_13openalex-snapshot
Polyhedral Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_12openalex-snapshot
b-Matchings and T-Joins
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_12openalex-snapshot
b-Matchings and 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/978-88-470-1523-4_12openalex-snapshot
b-Matching e T- Join
inferred← citeshttps://doi.org/10.1007/bf01588228openalex-snapshot
Minimum node covers and 2-bicritical graphs
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/bfb0121007openalex-snapshot
Node-weighted graphs having the König-Egerváry property
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90067-0openalex-snapshot
Total weak unimodularity: testing and applications
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90013-7openalex-snapshot
A note on matchings and separability
inferred← citeshttps://doi.org/10.1016/0167-6377(81)90021-3openalex-snapshot
Total dual integrality and b-matchings
inferred← citeshttps://doi.org/10.1016/1385-7258(78)90034-3openalex-snapshot
On the existence of subgraphs with degree constraints
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50013-1openalex-snapshot
Total Dual Integrality of Linear Inequality Systems
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.10.004openalex-snapshot
An algorithmic approach to dual integrality of matching and extensions
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70105-3openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot
Chapter 3 Matching
inferred← citeshttps://doi.org/10.1080/09720529.2020.1833439openalex-snapshot
Maximum and optimal 1-2 matching problem of the different kind
inferred← citeshttps://doi.org/10.1093/bioinformatics/btv211openalex-snapshot
ScaffMatch: scaffolding algorithm based on maximum weight matching
inferred← citeshttps://doi.org/10.1137/0604022openalex-snapshot
A Minimal Totally Dual Integral Defining System for the b -Matching Polyhedron
inferred← citeshttps://doi.org/10.1145/1993574.1993609openalex-snapshot
Single valued combinatorial auctions with budgets
inferred← citeshttps://doi.org/10.1145/2818357openalex-snapshot
On Multiple Keyword Sponsored Search Auctions with Budgets
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.