On the public citation graph

On the Diameter of Tree Associahedra

https://doi.org/10.37236/7762
0 signed · 31 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.1006/jagm.1995.1009openalex-snapshot
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
inferredcites →https://doi.org/10.1007/bf01934264openalex-snapshot
Finding minimum height elimination trees for interval graphs in polynomial time
inferredcites →https://doi.org/10.1007/s11856-017-1492-0openalex-snapshot
The asymptotic diameter of cyclohedra
inferredcites →https://doi.org/10.1016/0020-0190(89)90161-0openalex-snapshot
Optimal node ranking of trees in linear time
inferredcites →https://doi.org/10.1016/0166-218x(89)90025-5openalex-snapshot
Local optimization on graphs
inferredcites →https://doi.org/10.1016/j.aim.2009.09.016openalex-snapshot
On the rotation distance between binary trees
inferredcites →https://doi.org/10.1016/j.aim.2014.02.035openalex-snapshot
The diameter of associahedra
inferredcites →https://doi.org/10.1016/j.dam.2014.06.019openalex-snapshot
Hitting sets online and unique-max coloring
inferredcites →https://doi.org/10.1016/j.disc.2007.12.092openalex-snapshot
A realization of graph associahedra
inferredcites →https://doi.org/10.1016/j.topol.2005.08.010openalex-snapshot
Coxeter complexes and graph-associahedra
inferredcites →https://doi.org/10.1016/s0166-218x(99)00179-1openalex-snapshot
On the vertex ranking problem for trapezoid, circular-arc and other graphs
inferredcites →https://doi.org/10.1016/s0195-6698(89)80072-1openalex-snapshot
The Associahedron and Triangulations of the n-gon
inferredcites →https://doi.org/10.1017/cbo9780511662041.009openalex-snapshot
Introduction to Greedoids
inferredcites →https://doi.org/10.1109/focs.2006.32openalex-snapshot
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
inferredcites →https://doi.org/10.1109/sfcs.1986.28openalex-snapshot
Lower bounds for accessing binary search trees with rotations
inferredcites →https://doi.org/10.1137/0218004openalex-snapshot
Lower Bounds for Accessing Binary Search Trees with Rotations
inferredcites →https://doi.org/10.1137/1038001openalex-snapshot
Bit Reversal on Uniprocessors
inferredcites →https://doi.org/10.1145/12130.12143openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1145/2897518.2897656openalex-snapshot
Deterministic and probabilistic binary search in graphs
inferredcites →https://doi.org/10.46298/dmtcs.2540openalex-snapshot
Diameters and geodesic properties of generalizations of the associahedron
inferredcites →https://doi.org/10.48550/arxiv.1409.8114openalex-snapshot
Graph properties of graph associahedra

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00026-022-00598-zopenalex-snapshot
Diameter Estimates for Graph Associahedra
inferred← citeshttps://doi.org/10.1007/s00026-026-00821-1openalex-snapshot
Effect of Graph Operations on the Structure and Chromatic Number of Rotation Graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103877openalex-snapshot
The rotation distance of brooms
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.030openalex-snapshot
Bounds on the Diameter of Graph Associahedra
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.309openalex-snapshot
On the structure and diameter of graph associahedra of graphs with a set of true twins
inferred← citeshttps://doi.org/10.1137/1.9781611977073.75openalex-snapshot
Splay trees on trees
inferred← citeshttps://doi.org/10.1145/3595180openalex-snapshot
Competitive Online Search Trees on Trees
inferred← citeshttps://doi.org/10.1145/3689633openalex-snapshot
Combinatorial Generation via Permutation Languages. IV. Elimination Trees
inferred← citeshttps://doi.org/10.26493/1855-3974.2044.fd1openalex-snapshot
Multivariate polynomials for generalized permutohedra
inferred← citeshttps://doi.org/10.4230/lipics.swat.2022.14openalex-snapshot
The Diameter of Caterpillar Associahedra
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.