On the public citation graph
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
0 signed · 38 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.1002/net.3230100202openalex-snapshot
The k best spanning arborescences of a network
inferredcites →https://doi.org/10.1007/bf02022039openalex-snapshot
K best solutions to combinatorial optimization problems
inferredcites →https://doi.org/10.1007/bf02591988openalex-snapshot
Two algorithms for weighted matroid intersection
inferredcites →https://doi.org/10.1016/0166-218x(87)90017-5openalex-snapshot
Algorithms for finding K-best perfect matchings
inferredcites →https://doi.org/10.1016/0167-6377(84)90083-xopenalex-snapshot
On finding the K best cuts in a network
inferredcites →https://doi.org/10.1016/0196-6774(81)90032-8openalex-snapshot
A weighted matroid intersection algorithm
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1287/mnsc.18.7.401openalex-snapshot
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
inferredcites →https://doi.org/10.1287/opre.16.2.268openalex-snapshot
Solving the Fixed Charge Problem by Ranking the Extreme Points
inferredcites →https://doi.org/10.1287/opre.16.3.682openalex-snapshot
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aama.1998.0618openalex-snapshot
Two-Best Solutions under Distance Constraints: The Model and Exemplary Results for Matroids
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_7openalex-snapshot
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection
inferred← citeshttps://doi.org/10.1007/bf01586055openalex-snapshot
Crashing a maximum-weight complementary basis
inferred← citeshttps://doi.org/10.1007/bf02115754openalex-snapshot
The image of weighted combinatorial problems
inferred← citeshttps://doi.org/10.1007/bf02575795openalex-snapshot
Polymatroids: construction and random algorithms
inferred← citeshttps://doi.org/10.1007/s00186-010-0331-4openalex-snapshot
On generalized balanced optimization problems
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90018-8openalex-snapshot
Random pseudo-polynomial algorithms for exact matroid problems
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90209-ropenalex-snapshot
Random pseudo-polynomial algorithms for some combinatorial programming problems
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00008-eopenalex-snapshot
A bound for the symmetric travelling salesman problem through matroid formulation
inferred← citeshttps://doi.org/10.1016/j.cor.2012.08.014openalex-snapshot
On the K best integer network flows
inferred← citeshttps://doi.org/10.1016/j.omega.2017.06.009openalex-snapshot
Exploring K-best solutions to enrich network design decision-making
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00353-3openalex-snapshot
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
inferred← citeshttps://doi.org/10.1023/a:1015089810198openalex-snapshot
A Symbolic Pole/Zero Extraction Methodology Based on Analysis of Circuit Time-Constants
inferred← citeshttps://doi.org/10.1023/a:1015094011107openalex-snapshot
Approximate Symbolic Analysis of Hierarchically Decomposed Analog Circuits
inferred← citeshttps://doi.org/10.1109/43.662671openalex-snapshot
Efficient approximation of symbolic network functions using matroid intersection algorithms
inferred← citeshttps://doi.org/10.1109/82.728847openalex-snapshot
Symbolic analysis of large analog circuits using a sensitivity-driven enumeration of common spanning trees
inferred← citeshttps://doi.org/10.1109/82.728848openalex-snapshot
Symbolic analysis of large analog integrated circuits: the numerical reference generation problem
inferred← citeshttps://doi.org/10.1109/iscas.1995.523836openalex-snapshot
Efficient approximation of symbolic network functions using matroid intersection algorithms
inferred← citeshttps://doi.org/10.1109/iscas.1996.542147openalex-snapshot
A family of matroid intersection algorithms for the computation of approximated symbolic network functions
inferred← citeshttps://doi.org/10.1109/iscas.1997.621491openalex-snapshot
Comparison of matroid intersection algorithms for large circuit analysis
inferred← citeshttps://doi.org/10.1109/iscas.1998.705012openalex-snapshot
Efficient symbolic analysis of large analog circuits using sensitivity-driven ranking of matroid intersections
inferred← citeshttps://doi.org/10.11606/t.3.2018.tde-13072018-112347openalex-snapshot
Modelos e métodos para estudos de configuração de redes logísticas.
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.