On the public citation graph
Efficient algorithms for graphic matroid intersection and parity
0 signed · 69 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.3230140209openalex-snapshot
A quick method for finding shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1109/sfcs.1984.715918openalex-snapshot
An Augmenting Path Algorithm For The Parity Problem On Linear Matroids
inferredcites →https://doi.org/10.1109/tct.1970.1083056openalex-snapshot
A constructive graph-theoretic solution of the Shannon switching game
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/800061.808753openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.1287/moor.10.4.701openalex-snapshot
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
inferredcites →https://doi.org/10.1287/moor.7.3.334openalex-snapshot
Computing Maximal “Polymatroidal” Network Flows
inferredcites →https://doi.org/10.15807/jorsj.26.186openalex-snapshot
NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1006/jcss.1996.0054openalex-snapshot
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
inferred← citeshttps://doi.org/10.1007/11753728_10openalex-snapshot
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
inferred← citeshttps://doi.org/10.1007/11821069_42openalex-snapshot
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_14openalex-snapshot
An Orientation Theorem with Parity Conditions
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_76openalex-snapshot
Finding the k smallest spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_67openalex-snapshot
Graph ear decompositions and graph embeddings
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_144openalex-snapshot
Fully Dynamic Transitive Closure in plane dags with one source and one sink
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_148openalex-snapshot
Finding large planar subgraphs and large subgraphs of a given genus
inferred← citeshttps://doi.org/10.1007/978-3-319-74180-2_20openalex-snapshot
On the Simultaneous Minimum Spanning Trees Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_6openalex-snapshot
Min-Power Strong Connectivity
inferred← citeshttps://doi.org/10.1007/bf01758774openalex-snapshot
Forests, frames, and games: Algorithms for matroid sums and applications
inferred← citeshttps://doi.org/10.1007/bf01994879openalex-snapshot
Finding thek smallest spanning trees
inferred← citeshttps://doi.org/10.1007/bf02579169openalex-snapshot
An augmenting path algorithm for linear matroid parity
inferred← citeshttps://doi.org/10.1007/bfb0028278openalex-snapshot
Offline algorithms for dynamic minimum spanning tree problems
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/s10878-007-9044-xopenalex-snapshot
Approximation algorithms and hardness results for labeled connectivity problems
inferred← citeshttps://doi.org/10.1007/s10878-014-9738-9openalex-snapshot
1.61-approximation for min-power strong connectivity with two power levels
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90074-aopenalex-snapshot
Bidirectional retracting-free double tracings and upper embeddability of graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90027-7openalex-snapshot
On-line updating of solutions to a class of matroid intersection problems
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.aam.2011.04.006openalex-snapshot
Spanning trees of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.009openalex-snapshot
An improved algorithm for finding maximum outerplanar subgraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00213-xopenalex-snapshot
An orientation theorem with parity conditions
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00241-9openalex-snapshot
Local search for the minimum label spanning tree problem with bounded color classes
inferred← citeshttps://doi.org/10.1088/0957-0233/17/6/022openalex-snapshot
Finding minimum spanning trees more efficiently for tile-based phase unwrapping
inferred← citeshttps://doi.org/10.1109/icnc.2012.81openalex-snapshot
On Minimum Feedback Vertex Sets in Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63463openalex-snapshot
Efficient algorithms for independent assignment on graphic and linear matroids
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
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/1.9781611973082.105openalex-snapshot
Algebraic Algorithms for Linear Matroid Parity Problems
inferred← citeshttps://doi.org/10.1137/21m1434441openalex-snapshot
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
inferred← citeshttps://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/s0895480196304234openalex-snapshot
Graph Ear Decompositions and Graph Embeddings
inferred← citeshttps://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferred← citeshttps://doi.org/10.1145/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/3108240openalex-snapshot
A Data Structure for Nearest Common Ancestors with Linking
inferred← citeshttps://doi.org/10.1145/3564246.3585219openalex-snapshot
Fast Algorithms via Dynamic-Oracle Matroids
inferred← citeshttps://doi.org/10.1145/44483.44485openalex-snapshot
Finding a maximum-genus graph imbedding
inferred← citeshttps://doi.org/10.1145/62212.62252openalex-snapshot
Forests, frames, and games: algorithms for matroid sums and applications
inferred← citeshttps://doi.org/10.1587/transinf.2015edl8021openalex-snapshot
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2327openalex-snapshot
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-19-3-5openalex-snapshot
Irreversible 2-conversion set in graphs of bounded degree
inferred← citeshttps://doi.org/10.46298/dmtcs.423openalex-snapshot
On the k-restricted structure ratio in planar and outerplanar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1002.3331openalex-snapshot
Spanning trees of 3-uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07055openalex-snapshot
A Data Structure for Nearest Common Ancestors with Linking
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06713openalex-snapshot
On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs
inferred← citeshttps://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
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.