On the public citation graph

On structures of bisubmodular polyhedra

0 signed · 49 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580137openalex-snapshot

A greedy algorithm for solving a certain class of linear programmes

inferredcites →https://doi.org/10.1007/bf01589420openalex-snapshot

Directed submodularity, ditroids and directed submodular flows

inferredcites →https://doi.org/10.1007/bf02604639openalex-snapshot

Greedy algorithm and symmetric matroids

inferredcites →https://doi.org/10.1016/0001-8708(86)90104-0openalex-snapshot

Some combinatorial properties of discriminants in metric vector spaces

inferredcites →https://doi.org/10.1016/0012-365x(88)90101-xopenalex-snapshot

Pseudomatroids

inferredcites →https://doi.org/10.1016/0095-8956(79)90011-xopenalex-snapshot

Matroids and linking systems

inferredcites →https://doi.org/10.1016/0097-3165(93)90052-aopenalex-snapshot

Signed posets

inferredcites →https://doi.org/10.1016/0166-218x(90)90023-6openalex-snapshot

On totally dual integral systems

inferredcites →https://doi.org/10.1016/0166-218x(92)90272-copenalex-snapshot

Matchings and ▵-matroids

inferredcites →https://doi.org/10.1016/0166-218x(95)00068-3openalex-snapshot

Decomposition of a bidirected graph into strongly connected components and its signed poset structure

inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot

Submodular Functions and Optimization

inferredcites →https://doi.org/10.1016/s0167-5060(08)x7004-9openalex-snapshot

Submodular Functions and Optimization

inferredcites →https://doi.org/10.1137/s0895480191222926openalex-snapshot

Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra

inferredcites →https://doi.org/10.1137/s0895480194264344openalex-snapshot

A Min--Max Theorem for Bisubmodular Polyhedra

inferredcites →https://doi.org/10.1287/moor.10.3.367openalex-snapshot

The Partial Order of a Polymatroid Extreme Point

inferredcites →https://doi.org/10.1307/mmj/1028989917openalex-snapshot

On the notion of balance of a signed graph.

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.4872823openalex-extracted

A First Efficient Algorithm for Enumerating All the Extreme Points of a Bisubmodular Polyhedron

inferred← citeshttps://doi.org/10.1007/3-540-45535-3_13openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_14openalex-snapshot

Resource Allocation Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_17openalex-snapshot

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra

inferred← citeshttps://doi.org/10.1007/s00453-017-0306-4openalex-snapshot

Greedy Oriented Flows

inferred← citeshttps://doi.org/10.1007/s00453-019-00613-5openalex-snapshot

Making Bidirected Graphs Strongly Connected

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-017-1171-2openalex-snapshot

Polynomial combinatorial algorithms for skew-bisubmodular function minimization

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/s43069-023-00260-1openalex-snapshot

Monotone Diameter of Bisubmodular Polyhedra

inferred← citeshttps://doi.org/10.1016/0166-218x(95)00068-3openalex-snapshot

Decomposition of a bidirected graph into strongly connected components and its signed poset structure

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.2003.06.005openalex-snapshot

Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2

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.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/s0024-3795(98)00002-0openalex-snapshot

A lexicographic algebraic theorem and its applications

inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00466-3openalex-snapshot

Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability

inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1023/a:1004666028951openalex-snapshot

An Algorithm for Solving the Minimum-Norm Point Problem over the Intersection of a Polytope and an Affine Set

inferred← citeshttps://doi.org/10.1051/ro/2019001openalex-snapshot

Greedy systems of linear inequalities and lexicographically optimal solutions

inferred← citeshttps://doi.org/10.1080/10556788.2020.1740219openalex-snapshot

Signed ring families and signed posets

inferred← citeshttps://doi.org/10.1137/110831684openalex-snapshot

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra

inferred← citeshttps://doi.org/10.1137/s0895480103426339openalex-snapshot

Bisubmodular Function Minimization

inferred← citeshttps://doi.org/10.1155/jamds.2005.95openalex-snapshot

Δ -matroid and jump system

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.2023.0054openalex-snapshot

A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra

inferred← citeshttps://doi.org/10.15807/jorsj.39.558openalex-snapshot

THE MINIMUM-WEIGHT IDEAL PROBLEM FOR SIGNED POSETS

inferred← citeshttps://doi.org/10.15807/jorsj.40.437openalex-snapshot

BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS

inferred← citeshttps://doi.org/10.15807/jorsj.48.90openalex-snapshot

POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING

inferred← citeshttps://doi.org/10.37236/29openalex-snapshot

A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas

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.