On the public citation graph
An Algebraic Matching Algorithm
0 signed · 33 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/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1016/0893-9659(93)90103-topenalex-snapshot
Δ-matroids with the strong exchange conditions
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.1109/sfcs.1996.548466openalex-snapshot
The optimal path-matching problem
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23190openalex-snapshot
Basilica: New canonical decomposition in matching theory
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_8openalex-snapshot
On the Expressive Power of Read-Once Determinants
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_32openalex-snapshot
Fast Deterministic Algorithms for Matrix Completion Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_10openalex-snapshot
Kardinalitätsmaximale Matchings
inferred← citeshttps://doi.org/10.1007/s00037-016-0143-xopenalex-snapshot
Non-commutative Edmonds’ problem and matrix semi-invariants
inferred← citeshttps://doi.org/10.1007/s00453-015-0062-2openalex-snapshot
Greedy Matching: Guarantees and Limitations
inferred← citeshttps://doi.org/10.1007/s00453-016-0142-yopenalex-snapshot
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
inferred← citeshttps://doi.org/10.1007/s10107-006-0053-9openalex-snapshot
Combinatorial algorithms for matchings, even factors and square-free 2-factors
inferred← citeshttps://doi.org/10.1007/s10107-024-02158-0openalex-snapshot
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
inferred← citeshttps://doi.org/10.1007/s101070100256openalex-snapshot
Matching, matroids, and extensions
inferred← citeshttps://doi.org/10.1016/j.aam.2011.04.006openalex-snapshot
Spanning trees of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10210-0openalex-snapshot
Maximum rank matrix completion
inferred← citeshttps://doi.org/10.1109/focs.2016.95openalex-snapshot
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
inferred← citeshttps://doi.org/10.1137/130909214openalex-snapshot
Fast Deterministic Algorithms for Matrix Completion Problems
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.48550/arxiv.1301.1517openalex-snapshot
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04198openalex-snapshot
Greedy Matching: Guarantees and Limitations
inferred← citeshttps://doi.org/10.5555/1109557.1109679openalex-snapshot
The complexity of matrix completion
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.