On the public citation graph

Upper bounds for the diameter and height of graphs of convex polyhedra

https://doi.org/10.1007/bf02293053
0 signed · 47 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/bf02395040openalex-snapshot
The d-step conjecture for polyhedra of dimension d<6
inferredcites →https://doi.org/10.1016/s0021-9800(69)80007-4openalex-snapshot
Wv paths on 3-polytopes
inferredcites →https://doi.org/10.1090/s0273-0979-1992-00285-9openalex-snapshot
A quasi-polynomial bound for the diameter of graphs of polyhedra
inferredcites →https://doi.org/10.1112/plms/s3-20.1.161openalex-snapshot
Paths on Polytopes
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.1145/129712.129759openalex-snapshot
A subexponential randomized simplex algorithm (extended abstract)
inferredcites →https://doi.org/10.1287/moor.12.4.718openalex-snapshot
The d-Step Conjecture and Its Relatives
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.21236/ada214689openalex-snapshot
Network Flow Algorithms
inferredcites →https://doi.org/10.7249/r366openalex-snapshot
Linear Programming and Extensions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0706openalex-snapshot
Randomized Simplex Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_16openalex-snapshot
On Circuit Diameter and Straight Line Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_32openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_3openalex-snapshot
Computing in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf02614318openalex-snapshot
Linear programming, the simplex algorithm and simple polytopes
inferred← citeshttps://doi.org/10.1007/pl00009334openalex-snapshot
Counterexamples to the Strong d -Step Conjecture for d≥5
inferred← citeshttps://doi.org/10.1007/s00224-018-9855-4openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.1007/s004540010046openalex-snapshot
Convex and Linear Orientations of Polytopal Graphs
inferred← citeshttps://doi.org/10.1007/s00493-016-3327-8openalex-snapshot
Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
inferred← citeshttps://doi.org/10.1007/s10107-012-0611-2openalex-snapshot
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
inferred← citeshttps://doi.org/10.1007/s10107-016-1099-yopenalex-snapshot
Hirsch polytopes with exponentially long combinatorial segments
inferred← citeshttps://doi.org/10.1007/s11750-013-0295-7openalex-snapshot
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
inferred← citeshttps://doi.org/10.1007/s43069-023-00260-1openalex-snapshot
Monotone Diameter of Bisubmodular Polyhedra
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50019-5openalex-snapshot
Combinatorial Aspects of Convex Polytopes
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50020-8openalex-snapshot
10.1016/b978-044488002-4/50020-8
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.083openalex-snapshot
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.09.009openalex-snapshot
One-point suspensions and wreath products of polytopes and spheres
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00285-9openalex-snapshot
A quasi-polynomial bound for the diameter of graphs of polyhedra
inferred← citeshttps://doi.org/10.1109/aina.2009.133openalex-snapshot
A Secure Revised Simplex Algorithm for Privacy-Preserving Linear Programming
inferred← citeshttps://doi.org/10.1137/140962310openalex-snapshot
An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
inferred← citeshttps://doi.org/10.1137/20m1315646openalex-snapshot
On the Length of Monotone Paths in Polyhedra
inferred← citeshttps://doi.org/10.1145/129712.129759openalex-snapshot
A subexponential randomized simplex algorithm (extended abstract)
inferred← citeshttps://doi.org/10.1145/1542362.1542428openalex-snapshot
Diameter of polyhedra
inferred← citeshttps://doi.org/10.1145/202840.202847openalex-snapshot
A survey of linear programming in randomized subexponential time
inferred← citeshttps://doi.org/10.1145/2462356.2462408openalex-snapshot
Recent progress on the combinatorial diameter of polyhedra and simplicial complexes
inferred← citeshttps://doi.org/10.1145/2746539.2746557openalex-snapshot
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
inferred← citeshttps://doi.org/10.1287/moor.1100.0470openalex-snapshot
Diameter of Polyhedra: Limits of Abstraction
inferred← citeshttps://doi.org/10.1287/moor.2014.0661openalex-snapshot
The Hirsch Conjecture Holds for Normal Flag Complexes
inferred← citeshttps://doi.org/10.1365/s13291-012-0055-xopenalex-snapshot
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1767openalex-snapshot
On Estimation Algorithms vs Approximation Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1525openalex-snapshot
Constructing subset partition graphs with strong adjacency and end-point count properties
inferred← citeshttps://doi.org/10.48550/arxiv.1303.3598openalex-snapshot
The Hirsch conjecture holds for normal flag complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3579openalex-snapshot
An improved Kalai-Kleitman bound for the diameter of a polyhedron
inferred← citeshttps://doi.org/10.48550/arxiv.1412.5691openalex-snapshot
An improved upper bound on the diameters of subset partition graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04052openalex-snapshot
Tail diameter upper bounds for polytopes and polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04812openalex-snapshot
Monotone Paths in Geometric Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07354openalex-snapshot
On the diameter of dual graphs of Stanley-Reisner rings with Serre $(S_2)$ property and Hirsch type bounds on abstractions of polytopes
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.