On the public citation graph
An augmenting path algorithm for linear matroid parity
0 signed · 81 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/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/bf01580672openalex-snapshot
Decomposing symmetric exchanges in matroid bases
inferredcites →https://doi.org/10.1007/bfb0015746openalex-snapshot
Efficient algorithms for graphic matroid intersection and parity
inferredcites →https://doi.org/10.1016/0012-365x(77)90118-2openalex-snapshot
The dependence graph for bases in matroids
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0095-8956(80)90066-0openalex-snapshot
Matroid matching and some applications
inferredcites →https://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50026-xopenalex-snapshot
Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-snapshot
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1137/0211014openalex-snapshot
Complexity of Matroid Property Algorithms
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
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.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
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.1006/jagm.2000.1086openalex-snapshot
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
inferred← citeshttps://doi.org/10.1006/jcss.1996.0054openalex-snapshot
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
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-1-4471-5559-1_34openalex-snapshot
Appendix 1: Network Flows and Matchings
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_6openalex-snapshot
Iterative Compression, and Measure and Conquer, for Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_16openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
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/978-3-642-03367-4_8openalex-snapshot
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
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/bf02564801openalex-snapshot
Searching for a strong double tracing in a graph
inferred← citeshttps://doi.org/10.1007/bf02973441openalex-snapshot
Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane
inferred← citeshttps://doi.org/10.1007/bfb0023489openalex-snapshot
RNC-approximation algorithms for the steiner 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/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/j.aam.2011.04.006openalex-snapshot
Spanning trees of 3-uniform hypergraphs
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.ic.2025.105282openalex-snapshot
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
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/j.orl.2024.107217openalex-snapshot
Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.012openalex-snapshot
Boundary classes for graph problems involving non-local properties
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/s0020-0190(01)00209-5openalex-snapshot
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00039-xopenalex-snapshot
The linear delta-matroid parity problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00037-7openalex-snapshot
Efficient optimal equation formulation in lumped power-conserving systems
inferred← citeshttps://doi.org/10.1109/icnc.2012.81openalex-snapshot
On Minimum Feedback Vertex Sets in Graphs
inferred← citeshttps://doi.org/10.1109/iscas.1988.14885openalex-snapshot
Some algorithmic problems of linear network solvability
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/130949877openalex-snapshot
Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
inferred← citeshttps://doi.org/10.1137/17m1141709openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
inferred← citeshttps://doi.org/10.1137/21m1421751openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
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.1137/s0895480104445009openalex-snapshot
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
inferred← citeshttps://doi.org/10.1145/2213977.2214028openalex-snapshot
Fast matrix rank algorithms and applications
inferred← citeshttps://doi.org/10.1145/2528404openalex-snapshot
Fast matrix rank algorithms and applications
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.1145/44483.44485openalex-snapshot
Finding a maximum-genus graph imbedding
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.1587/transinf.2015edl8021openalex-snapshot
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2327openalex-snapshot
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
inferred← citeshttps://doi.org/10.22028/d291-47560openalex-snapshot
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
inferred← citeshttps://doi.org/10.37236/1492openalex-snapshot
Parity Systems and the Delta-Matroid Intersection Problem
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.19openalex-snapshot
A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1002.3331openalex-snapshot
Spanning trees of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6705openalex-snapshot
Fast Matrix Rank Algorithms and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1511.09464openalex-snapshot
An algebraic approach to enumerating non-equivalent double traces in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09888openalex-snapshot
$E$-restricted Double Traces
inferred← citeshttps://doi.org/10.48550/arxiv.1803.00925openalex-snapshot
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
inferred← citeshttps://doi.org/10.48550/arxiv.1901.04560openalex-snapshot
Minimally Connected Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13371openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00620openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
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.