On the public citation graph
A practical algorithm for the Menger-type generalization of the independent assignment problem
0 signed · 25 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_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6005-9openalex-snapshot
Network Flow, Transportation and Scheduling - Theory and Algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1017/s030500410004247xopenalex-snapshot
Kruskal's theorem for matroids
inferredcites →https://doi.org/10.1017/s0305004100051677openalex-snapshot
Rado's theorem for polymatroids
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.15807/jorsj.19.32openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
inferredcites →https://doi.org/10.15807/jorsj.20.1openalex-snapshot
A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
inferredcites →https://doi.org/10.15807/jorsj.20.59openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE
inferredcites →https://doi.org/10.2307/2033241openalex-snapshot
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_6openalex-snapshot
Engineering Applications of Matroids - A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferred← citeshttps://doi.org/10.1007/bf02592217openalex-snapshot
Structures of polyhedra determined by submodular functions on crossing families
inferred← citeshttps://doi.org/10.1007/bf03167086openalex-snapshot
Use of the concept of physical dimensions in the structural approach to systems analysis
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50018-0openalex-snapshot
Structural Theory for the Combinatorial Systems Characterized by Submodular Functions
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72458-7openalex-snapshot
Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32805.xopenalex-snapshot
A REVIEW OF RECENT WORK IN JAPAN ON PRINCIPAL PARTITIONS OF MATROIDS AND THEIR APPLICATIONS1
inferred← citeshttps://doi.org/10.1137/s0895480195279994openalex-snapshot
Valuated Matroid Intersection I: Optimality Criteria
inferred← citeshttps://doi.org/10.1137/s0895480195280009openalex-snapshot
Valuated Matroid Intersection II: Algorithms
inferred← citeshttps://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW 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.