On the public citation graph
On recognizing integer polyhedra
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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(200002)47:1<40::aid-nav3>3.0.co;2-topenalex-snapshot
The parallel replacement problem with demand and capital budgeting constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_33openalex-snapshot
Implied Integrality in Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_3openalex-snapshot
Linear Inequalities and Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_7openalex-snapshot
Valid Inequalities for Structured Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_8openalex-snapshot
Reformulations and Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_17openalex-snapshot
On the Complexity of Some Basic Problems in Computational Convexity
inferred← citeshttps://doi.org/10.1007/s00454-022-00406-8openalex-snapshot
Counting Vertices of Integral Polytopes Defined by Facets
inferred← citeshttps://doi.org/10.1007/s10107-013-0685-5openalex-snapshot
Characterizing and recognizing generalized polymatroids
inferred← citeshttps://doi.org/10.1007/s10107-018-1317-xopenalex-snapshot
On the Rational Polytopes with Chvátal Rank 1
inferred← citeshttps://doi.org/10.1007/s10107-020-01514-0openalex-snapshot
Box-total dual integrality, box-integrality, and equimodular matrices
inferred← citeshttps://doi.org/10.1007/s10479-010-0690-5openalex-snapshot
The negative cycles polyhedron and hardness of checking some polyhedral properties
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00111-uopenalex-snapshot
On the complexity of some basic problems in computational convexity: I. Containment problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100928openalex-snapshot
A horizon tour of box-total dual integrality
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.024openalex-snapshot
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
inferred← citeshttps://doi.org/10.1137/s0097539794278384openalex-snapshot
On The Complexity of Computing Mixed Volumes
inferred← citeshttps://doi.org/10.1162/neco.1994.6.1.161openalex-snapshot
Polyhedral Combinatorics and Neural Networks
inferred← citeshttps://doi.org/10.1287/moor.2017.0852openalex-snapshot
When Is the Matching Polytope Box-Totally Dual Integral?
inferred← citeshttps://doi.org/10.22028/d291-25948openalex-snapshot
Complexity of some polyhedral enumeration problems
inferred← citeshttps://doi.org/10.48550/arxiv.1409.4130openalex-snapshot
H-Representation of the Kimura-3 Polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08977openalex-snapshot
Principally Box-integer Polyhedra and Equimodular Matrices
inferred← citeshttps://doi.org/10.70675/72f96944zb711z4ad5z9d5bzaac3410bdf92openalex-snapshot
TDIness and Multicuts
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.