On the public citation graph
The optimal path-matching problem
0 signed · 55 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/bf01581694openalex-snapshot
A separation algorithm for the matchable set polytope
inferredcites →https://doi.org/10.1007/bf02125345openalex-snapshot
The perfectly Matchable Subgraph Polytope of an arbitrary graph
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1016/0095-8956(83)90011-4openalex-snapshot
Short proofs on the matching polyhedron
inferredcites →https://doi.org/10.1016/0095-8956(84)90023-6openalex-snapshot
Testing membership in matroid polyhedra
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
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.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
inferredcites →https://doi.org/10.6028/jres.069b.016openalex-snapshot
Transversals and matroid partition
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra
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.10175openalex-snapshot
A Gallai–Edmonds‐type structure theorem for path‐matchings
inferred← citeshttps://doi.org/10.1002/net.10030openalex-snapshot
Length‐constrained path‐matchings in graphs
inferred← citeshttps://doi.org/10.1007/11496915_6openalex-snapshot
A Combinatorial Algorithm to Find a Maximum Even Factor
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_2openalex-snapshot
A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms
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-319-59250-3_35openalex-snapshot
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_20openalex-snapshot
The Path-Packing Structure of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_31openalex-snapshot
On Polyhedra Related to Even Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_40openalex-snapshot
A Faster Algorithm for the Maximum Even Factor Problem
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_25openalex-snapshot
Hypo-matchings in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9642-6openalex-snapshot
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings
inferred← citeshttps://doi.org/10.1007/s00493-006-0020-3openalex-snapshot
Symplectic Spaces And Ear-Decomposition Of Matroids
inferred← citeshttps://doi.org/10.1007/s00493-007-2131-xopenalex-snapshot
Matchings of cycles and paths in directed graphs
inferred← citeshttps://doi.org/10.1007/s004930200003openalex-snapshot
Graph Orientations with Edge-connection and Parity Constraints
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-007-0154-0openalex-snapshot
A weighted even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10107-010-0397-zopenalex-snapshot
A weighted independent even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10107-021-01642-1openalex-snapshot
Matroid bases with cardinality constraints on the intersection
inferred← citeshttps://doi.org/10.1007/s101070100256openalex-snapshot
Matching, matroids, and extensions
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.01.001openalex-snapshot
Facets of the independent path-matching polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100582openalex-snapshot
Spectral aspects of symmetric matrix signings
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.01.001openalex-snapshot
On the maximum even factor in weakly symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.05.001openalex-snapshot
Even factors, jump systems, and discrete convexity
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12005-2openalex-snapshot
Primal Integer Programming
inferred← citeshttps://doi.org/10.1109/focs.2006.8openalex-snapshot
Algebraic Structures and Algorithms for Matching and Matroid Problems
inferred← citeshttps://doi.org/10.1109/isit.2015.7282706openalex-snapshot
When does an ensemble of matrices with randomly scaled rows lose rank?
inferred← citeshttps://doi.org/10.1109/sws.2009.5271774openalex-snapshot
Forbidden subgraph and perfect path-matchings
inferred← citeshttps://doi.org/10.1109/tit.2017.2737010openalex-snapshot
Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory
inferred← citeshttps://doi.org/10.1137/060657066openalex-snapshot
The Independent Even Factor Problem
inferred← citeshttps://doi.org/10.1137/070684008openalex-snapshot
Algebraic Algorithms for Matching and Matroid Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973082.105openalex-snapshot
Algebraic Algorithms for Linear Matroid Parity Problems
inferred← citeshttps://doi.org/10.1137/18m1176737openalex-snapshot
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
inferred← citeshttps://doi.org/10.1145/1159876.1159883openalex-snapshot
A separate compilation extension to standard ML
inferred← citeshttps://doi.org/10.1145/2601066openalex-snapshot
Algebraic Algorithms for Linear Matroid Parity 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.1501.07544openalex-snapshot
When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601026openalex-snapshot
Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version)
inferred← citeshttps://doi.org/10.5555/1283383.1283509openalex-snapshot
The independent even factor problem
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.