On the public citation graph
The d-step conjecture for polyhedra of dimension d<6
0 signed · 163 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.1007/bf02566949openalex-snapshot
Some semicontinuity theorems for convex polytopes and cell-complexes
inferredcites →https://doi.org/10.1112/jlms/s1-37.1.152openalex-snapshot
Longest Simple Paths in Polyhedral Graphs
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2140/pjm.1961.11.431openalex-snapshot
On the graph structure of convex polyhedra inn-space
inferredcites →https://doi.org/10.4153/cjm-1964-002-xopenalex-snapshot
On The Number of Faces of a Convex Polytope
inferredcites →https://doi.org/10.4153/cjm-1964-061-2openalex-snapshot
Diameters of Polyhedral Graphs
inferredcites →https://doi.org/10.4153/cjm-1964-067-6openalex-snapshot
On the Number of Vertices of a Convex Polytope
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.eorms0774openalex-snapshot
The Simplex Method and Its Complexity
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_52openalex-snapshot
The analysis of local search problems and their heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4612-0963-8_3openalex-snapshot
Polygons, Polyhedra, and Polytopes
inferred← citeshttps://doi.org/10.1007/978-1-4615-5611-4_28openalex-snapshot
Parallel Computation of the Diameter of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-0348-8438-9_7openalex-snapshot
Reconstructing a Simple Polytope from its Graph
inferred← citeshttps://doi.org/10.1007/978-3-322-83897-1_8openalex-snapshot
Zur Schrittzahlminimierung bei Linearen Programmen
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_43openalex-snapshot
Complementary Vertices and Adjacency Testing in Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_24openalex-snapshot
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_18openalex-snapshot
The Diameter of Polytopes and Related Applications
inferred← citeshttps://doi.org/10.1007/bf01070611openalex-snapshot
A proof of the maximal diameter conjecture for the transportation polyhedron
inferred← citeshttps://doi.org/10.1007/bf01436525openalex-snapshot
A class of linear programming problems requiring a large number of iterations
inferred← citeshttps://doi.org/10.1007/bf01609004openalex-snapshot
Abstract polytopes and the hirsch conjecture
inferred← citeshttps://doi.org/10.1007/bf02293053openalex-snapshot
Upper bounds for the diameter and height of graphs of convex polyhedra
inferred← citeshttps://doi.org/10.1007/bf02392139openalex-snapshot
Polytope pairs and their relationship to linear programming
inferred← citeshttps://doi.org/10.1007/bf02591692openalex-snapshot
Transportation problems which can be solved by the use of hirsch-paths for the dual problems
inferred← citeshttps://doi.org/10.1007/bf02591931openalex-snapshot
On the length of simplex paths: The assignment case
inferred← citeshttps://doi.org/10.1007/bf02614318openalex-snapshot
Linear programming, the simplex algorithm and simple polytopes
inferred← citeshttps://doi.org/10.1007/bf02760600openalex-snapshot
Two combinatorial properties of a class of simplicial polytopes
inferred← citeshttps://doi.org/10.1007/bf02761464openalex-snapshot
Some upper bounds for the diameters of convex polytopes
inferred← citeshttps://doi.org/10.1007/bfb0121237openalex-snapshot
Lower bounds for maximum diameters of polytopes
inferred← citeshttps://doi.org/10.1007/bfb0121238openalex-snapshot
Maximum diameter of abstract polytopes
inferred← citeshttps://doi.org/10.1007/bfb0121240openalex-snapshot
On two special classes of transportation polytopes
inferred← citeshttps://doi.org/10.1007/pl00009308openalex-snapshot
The d-Step Conjecture and Gaussian Elimination
inferred← citeshttps://doi.org/10.1007/pl00009333openalex-snapshot
Counting d -Step Paths in Extremal Dantzig Figures
inferred← citeshttps://doi.org/10.1007/pl00009334openalex-snapshot
Counterexamples to the Strong d -Step Conjecture for d≥5
inferred← citeshttps://doi.org/10.1007/pl00009372openalex-snapshot
Many Polytopes Meeting the Conjectured Hirsch Bound
inferred← citeshttps://doi.org/10.1007/s00026-009-0031-zopenalex-snapshot
On Minkowski Sums of Simplices
inferred← citeshttps://doi.org/10.1007/s00454-001-0085-0openalex-snapshot
Examples and Counterexamples for the Perles Conjecture
inferred← citeshttps://doi.org/10.1007/s00454-008-9096-4openalex-snapshot
A Continuous d-Step Conjecture for Polytopes
inferred← citeshttps://doi.org/10.1007/s00454-014-9601-xopenalex-snapshot
On Sub-determinants and the Diameter of Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-017-9868-9openalex-snapshot
Connectivity and $$W_v$$ W v -Paths in Polyhedral Maps on Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-018-0016-yopenalex-snapshot
An Asymptotically Improved Upper Bound on the Diameter of Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-018-9995-yopenalex-snapshot
On the Circuit Diameter Conjecture
inferred← citeshttps://doi.org/10.1007/s00454-019-00161-3openalex-snapshot
A Proof of the Strict Monotone 5-Step Conjecture
inferred← citeshttps://doi.org/10.1007/s00454-023-00588-9openalex-snapshot
Posets Arising as 1-Skeleta of Simple Polytopes, the Nonrevisiting Path Conjecture, and Poset Topology
inferred← citeshttps://doi.org/10.1007/s00454-025-00814-6openalex-snapshot
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes
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-013-0723-3openalex-snapshot
The Hirsch Conjecture for the fractional stable set polytope
inferred← citeshttps://doi.org/10.1007/s10107-015-0956-4openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-016-1099-yopenalex-snapshot
Hirsch polytopes with exponentially long combinatorial segments
inferred← citeshttps://doi.org/10.1007/s10107-017-1176-xopenalex-snapshot
The diameters of network-flow polytopes satisfy the Hirsch conjecture
inferred← citeshttps://doi.org/10.1007/s101070100261openalex-snapshot
The many facets of linear programming
inferred← citeshttps://doi.org/10.1007/s10288-012-0218-8openalex-snapshot
The stable set problem: some structural properties and relaxations
inferred← citeshttps://doi.org/10.1007/s10957-015-0764-2openalex-snapshot
An Analogue of the Klee–Walkup Result for Sonnevend’s Curvature of the Central Path
inferred← citeshttps://doi.org/10.1007/s11590-018-1338-7openalex-snapshot
Distance between vertices of lattice polytopes
inferred← citeshttps://doi.org/10.1007/s11590-025-02198-1openalex-snapshot
On the diameter of a 2-sum of polyhedra
inferred← citeshttps://doi.org/10.1007/s11750-013-0292-xopenalex-snapshot
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
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/s40745-014-0005-9openalex-snapshot
Discussions on Hirsch Conjecture and The Existence of Strongly Polynomial: Time Simplex Variants
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90016-8openalex-snapshot
An upper bound for the diameter of a polytope
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90098-7openalex-snapshot
Unions of oriented matroids
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90010-7openalex-snapshot
Convex polyhedra of doubly stochastic matrices: II. Graph of
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-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
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/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101809openalex-snapshot
A linear optimization oracle for zonotope computation
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.021openalex-snapshot
A d -step approach to the maximum number of distinct squares and runs in strings
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.036openalex-snapshot
Bannai et al. method proves the d -step conjecture for strings
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.009openalex-snapshot
On the hardness of short and sign-compatible circuit walks
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.006openalex-snapshot
Blending simple polytopes at faces
inferred← citeshttps://doi.org/10.1016/j.disc.2017.04.005openalex-snapshot
Improving bounds on the diameter of a polyhedron in high dimensions
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.016openalex-snapshot
On Dantzig figures from graded lexicographic orders
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.100566openalex-snapshot
Circuit walks in integral polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100910openalex-snapshot
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.044openalex-snapshot
Diameter and Curvature: Intriguing Analogies
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.070openalex-snapshot
The Circuit Diameter of the Klee-Walkup Polyhedron
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.1016/j.orl.2007.06.007openalex-snapshot
Polytopes and arrangements: Diameter and curvature
inferred← citeshttps://doi.org/10.1016/j.orl.2015.07.001openalex-snapshot
A refinement of Todd’s bound for the diameter of a polyhedron
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00525-3openalex-snapshot
Maximal nonrevisiting paths in simple polytopes
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00596-4openalex-snapshot
Kleitman and combinatorics
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00151-9openalex-snapshot
Non-revisiting paths on surfaces with low genus
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00273-2openalex-snapshot
A structure theorem for pseudomanifolds
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00017-5openalex-snapshot
More polytopes meeting the conjectured Hirsch bound
inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80007-4openalex-snapshot
Wv paths on 3-polytopes
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70843-4openalex-snapshot
Unions of Oriented Matroids
inferred← citeshttps://doi.org/10.1016/s0195-6698(80)80017-5openalex-snapshot
The Minimum Number of Faces of a Simple Polyhedron
inferred← citeshttps://doi.org/10.1016/s0195-6698(81)80037-6openalex-snapshot
The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra
inferred← citeshttps://doi.org/10.1017/ccol0521340446.006openalex-snapshot
On the complexity of linear programming
inferred← citeshttps://doi.org/10.1017/jpr.2024.114openalex-snapshot
Estranged facets and k -facets of Gaussian random point sets
inferred← citeshttps://doi.org/10.1080/10556788.2012.668906openalex-snapshot
More bounds on the diameters of convex polytopes
inferred← citeshttps://doi.org/10.1080/10586458.2011.564965openalex-snapshot
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
inferred← citeshttps://doi.org/10.1080/10586458.2019.1641766openalex-snapshot
Topological Prismatoids and Small Simplicial Spheres of Large Diameter
inferred← citeshttps://doi.org/10.1090/crmp/048/05openalex-snapshot
Hyperplane arrangements with large average diameter
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
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/focs.2018.00090openalex-snapshot
The Diameter of the Fractional Matching Polytope and Its Hardness Implications
inferred← citeshttps://doi.org/10.1112/plms/pdu064openalex-snapshot
The width of five-dimensional prismatoids
inferred← citeshttps://doi.org/10.1134/s008154381406008xopenalex-snapshot
Buchstaber invariant theory of simplicial complexes and convex polytopes
inferred← citeshttps://doi.org/10.1137/0121052openalex-snapshot
The Hirsch Conjecture in Leontief Substitution Systems
inferred← citeshttps://doi.org/10.1137/140976868openalex-snapshot
On the Circuit Diameter of Dual Transportation Polyhedra
inferred← citeshttps://doi.org/10.1137/17m1152115openalex-snapshot
On the Circuit Diameter of Some Combinatorial Polytopes
inferred← citeshttps://doi.org/10.1137/20m1330658openalex-snapshot
Constructing Clustering Transformations
inferred← citeshttps://doi.org/10.1137/22m1490508openalex-snapshot
On the Combinatorial Diameters of Parallel and Series Connections
inferred← citeshttps://doi.org/10.1145/129712.129759openalex-snapshot
A subexponential randomized simplex algorithm (extended abstract)
inferred← citeshttps://doi.org/10.1145/2261250.2261304openalex-snapshot
On sub-determinants and the diameter of polyhedra
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/3573105.3575678openalex-snapshot
A Formal Disproof of Hirsch Conjecture
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-27042016-165310openalex-snapshot
Estudos em Otimização Linear
inferred← citeshttps://doi.org/10.1287/mnsc.33.3.301openalex-snapshot
The Efficiency of the Simplex Method: A Survey
inferred← citeshttps://doi.org/10.1287/moor.10.1.158openalex-snapshot
The Mani-Walkup Spherical Counterexamples to the Wv-Path Conjecture are Not Polytopal
inferred← citeshttps://doi.org/10.1287/moor.1100.0470openalex-snapshot
Diameter of Polyhedra: Limits of Abstraction
inferred← citeshttps://doi.org/10.1287/moor.12.4.718openalex-snapshot
The d-Step Conjecture and Its Relatives
inferred← citeshttps://doi.org/10.1287/moor.19.4.780openalex-snapshot
Lemke Paths on Simple Polytopes
inferred← citeshttps://doi.org/10.1287/moor.2014.0661openalex-snapshot
The Hirsch Conjecture Holds for Normal Flag Complexes
inferred← citeshttps://doi.org/10.1287/moor.3.3.224openalex-snapshot
The Hirsch Conjecture Fails for Triangulated 27-Spheres
inferred← citeshttps://doi.org/10.1287/moor.5.4.576openalex-snapshot
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
inferred← citeshttps://doi.org/10.1287/moor.5.4.595openalex-snapshot
A 3-Sphere Counterexample to the Wv-Path Conjecture
inferred← citeshttps://doi.org/10.1287/moor.5.4.599openalex-snapshot
The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
inferred← citeshttps://doi.org/10.1287/moor.7.3.441openalex-snapshot
Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
inferred← citeshttps://doi.org/10.1287/moor.9.4.629openalex-snapshot
The Hirsch Conjecture for Dual Transportation Polyhedra
inferred← citeshttps://doi.org/10.1365/s13291-010-0001-8openalex-snapshot
An Update on the Hirsch Conjecture
inferred← citeshttps://doi.org/10.14279/depositonce-852openalex-snapshot
Combinatorial Curvatures, Group Actions, and Colourings: Aspects of Topological Combinatorics
inferred← citeshttps://doi.org/10.1515/advgeom-2026-0006openalex-snapshot
Lower bound results for conditionally decomposable polytopes
inferred← citeshttps://doi.org/10.1515/dma.2009.003openalex-snapshot
The diameter of the ridge-graph of a cyclic polytope
inferred← citeshttps://doi.org/10.1515/dmvm-2010-0090openalex-snapshot
Über ein Gegenbeispiel zur Hirsch-Vermutung
inferred← citeshttps://doi.org/10.17169/refubium-13064openalex-snapshot
Methods from Differential Geometry in Polytope Theory
inferred← citeshttps://doi.org/10.2748/tmj/1458248864openalex-snapshot
Wedge operations and torus symmetries
inferred← citeshttps://doi.org/10.2969/aspm/06210059openalex-snapshot
Hyperplane arrangements with large average diameter: a computational approach
inferred← citeshttps://doi.org/10.37236/9653openalex-snapshot
Diameters of Cocircuit Graphs of Oriented Matroids: An Update
inferred← citeshttps://doi.org/10.4007/annals.2012.176.1.7openalex-snapshot
A counterexample to the Hirsch Conjecture
inferred← citeshttps://doi.org/10.4213/dm1054openalex-snapshot
Диаметр ридж-графа циклического многогранника
inferred← citeshttps://doi.org/10.48550/arxiv.0908.1619openalex-snapshot
Combinatorial Polytope Enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.0911.4982openalex-snapshot
More bounds on the diameters of convex polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1006.2416openalex-snapshot
Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method
inferred← citeshttps://doi.org/10.48550/arxiv.1007.3283openalex-snapshot
Sobre un contraejemplo a la conjetura de Hirsch
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.1304.7235openalex-snapshot
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5622openalex-snapshot
Two Observations on the Perturbed Wedge
inferred← citeshttps://doi.org/10.48550/arxiv.1311.0581openalex-snapshot
Observations on the Perturbed Wedge
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4184openalex-snapshot
Quadratic diameter bounds for dual network flow polyhedra
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.1503.05252openalex-snapshot
Circuit diameter and Klee-Walkup constructions
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.1604.04338openalex-snapshot
A simple proof of tail--polynomial bounds on the diameter of polyhedra
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
inferred← citeshttps://doi.org/10.48550/arxiv.1709.09642openalex-snapshot
On the Circuit Diameter of some Combinatorial Polytopes
inferred← citeshttps://doi.org/10.70675/0ac504c8zfb54z44caz892bz7b9f3ce35766openalex-snapshot
Geometric and Dual Approaches to Cumulative Scheduling
inferred← citeshttps://doi.org/10.71548/18181openalex-snapshot
On the number of distinct squares in strings
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.