On the public citation graph
Optimum matching forests I: Special weights
0 signed · 42 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/3-540-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01581023openalex-snapshot
Optimum matching forests II: General weights
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/321941.321942openalex-snapshot
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
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.1006/jctb.1998.1817openalex-snapshot
An Efficient Algorithm for Minimum-Weight Bibranching
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_15openalex-snapshot
Parity Constrained k-Edge-Connected Orientations
inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_4openalex-snapshot
"Equation missing" -Integral Points on a Mordell Curve
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_18openalex-snapshot
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_7openalex-snapshot
Networked Distributed Source Coding
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_32openalex-snapshot
Optimal Matching Forests and Valuated Delta-Matroids
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/bf01580854openalex-snapshot
Solving the linear matroid parity problem as a sequence of matroid intersection problems
inferred← citeshttps://doi.org/10.1007/bf01581023openalex-snapshot
Optimum matching forests II: General weights
inferred← citeshttps://doi.org/10.1007/bf01581024openalex-snapshot
Optimum matching forests III: Facets of matching forest polyhedra
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf01916906openalex-snapshot
On a classification of independence systems
inferred← citeshttps://doi.org/10.1007/bf02591726openalex-snapshot
Proving total dual integrality with cross-free families—A general framework
inferred← citeshttps://doi.org/10.1007/bfb0099438openalex-snapshot
Propriétés arithmétiques de fonctions thêta à plusieurs variables
inferred← citeshttps://doi.org/10.1007/s004930070009openalex-snapshot
Total Dual Integrality of Matching Forest Constraints
inferred← citeshttps://doi.org/10.1007/s11425-009-0041-7openalex-snapshot
Fundamental cycles and graph embeddings
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90115-qopenalex-snapshot
Structural properties of matroid matchings
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112651openalex-snapshot
Equitable partitions into matchings and coverings in mixed graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00671-4openalex-snapshot
A Vizing-type theorem for matching forests
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72956-6openalex-snapshot
Independence Systems and Perfect K-Matroid-Intersections
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00276-5openalex-snapshot
The sagitta method for solving linear programs
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1109/isit.2008.4595403openalex-snapshot
Rate and power allocation under the pairwise distributed source coding constraint
inferred← citeshttps://doi.org/10.1109/tcomm.2009.12.080519openalex-snapshot
Rate and power allocation under the pairwise distributed source coding constraint
inferred← citeshttps://doi.org/10.1137/110827661openalex-snapshot
Optimal Matching Forests and Valuated Delta-Matroids
inferred← citeshttps://doi.org/10.46298/dmtcs.8719openalex-snapshot
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.0807.2292openalex-snapshot
Rate and power allocation under the pairwise distributed source coding constraint
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.