On the public citation graph
Forests, frames, and games: Algorithms for matroid sums and applications
0 signed · 165 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.3230120206openalex-snapshot
A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theory
inferredcites →https://doi.org/10.1007/978-3-662-22143-3openalex-snapshot
Matroid Theory and its Applications in Electric Network Theory and in Statics
inferredcites →https://doi.org/10.1007/bf01534980openalex-snapshot
On graphs and rigidity of plane skeletal structures
inferredcites →https://doi.org/10.1007/bfb0015746openalex-snapshot
Efficient algorithms for graphic matroid intersection and parity
inferredcites →https://doi.org/10.1016/0020-0190(83)90031-5openalex-snapshot
Connectivity and edge-disjoint spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(88)90089-0openalex-snapshot
A linear-time algorithm for finding a minimum spanning pseudoforest
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0024-3795(71)90026-7openalex-snapshot
The principal minors of a matroid
inferredcites →https://doi.org/10.1016/0095-8956(84)90016-9openalex-snapshot
Rigidity of multi-graphs. I. Linking rigid bodies in n-space
inferredcites →https://doi.org/10.1016/0196-6774(88)90031-4openalex-snapshot
Algorithms for two bottleneck optimization problems
inferredcites →https://doi.org/10.1016/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1080/00207728108963728openalex-snapshot
Use of matroid theory in operations research, circuits and systems theory
inferredcites →https://doi.org/10.1109/tct.1969.1082966openalex-snapshot
Maximally Distant Trees and Principal Partition of a Linear Graph
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.1109/tct.1970.1083186openalex-snapshot
Topological degrees of freedom and mixed analysis of electrical networks
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.221openalex-snapshot
On the Problem of Decomposing a Graph into n Connected Factors
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A 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/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1137/0401025openalex-snapshot
The Union of Matroids and the Rigidity of Frameworks
inferredcites →https://doi.org/10.1137/0608001openalex-snapshot
The Algebraic Geometry of Motions of Bar-and-Body Frameworks
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/62212.62263openalex-snapshot
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
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.15807/jorsj.26.186openalex-snapshot
NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
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.005openalex-snapshot
Lehmans switching game and a theorem of Tutte and Nash-Williams
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.4854454openalex-extracted
Properties of Euclidean Minimum Weight (K,L)-Tight Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22890openalex-snapshot
Orientation‐based edge‐colorings and linear arboricity of multigraphs
inferred← citeshttps://doi.org/10.1006/jagm.1997.0904openalex-snapshot
Algorithms for Graphic Polymatroids and Parametrics-Sets
inferred← citeshttps://doi.org/10.1006/jctb.1998.1863openalex-snapshot
An Algorithm for Packing Connectors
inferred← citeshttps://doi.org/10.1007/10692760_26openalex-snapshot
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_34openalex-snapshot
Dynamic Representations of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_58openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_67openalex-snapshot
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-1385-2_10openalex-snapshot
Secret Key Generation Among Multiple Terminals with Applications to Wireless Systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-7738-9_3openalex-snapshot
Failure Localization Via a Central Controller
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_5openalex-snapshot
A Constructive Arboricity Approximation Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_30openalex-snapshot
The Linear Arboricity Conjecture for 3-Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_45openalex-snapshot
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_20openalex-snapshot
Supereulerian Testing on Semi-Eulerian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_11openalex-snapshot
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_40openalex-snapshot
Trees, Paths, Stars, Caterpillars and Spiders
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_41openalex-snapshot
Scheduling with Interjob Communication on Parallel Processors
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_6openalex-snapshot
Parameterized Complexity of Geometric Covering Problems Having Conflicts
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_22openalex-snapshot
A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_28openalex-snapshot
An Inductive Construction for Plane Laman Graphs via Vertex Splitting
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_10openalex-snapshot
Algorithms for Graph Rigidity and Scene Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_41openalex-snapshot
Partitions of Graphs into Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_17openalex-snapshot
The Minimum Weight In-Tree Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_2openalex-snapshot
A Proof of the Molecular Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_17openalex-snapshot
A Rooted-Forest Partition with Uniform Vertex Demand
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_42openalex-snapshot
Constant-Time Algorithms for Sparsity Matroids
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_24openalex-snapshot
Approximating Infeasible 2VPI-Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_45openalex-snapshot
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
inferred← citeshttps://doi.org/10.1007/978-981-95-2885-1_8openalex-snapshot
Cost-Efficient Hashing Index for Cloud Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-2885-1_9openalex-snapshot
Mitigating Asymmetric Read and Write Costs in System Design
inferred← citeshttps://doi.org/10.1007/978-981-99-7184-8_7openalex-snapshot
The Theory of Fair Allocation Under Structured Set Constraints
inferred← citeshttps://doi.org/10.1007/bf01585865openalex-snapshot
Random sampling and greedy sparsification for matroid optimization problems
inferred← citeshttps://doi.org/10.1007/bf01585866openalex-snapshot
Packing algorithms for arborescences (and spanning trees) in capacitated graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0834-4openalex-snapshot
Sparsity-certifying Graph Decompositions
inferred← citeshttps://doi.org/10.1007/s00453-007-0170-8openalex-snapshot
Rigid Components in Molecular Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9531-4openalex-snapshot
Minimize the Maximum Duty in Multi-interface Networks
inferred← citeshttps://doi.org/10.1007/s00453-016-0237-5openalex-snapshot
Trees, Paths, Stars, Caterpillars and Spiders
inferred← citeshttps://doi.org/10.1007/s00453-017-0328-yopenalex-snapshot
On the Planar Split Thickness of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00600-wopenalex-snapshot
Parameterized Complexity of Geometric Covering Problems Having Conflicts
inferred← citeshttps://doi.org/10.1007/s00454-010-9283-yopenalex-snapshot
Slider-Pinning Rigidity: a Maxwell–Laman-Type Theorem
inferred← citeshttps://doi.org/10.1007/s00454-011-9348-6openalex-snapshot
A Proof of the Molecular Conjecture
inferred← citeshttps://doi.org/10.1007/s10878-010-9367-xopenalex-snapshot
A rooted-forest partition with uniform vertex demand
inferred← citeshttps://doi.org/10.1007/s10878-018-0325-3openalex-snapshot
Scheduling with interjob communication on parallel processors
inferred← citeshttps://doi.org/10.1007/s11277-010-0118-1openalex-snapshot
Spatial Link Scheduling for SCDMA Multihop Cellular Networks: A Cross Layer Framework
inferred← citeshttps://doi.org/10.1016/j.adhoc.2011.06.016openalex-snapshot
Theoretic analysis of unique localization for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102036openalex-snapshot
Straight-line drawings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102186openalex-snapshot
Decomposition of geometric graphs into star-forests
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.013openalex-snapshot
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
inferred← citeshttps://doi.org/10.1016/j.dam.2025.09.011openalex-snapshot
Properties of Euclidean minimum weight ( k , ℓ ) -tight graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.025openalex-snapshot
Hypergraph partitioning into hyperforests
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113222openalex-snapshot
On some algorithmic aspects of hypergraphic matroids
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.03.004openalex-snapshot
Combinatorial optimization with interaction costs: Complexity and solvable cases
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.12.018openalex-snapshot
Sparse hypergraphs and pebble game algorithms
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2018.10.023openalex-snapshot
Algorithmic problems in right-angled Artin groups: Complexity and applications
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.12.007openalex-snapshot
A characterisation of the generic rigidity of 2-dimensional point–line frameworks
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.009openalex-snapshot
Towards the linear arboricity conjecture
inferred← citeshttps://doi.org/10.1016/j.orl.2005.10.005openalex-snapshot
Source location with rigidity and tree packing requirements
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00007-3openalex-snapshot
Efficient computation of implicit representations of sparse graphs
inferred← citeshttps://doi.org/10.1016/s0169-7552(98)00259-1openalex-snapshot
Convergence routing on disjoint spanning trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00225-9openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1080/00029890.1996.12004732openalex-snapshot
Strategies for the Shannon Switching Game
inferred← citeshttps://doi.org/10.1088/0305-4470/29/24/030openalex-snapshot
An efficient algorithm for testing the generic rigidity of graphs in the plane
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797559openalex-snapshot
Common Randomness, Multiuser Secrecy and Tree Packing
inferred← citeshttps://doi.org/10.1109/cvpr.2019.01140openalex-snapshot
MAP Inference via Block-Coordinate Frank-Wolfe Algorithm
inferred← citeshttps://doi.org/10.1109/glocom.1994.513401openalex-snapshot
Design and performance of convergence routing on multiple spanning trees
inferred← citeshttps://doi.org/10.1109/glocom.2007.143openalex-snapshot
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/hicss.2009.470openalex-snapshot
Towards an Optimal Algorithm for Recognizing Laman Graphs
inferred← citeshttps://doi.org/10.1109/isit.2008.4595140openalex-snapshot
Secret key generation for a pairwise independent network model
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366879openalex-snapshot
Random sampling in matroids, with applications to graph connectivity and minimum spanning trees
inferred← citeshttps://doi.org/10.1109/surv.2011.040510.00008openalex-snapshot
Link Scheduling Algorithms for Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2012.091812.110582openalex-snapshot
Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks
inferred← citeshttps://doi.org/10.1109/tit.2010.2081210openalex-snapshot
Secret Key Generation for a Pairwise Independent Network Model
inferred← citeshttps://doi.org/10.1109/tkde.2020.3021484openalex-snapshot
I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.918109openalex-snapshot
Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning
inferred← citeshttps://doi.org/10.1109/tnet.2014.2359684openalex-snapshot
Distributed Alarming in the On-Duty and Off-Duty Models
inferred← citeshttps://doi.org/10.1137/1.9781611974317.10openalex-snapshot
Fast Algorithms for Pseudoarboricity
inferred← citeshttps://doi.org/10.1137/100819473openalex-snapshot
Generic Rigidity Matroids with Dilworth Truncations
inferred← citeshttps://doi.org/10.1137/110846944openalex-snapshot
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
inferred← citeshttps://doi.org/10.1137/14099992xopenalex-snapshot
Rumor Spreading with No Dependence on Conductance
inferred← citeshttps://doi.org/10.1137/20m1368161openalex-snapshot
Minimum Scan Cover with Angular Transition Costs
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.1145/103418.103436openalex-snapshot
A matroid approach to finding edge connectivity and packing arborescences
inferred← citeshttps://doi.org/10.1145/1161089.1161094openalex-snapshot
Enabling distributed throughput maximization in wireless mesh networks
inferred← citeshttps://doi.org/10.1145/1367064.1367075openalex-snapshot
Clustering, community partition and disjoint spanning trees
inferred← citeshttps://doi.org/10.1145/1377676.1377738openalex-snapshot
Combinatorial genericity and minimal rigidity
inferred← citeshttps://doi.org/10.1145/237814.237829openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1145/2677955openalex-snapshot
A Survey of TDMA Scheduling Schemes in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1145/2764909openalex-snapshot
The Minset-Poset Approach to Representations of Graph Connectivity
inferred← citeshttps://doi.org/10.1145/331605.331608openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1186/s13015-015-0039-3openalex-snapshot
A virtual pebble game to ensemble average graph rigidity
inferred← citeshttps://doi.org/10.1371/journal.pone.0029176openalex-snapshot
Calculating Ensemble Averaged Descriptions of Protein Rigidity without Sampling
inferred← citeshttps://doi.org/10.14778/3407790.3407843openalex-snapshot
Ordering heuristics for k -clique listing
inferred← citeshttps://doi.org/10.14778/3681954.3681958openalex-snapshot
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33019921openalex-snapshot
Matroid Constrained Fair Allocation Problem
inferred← citeshttps://doi.org/10.3390/a13120339openalex-snapshot
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
inferred← citeshttps://doi.org/10.4018/978-1-60566-396-8.ch006openalex-snapshot
Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks
inferred← citeshttps://doi.org/10.4171/pm/1881openalex-snapshot
Euclidean distance matrices, semidefinite programming and sensor network localization
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.15openalex-snapshot
Distributed Dense Subgraph Detection and Low Outdegree Orientation
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0926openalex-snapshot
Characterizing Generic Global Rigidity
inferred← citeshttps://doi.org/10.48550/arxiv.0711.2835openalex-snapshot
Faster Algorithms for Rigidity in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.0712.0031openalex-snapshot
Slider-pinning Rigidity: a Maxwell-Laman-type Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.0812.4744openalex-snapshot
On Wireless Link Scheduling and Flow Control
inferred← citeshttps://doi.org/10.48550/arxiv.1007.3518openalex-snapshot
Secret Key Generation for a Pairwise Independent Network Model
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2478openalex-snapshot
Packing spanning trees and the $k$-tree protocol
inferred← citeshttps://doi.org/10.48550/arxiv.1105.3234openalex-snapshot
Rigid components in fixed-lattice and cone frameworks
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1014openalex-snapshot
A note on packing spanning trees in graphs and bases in matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1382openalex-snapshot
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1707.02428openalex-snapshot
Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09521openalex-snapshot
Fair Division Under Cardinality Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1808.05256openalex-snapshot
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06066openalex-snapshot
The linear arboricity conjecture for graphs of low degeneracy
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04636openalex-snapshot
A performance study of some approximation algorithms for minimum dominating set in a graph
inferred← citeshttps://doi.org/10.48550/arxiv.2011.02761openalex-snapshot
Instance Based Approximations to Profile Maximum Likelihood
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00692openalex-snapshot
Decomposing a graph into subgraphs with small components
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9812007openalex-snapshot
Minimum Cuts in Near-Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.physics/9612013openalex-snapshot
An efficient algorithm for two-dimensional central-force rigidity
inferred← citeshttps://doi.org/10.5555/313651.313667openalex-snapshot
Algorithms for graphic polymatroids and parametric s-Sets
inferred← citeshttps://doi.org/10.70675/0daeac85z1b10z4ec2zaf23zecc28c279530openalex-snapshot
Densité, VC-dimension et étiquetages de graphes
inferred← citeshttps://doi.org/10.70675/1d192dcdz1428z40cfzbeb0z4e0a220e60faopenalex-snapshot
Gallai's path decomposition in planar graphs
inferred← citeshttps://doi.org/10.7275/fgp4-9f16openalex-snapshot
Accurate and Robust Mechanical Modeling of Proteins
inferred← citeshttps://doi.org/10.9790/5728-120402137143openalex-snapshot
A series of contexts relative to a matroid*
inferred← citeshttps://doi.org/10.9790/5728-1204029197openalex-snapshot
A series of contexts relative to a matroid*
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.