On the public citation graph
Matroid intersection algorithms
0 signed · 156 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/0012-365x(73)90078-2openalex-snapshot
A matroid generalization of a theorem of Mendelsohn and Dulmage
inferredcites →https://doi.org/10.1090/s0002-9947-1971-0286689-5openalex-snapshot
Matching Theory for Combinatorial Geometries
inferredcites →https://doi.org/10.1112/jlms/s2-2.2.251openalex-snapshot
On Matroid Theorems of Edmonds and Rado
inferredcites →https://doi.org/10.15807/jorsj.19.32openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets
inferredcites →https://doi.org/10.6028/jres.069b.016openalex-snapshot
Transversals and matroid partition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4641131openalex-extracted
Quantum and Classical Query Complexities for Determining Connectedness of Matroids
inferred← citeshttps://doi.org/10.1002/cta.4490070105openalex-snapshot
Unique solvability and order of complexity of linear networks containing memoryless n ‐ports
inferred← citeshttps://doi.org/10.1002/net.20430openalex-snapshot
On the cardinality constrained matroid polytope
inferred← citeshttps://doi.org/10.1002/net.3230120102openalex-snapshot
Minimum cost flow with set‐constraints
inferred← citeshttps://doi.org/10.1002/net.3230130211openalex-snapshot
Centralized teleprocessing network design
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_36openalex-snapshot
The complexity of restricted minimum spanning tree problems
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/978-0-387-34883-4_14openalex-snapshot
A Generalization of the multiple UIO method of test sequence selection for protocols represented in FSM
inferred← citeshttps://doi.org/10.1007/978-3-030-28730-6_3openalex-snapshot
Keys in Relational Databases with Nulls and Bounded Domains
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_22openalex-snapshot
Online Combinatorial Assignment in Independence Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_24openalex-snapshot
Polynomial Kernels with Reachability for Weighted d-Matroid Intersection
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_25openalex-snapshot
A Weighted-to-Unweighted Reduction for Matroid Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_53openalex-snapshot
The Popular Matching and Condensation Problems Under Matroid Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-39611-6_21openalex-snapshot
Range Assignment for High Connectivity in Wireless Ad Hoc Networks
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-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_36openalex-snapshot
Clustered Planarity Testing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-7091-2748-3_6openalex-snapshot
Complexity of Optimum Undirected Tree Problems: A Survey of Recent Results
inferred← citeshttps://doi.org/10.1007/978-3-7091-2748-3_7openalex-snapshot
An Introduction to Polymatroidal Network Flows
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_9openalex-snapshot
Algorithms for Polymatroid Optimization
inferred← citeshttps://doi.org/10.1007/bf00268499openalex-snapshot
Edge-disjoint spanning trees and depth-first search
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/bf01581030openalex-snapshot
Boolean sublattices connected with minimization problems on matroids
inferred← citeshttps://doi.org/10.1007/bf01586055openalex-snapshot
Crashing a maximum-weight complementary basis
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf01609023openalex-snapshot
The Held—Karp algorithm and degree-constrained minimum 1-trees
inferred← citeshttps://doi.org/10.1007/bf01720281openalex-snapshot
The ellipsoid method and its implications
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf01864166openalex-snapshot
Structural theorems for submodular functions, polymatroids and polymatroid intersections
inferred← citeshttps://doi.org/10.1007/bfb0120896openalex-snapshot
A technique for determining blocking and anti-blocking polyhedral descriptions
inferred← citeshttps://doi.org/10.1007/s001860200198openalex-snapshot
Exponential irreducible neighborhoods for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s001860300301openalex-snapshot
Characterizing matchings as the intersection of matroids
inferred← citeshttps://doi.org/10.1007/s00453-008-9184-0openalex-snapshot
A Detachment Algorithm for Inferring a Graph from Path Frequency
inferred← citeshttps://doi.org/10.1007/s00453-023-01184-2openalex-snapshot
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
inferred← citeshttps://doi.org/10.1007/s10107-010-0397-zopenalex-snapshot
A weighted independent even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10107-018-1260-xopenalex-snapshot
Exact and Approximation Algorithms for Weighted Matroid Intersection
inferred← citeshttps://doi.org/10.1007/s10107-019-01377-0openalex-snapshot
Packing of arborescences with matroid constraints via matroid intersection
inferred← citeshttps://doi.org/10.1007/s10107-021-01625-2openalex-snapshot
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
inferred← citeshttps://doi.org/10.1007/s10107-025-02213-4openalex-snapshot
Online combinatorial assignment in independence systems
inferred← citeshttps://doi.org/10.1007/s10878-015-9965-8openalex-snapshot
The popular matching and condensation problems under matroid constraints
inferred← citeshttps://doi.org/10.1007/s11036-006-4466-8openalex-snapshot
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s13160-012-0072-2openalex-snapshot
Shortest bibranchings and valuated matroid intersection
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.1007/s13160-020-00413-3openalex-snapshot
On a weighted linear matroid intersection algorithm by Deg-Det computation
inferred← citeshttps://doi.org/10.1007/s13740-020-00113-8openalex-snapshot
Strongly Possible Keys for SQL
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90083-3openalex-snapshot
Heuristically guided algorithm for k-parity matroid problems
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90181-8openalex-snapshot
Independence systems with continuous cardinality of bases
inferred← citeshttps://doi.org/10.1016/0020-0190(74)90024-6openalex-snapshot
A good algorithm for edge-disjoint branching
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90021-6openalex-snapshot
Bounds for 3-matroid intersection problems
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90037-xopenalex-snapshot
Fractional matroid matchings
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90113-oopenalex-snapshot
Paroids: a canonical format for combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00088-uopenalex-snapshot
Finding all common bases in two matroids
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90032-8openalex-snapshot
A weighted matroid intersection algorithm
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
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/b978-0-12-566780-7.50025-8openalex-snapshot
Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
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.dam.2013.08.016openalex-snapshot
On a base exchange game on bispanning graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.006openalex-snapshot
Colorful linear programming, Nash equilibrium, and pivots
inferred← citeshttps://doi.org/10.1016/j.dam.2020.02.005openalex-snapshot
The b -branching problem in digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.001openalex-snapshot
Finding spanning trees with perfect matchings
inferred← citeshttps://doi.org/10.1016/j.dam.2026.07.027openalex-snapshot
Optimization of the directed spanning trees using the weighted matroid intersection algorithm
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.ipl.2022.106340openalex-snapshot
Analyzing Residual Random Greedy for monotone submodular maximization
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103758openalex-snapshot
Quantum and classical query complexities for determining connectedness of matroids
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/j.laa.2020.06.030openalex-snapshot
Alternating signed bipartite graphs and difference-1 colourings
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.035openalex-snapshot
Approximation by lexicographically maximal solutions in matching and matroid intersection problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00183-1openalex-snapshot
Minimum cost source location problem with vertex-connectivity requirements in digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00279-1openalex-snapshot
Persistency in combinatorial optimization problems on matroids
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70759-3openalex-snapshot
Some Partial Orders Related to Boolean Optimization and the Greedy Algorithm
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70877-xopenalex-snapshot
The Concavity and Intersection Properties for Integral Polyhedra
inferred← citeshttps://doi.org/10.1023/a:1025141912243openalex-snapshot
Independent-Tree Ad hoc MulticAst Routing (ITAMAR)
inferred← citeshttps://doi.org/10.1080/00207179.2018.1519600openalex-snapshot
Input matrix construction and approximation using a graphic approach
inferred← citeshttps://doi.org/10.1080/10556789808805720openalex-snapshot
Computing the combinatorial canonical form of a layered mixed matrix
inferred← citeshttps://doi.org/10.1109/12.844345openalex-snapshot
A matroid-theoretic solution to an assignment problem in the conformance testing of communication protocols
inferred← citeshttps://doi.org/10.1109/59.65924openalex-snapshot
Qualitative methods to solve qualitative problems in power system state estimation
inferred← citeshttps://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
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/focs.2015.68openalex-snapshot
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00100openalex-snapshot
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197249openalex-snapshot
Optimizing Topologies for Probabilistically Secure Multi-Robot Systems
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796753openalex-snapshot
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures
inferred← citeshttps://doi.org/10.1109/tcs.1979.1084645openalex-snapshot
Investigating solvability and complexity of linear active networks by means of matroids
inferred← citeshttps://doi.org/10.1109/tie.2014.2331020openalex-snapshot
On the Use of Matroid Theory for Distributed Cyber–Physical-Constrained Generator Scheduling in Smart Grid
inferred← citeshttps://doi.org/10.1109/ton.2026.3665595openalex-snapshot
Optimal Shielding to Guarantee Region-Based Connectivity Between Multiple Pairs of Nodes
inferred← citeshttps://doi.org/10.1109/vtc.2001.956840openalex-snapshot
Independent-tree ad hoc multicast routing (ITAMAR)
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/0215066openalex-snapshot
Improved Bounds for Matroid Partition and Intersection Algorithms
inferred← citeshttps://doi.org/10.1137/0218008openalex-snapshot
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
inferred← citeshttps://doi.org/10.1137/0329048openalex-snapshot
Structure at Infinity of Structured Descriptor Systems and Its Applications
inferred← citeshttps://doi.org/10.1137/0402002openalex-snapshot
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
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/080734340openalex-snapshot
Additive Guarantees for Degree-Bounded Directed Network Design
inferred← citeshttps://doi.org/10.1137/120878732openalex-snapshot
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
inferred← citeshttps://doi.org/10.1137/17m1141709openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
inferred← citeshttps://doi.org/10.1137/18m1190823openalex-snapshot
Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
inferred← citeshttps://doi.org/10.1137/22m147685xopenalex-snapshot
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection
inferred← citeshttps://doi.org/10.1137/22m152579xopenalex-snapshot
Matroid Intersection under Restricted Oracles
inferred← citeshttps://doi.org/10.1137/s0895480195280009openalex-snapshot
Valuated Matroid Intersection II: Algorithms
inferred← citeshttps://doi.org/10.1145/103418.103436openalex-snapshot
A matroid approach to finding edge connectivity and packing arborescences
inferred← citeshttps://doi.org/10.1145/1374376.1374486openalex-snapshot
Additive guarantees for degree bounded directed network design
inferred← citeshttps://doi.org/10.1145/322307.322309openalex-snapshot
The complexity of restricted spanning tree problems
inferred← citeshttps://doi.org/10.1145/3406325.3451092openalex-snapshot
Breaking the quadratic barrier for matroid intersection
inferred← citeshttps://doi.org/10.1145/3564246.3585219openalex-snapshot
Fast Algorithms via Dynamic-Oracle Matroids
inferred← citeshttps://doi.org/10.1287/moor.1.4.311openalex-snapshot
D. Ray Fulkerson's Contributions to Operations Research
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
inferred← citeshttps://doi.org/10.15807/jorsj.29.305openalex-snapshot
ON THE REPRESENTATION OF THE RIGID SUB-SYSTEMS OF A PLANE LINK SYSTEM
inferred← citeshttps://doi.org/10.15807/jorsj.38.124openalex-snapshot
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
inferred← citeshttps://doi.org/10.15807/jorsj.56.15openalex-snapshot
MATROID INTERSECTION WITH PRIORITY CONSTRAINTS
inferred← citeshttps://doi.org/10.2139/ssrn.7365670openalex-snapshot
Faster Approximate Linear Matroid Intersection
inferred← citeshttps://doi.org/10.2298/yjor0201001copenalex-snapshot
Finding minimal branchings with a given number of arcs
inferred← citeshttps://doi.org/10.26686/wgtn.17005114openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.26686/wgtn.17005114.v1openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.4036/iis.2014.51openalex-snapshot
Arborescence Problems in Directed Graphs: Theorems and Algorithms
inferred← citeshttps://doi.org/10.4171/jems/1350openalex-snapshot
Simplicial generation of Chow rings of matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3022openalex-snapshot
Toward the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13371openalex-snapshot
A Weighted Linear Matroid Parity Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1911.10765openalex-snapshot
Faster Matroid Intersection
inferred← citeshttps://doi.org/10.48550/arxiv.2105.05673openalex-snapshot
Breaking O(nr) for Matroid Intersection
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.5075/epfl-thesis-9277openalex-snapshot
On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing
inferred← citeshttps://doi.org/10.5555/1283383.1283430openalex-snapshot
An algebraic algorithm for weighted linear matroid intersection
inferred← citeshttps://doi.org/10.5555/1283383.1283509openalex-snapshot
The independent even factor problem
inferred← citeshttps://doi.org/10.5555/2133036.2133118openalex-snapshot
Multi-budgeted matchings and matroid intersection via dependent rounding
inferred← citeshttps://doi.org/10.5555/2884435.2884468openalex-snapshot
A fast approximation for maximum weight matroid intersection
inferred← citeshttps://doi.org/10.70675/229025d0z64e4z4bbcza3f5zb5dae67e8689openalex-snapshot
Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra
inferred← citeshttps://doi.org/10.70675/e861bc4ez3d7az401eza086zef533c95d4f2openalex-snapshot
Algorithmes en temps polynomial pour les semi-bandits combinatoires : apprentissage par renforcement efficace dans des environnements complexes
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.