On the public citation graph
Directed submodularity, ditroids and directed submodular flows
0 signed · 89 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.3230120102openalex-snapshot
Minimum cost flow with set‐constraints
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01582162openalex-snapshot
On box totally dual integral polyhedra
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02592001openalex-snapshot
On the subdifferential of a submodular function
inferredcites →https://doi.org/10.1007/bf02592217openalex-snapshot
Structures of polyhedra determined by submodular functions on crossing families
inferredcites →https://doi.org/10.1007/bf02592218openalex-snapshot
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
inferredcites →https://doi.org/10.1007/bfb0121005openalex-snapshot
A submodular network simplex method
inferredcites →https://doi.org/10.1007/bfb0121012openalex-snapshot
Submodular systems and related topics
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1016/0024-3795(84)90147-2openalex-snapshot
A system of linear inequalities with a submodular function on {0,±1}; vectors
inferredcites →https://doi.org/10.1016/0095-8956(77)90055-7openalex-snapshot
A combinatorial abstraction of linear programming
inferredcites →https://doi.org/10.1016/0095-8956(78)90080-1openalex-snapshot
Orientability of matroids
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0095-8956(80)90082-9openalex-snapshot
Convexity in oriented matroids
inferredcites →https://doi.org/10.1016/0095-8956(84)90029-7openalex-snapshot
Finding feasible vectors of Edmonds-Giles polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(82)90053-1openalex-snapshot
Minimization on submodular flows
inferredcites →https://doi.org/10.1016/0166-218x(83)90040-9openalex-snapshot
Canonical decompositions of symmetric submodular systems
inferredcites →https://doi.org/10.1016/0378-4754(86)90100-xopenalex-snapshot
Combinatorial optimization: Annotated bibliographies.
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50013-1openalex-snapshot
Total Dual Integrality of Linear Inequality Systems
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50019-2openalex-snapshot
Greedoids - A Structural Framework for the Greedy Algorithm
inferredcites →https://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
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.1016/s0304-0208(08)72446-0openalex-snapshot
An Algorithm for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72451-4openalex-snapshot
Flow Network Formulations of Polymatroid Optimization Problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)72458-7openalex-snapshot
Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
inferredcites →https://doi.org/10.1016/s0304-0208(08)72968-2openalex-snapshot
Minimization of Combined Objective Functions on Integral Submodular Flows
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1287/moor.10.2.251openalex-snapshot
A Primal-Dual Algorithm for Submodular Flows
inferredcites →https://doi.org/10.1287/moor.13.3.435openalex-snapshot
Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions
inferredcites →https://doi.org/10.1287/moor.7.3.334openalex-snapshot
Computing Maximal “Polymatroidal” Network Flows
inferredcites →https://doi.org/10.1287/moor.7.3.410openalex-snapshot
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_13openalex-snapshot
Bisubmodular Function Minimization
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_54openalex-snapshot
Coverings and delta-coverings
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_37openalex-snapshot
Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_40openalex-snapshot
Towards Minimizing k-Submodular Functions
inferred← citeshttps://doi.org/10.1007/bf01205074openalex-snapshot
b-matching degree-sequence polyhedra
inferred← citeshttps://doi.org/10.1007/bf02592201openalex-snapshot
On structures of bisubmodular polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-008-0242-9openalex-snapshot
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
inferred← citeshttps://doi.org/10.1007/s10107-014-0824-7openalex-snapshot
Discrete convexity and polynomial solvability in minimum 0-extension problems
inferred← citeshttps://doi.org/10.1007/s10107-017-1171-2openalex-snapshot
Polynomial combinatorial algorithms for skew-bisubmodular function minimization
inferred← citeshttps://doi.org/10.1007/s13160-022-00499-xopenalex-snapshot
Discrete Fenchel duality for a pair of integrally convex and separable convex functions
inferred← citeshttps://doi.org/10.1007/s13160-023-00589-4openalex-snapshot
Recent progress on integrally convex functions
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00246-fopenalex-snapshot
A characterization of bisubmodular functions
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90020-wopenalex-snapshot
Representability of △-matroids over GF(2)
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00011-5openalex-snapshot
Circuit Separation for Symmetric Matroids
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.2011.10.026openalex-snapshot
Generalized roof duality and bisubmodular functions
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.047openalex-snapshot
Parametric bisubmodular function minimization and its associated signed ring family
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113855openalex-snapshot
Characterizations of the set of integer points in an integral bisubmodular polyhedron
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.12.001openalex-snapshot
Generalized skew bisubmodularity: A characterization and a min–max theorem
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.02.002openalex-snapshot
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.07.001openalex-snapshot
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100670openalex-snapshot
An exact cutting plane method for k -submodular function maximization
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.005openalex-snapshot
Minimizing submodular functions on diamonds via generalized fractional matroid matchings
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.02.008openalex-snapshot
Bipolarization of posets and natural interpolation
inferred← citeshttps://doi.org/10.1016/j.orl.2020.10.007openalex-snapshot
A polyhedral approach to bisubmodular function minimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115302openalex-snapshot
Approximation algorithm and mechanism design for bisubmodular welfare maximization problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00044-7openalex-snapshot
The delta-sum of matching delta-matroids
inferred← citeshttps://doi.org/10.1080/02331939508844117openalex-snapshot
The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions
inferred← citeshttps://doi.org/10.1080/10556788.2020.1740219openalex-snapshot
Signed ring families and signed posets
inferred← citeshttps://doi.org/10.1109/ice.2015.7438689openalex-snapshot
Configuration processes in open data
inferred← citeshttps://doi.org/10.1137/090777463openalex-snapshot
Neighbor Systems and the Greedy Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611973105.127openalex-snapshot
Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems: [Extended Abstract]
inferred← citeshttps://doi.org/10.1137/1.9781611973402.108openalex-snapshot
Maximizing Bisubmodular and k-Submodular Functions
inferred← citeshttps://doi.org/10.1137/110831684openalex-snapshot
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
inferred← citeshttps://doi.org/10.1137/120893549openalex-snapshot
Skew Bisubmodularity and Valued CSPs
inferred← citeshttps://doi.org/10.1137/130936038openalex-snapshot
Oracle Tractability of Skew Bisubmodular Functions
inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot
Bisubmodular Function Minimization
inferred← citeshttps://doi.org/10.1137/s0895480191222926openalex-snapshot
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
inferred← citeshttps://doi.org/10.1137/s0895480193242591openalex-snapshot
Multimatroids I. Coverings by Independent Sets
inferred← citeshttps://doi.org/10.1137/s0895480194264344openalex-snapshot
A Min--Max Theorem for Bisubmodular Polyhedra
inferred← citeshttps://doi.org/10.1145/2850419openalex-snapshot
Maximizing k -Submodular Functions and Beyond
inferred← citeshttps://doi.org/10.1287/educ.2023.0255openalex-snapshot
Mixed-Integer Programming Approaches to Generalized Submodular Optimization and Its Applications
inferred← citeshttps://doi.org/10.1287/moor.20.3.583openalex-snapshot
Least Majorized Elements and Generalized Polymatroids
inferred← citeshttps://doi.org/10.15807/jorsj.37.188openalex-snapshot
A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON
inferred← citeshttps://doi.org/10.15807/jorsj.40.437openalex-snapshot
BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS
inferred← citeshttps://doi.org/10.15807/jorsj.40.565openalex-snapshot
CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
inferred← citeshttps://doi.org/10.48550/arxiv.1005.2305openalex-snapshot
Generalized roof duality and bisubmodular functions
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00988openalex-snapshot
An Exact Cutting Plane Method for $k$-submodular Function Maximization
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.