On the public citation graph
Solving the linear matroid parity problem as a sequence of matroid intersection problems
0 signed · 46 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-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01581022openalex-snapshot
Optimum matching forests I: Special weights
inferredcites →https://doi.org/10.1007/bf02579169openalex-snapshot
An augmenting path algorithm for linear matroid parity
inferredcites →https://doi.org/10.1007/bf02579340openalex-snapshot
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
inferredcites →https://doi.org/10.1016/0095-8956(80)90066-0openalex-snapshot
Matroid matching and some applications
inferredcites →https://doi.org/10.1016/0095-8956(86)90085-7openalex-snapshot
An extension of matching theory
inferredcites →https://doi.org/10.1016/0095-8956(88)90068-8openalex-snapshot
General factors of graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90115-qopenalex-snapshot
Structural properties of matroid matchings
inferredcites →https://doi.org/10.1109/sfcs.1984.715918openalex-snapshot
An Augmenting Path Algorithm For The Parity Problem On Linear Matroids
inferredcites →https://doi.org/10.1137/0117070openalex-snapshot
Optimal Sequencing of Two Equivalent Processors
inferredcites →https://doi.org/10.1137/0211014openalex-snapshot
Complexity of Matroid Property Algorithms
inferredcites →https://doi.org/10.14232/issn.0001-6969openalex-snapshot
Acta Scientiarum Mathematicarum
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/cta.70409openalex-snapshot
Index Analysis of Differential‐Algebraic Equation Models for Electric Circuits With Gyrators
inferred← citeshttps://doi.org/10.1007/11753728_10openalex-snapshot
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_248openalex-snapshot
A 2/3-approximation of the matroid matching problem
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_17openalex-snapshot
A Fast, Simpler Algorithm for the Matroid Parity Problem
inferred← citeshttps://doi.org/10.1007/s11590-017-1217-7openalex-snapshot
Weighted matching with pair restrictions
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90037-xopenalex-snapshot
Fractional matroid matchings
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90115-qopenalex-snapshot
Structural properties of matroid matchings
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.049openalex-snapshot
On matroid parity and matching polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.076openalex-snapshot
Matroid matching with Dilworth truncation
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.05.004openalex-snapshot
An algorithm for weighted fractional matroid matching
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00219-3openalex-snapshot
Matching 2-lattice polyhedra: finding a maximum vector
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00220-xopenalex-snapshot
Two-lattice polyhedra: duality and extreme points
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00039-xopenalex-snapshot
The linear delta-matroid parity problem
inferred← citeshttps://doi.org/10.1137/1.9781611973082.105openalex-snapshot
Algebraic Algorithms for Linear Matroid Parity Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch161openalex-snapshot
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
inferred← citeshttps://doi.org/10.1137/11083232xopenalex-snapshot
Matroid Matching: The Power of Local Search
inferred← citeshttps://doi.org/10.1137/110860070openalex-snapshot
Matching Problems with Delta-Matroid Constraints
inferred← citeshttps://doi.org/10.1137/17m1141709openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
inferred← citeshttps://doi.org/10.1137/22m1494804openalex-snapshot
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
inferred← citeshttps://doi.org/10.1137/22m1537096openalex-snapshot
Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank
inferred← citeshttps://doi.org/10.1145/2601066openalex-snapshot
Algebraic Algorithms for Linear Matroid Parity Problems
inferred← citeshttps://doi.org/10.1145/3055399.3055436openalex-snapshot
A weighted linear matroid parity algorithm
inferred← citeshttps://doi.org/10.15807/jorsj.44.194openalex-snapshot
A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13371openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
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.