On the public citation graph
A bidirected generalization of network matrices
0 signed · 36 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01585160openalex-snapshot
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
inferredcites →https://doi.org/10.1007/bf01787483openalex-snapshot
Biased graphs whose matroids are special binary matroids
inferredcites →https://doi.org/10.1007/bf02189093openalex-snapshot
Equivalent factor matroids of graphs
inferredcites →https://doi.org/10.1007/bf02579262openalex-snapshot
Matrices with the edmonds—Johnson property
inferredcites →https://doi.org/10.1016/0024-3795(89)90450-3openalex-snapshot
Subspaces with well-scaled frames
inferredcites →https://doi.org/10.1016/0095-8956(80)90075-1openalex-snapshot
Decomposition of regular matroids
inferredcites →https://doi.org/10.1016/0095-8956(90)90082-bopenalex-snapshot
The incidence structure of subspaces with well-scaled frames
inferredcites →https://doi.org/10.1016/0166-218x(93)90103-uopenalex-snapshot
Uncovering generalized-network structure in matrices
inferredcites →https://doi.org/10.1016/0167-6377(93)90005-2openalex-snapshot
k-Integrality, an extension of total unimodularity
inferredcites →https://doi.org/10.1016/s0012-365x(03)00095-5openalex-snapshot
Rational and integral k-regular matrices
inferredcites →https://doi.org/10.1016/s0195-6698(13)80118-7openalex-snapshot
Orientation of Signed Graphs
inferredcites →https://doi.org/10.1016/s0377-2217(02)00071-1openalex-snapshot
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20117openalex-snapshot
A simple algorithm that proves half‐integrality of bidirected network programming
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_19openalex-snapshot
On the Number of Degenerate Simplex Pivots
inferred← citeshttps://doi.org/10.1007/978-3-319-09177-8_16openalex-snapshot
A Socialized System for Enabling the Extraction of Potential Values from Natural and Social Sensing
inferred← citeshttps://doi.org/10.1007/978-3-540-78839-3_5openalex-snapshot
Ab Initio Whole Genome Shotgun Assembly with Mated Short Reads
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_41openalex-snapshot
Recognition Algorithms for Binary Signed-Graphic Matroids
inferred← citeshttps://doi.org/10.1007/s10107-026-02349-xopenalex-snapshot
On the number of degenerate simplex pivots
inferred← citeshttps://doi.org/10.1007/s11590-023-02066-wopenalex-snapshot
A mathematical programming approach for recognizing binet matrices
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.010openalex-snapshot
On the representability of totally unimodular matrices on bidirected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.12.013openalex-snapshot
Resolution of indecomposable integral flows on signed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.003openalex-snapshot
On the determinant of the Laplacian matrix of a complex unit gain graph
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111887openalex-snapshot
Binary signed-graphic matroids: Representations and recognition algorithms
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.endm.2009.11.016openalex-snapshot
The Chvátal closure of generalized stable sets in bidirected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.02.011openalex-snapshot
The number of nowhere-zero flows on graphs and signed graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2006.04.003openalex-snapshot
Optimization with binet matrices
inferred← citeshttps://doi.org/10.1016/j.orl.2022.10.002openalex-snapshot
On small-depth tree augmentations
inferred← citeshttps://doi.org/10.1089/cmb.2009.0047openalex-snapshot
Maximum Likelihood Genome Assembly
inferred← citeshttps://doi.org/10.1287/moor.2024.0668openalex-snapshot
Capacitated Network Bargaining Games: Stability and Structure
inferred← citeshttps://doi.org/10.26493/1855-3974.1657.d75openalex-snapshot
A q-queens problem. VI. The bishops' period
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.