Rotation Distance, Triangulations, and Hyperbolic Geometry
From MaRDI portal
Recommendations
Cites work
- A note on some tree similarity measures
- A theorem on graphs
- A Theorem on Planar Graphs
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 192942 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Hyperbolic geometry: The first 150 years
- Self-adjusting binary search trees
- Wagner's theorem for torus graphs
Cited in
(only showing first 100 items - show all)- Multitriangulations as complexes of star polygons
- On minimal triangulations of products of convex polygons
- Bounding restricted rotation distance
- On the deque conjecture for the splay algorithm
- Catalan triangulations of the Möbius band
- A type-B associahedron.
- Geometry of the space of phylogenetic trees
- An efficient upper bound of the rotation distance of binary trees
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
- Simultaneous flips on triangulated surfaces
- Lower bounds on the rotation distance of binary trees
- Edge contraction on dual ribbon graphs and 2D TQFT
- Arc diagrams, flip distances, and Hamiltonian triangulations
- The dual diameter of triangulations
- Flipping edge-labelled triangulations
- Symmetries of unlabelled planar triangulations
- The genus of curve, pants and flip graphs
- Once punctured disks, non-convex polygons, and pointihedra
- The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
- Signed diagonal flips and the four color theorem
- Enumeration of rooted planar triangulations with respect to diagonal flips
- On the upper bound on the rotation distance of binary trees
- Spin network quantum simulator
- Restricted rotation distance between binary trees.
- Poincaré rotation numbers and Riesz and Voronoi means.
- The geometry of graphs and some of its algorithmic applications
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- Topological recursion for symplectic volumes of moduli spaces of curves
- A lower bound for the simplexity of the n-cube via hyperbolic volumes
- A generalization of diagonal flips in a convex polygon
- Flipping in spirals
- Transforming plane triangulations by simultaneous diagonal flips
- Diameter estimates for graph associahedra
- Combinatorial flip actions and Gelfand pairs for affine Weyl groups
- Higher secondary polytopes and regular plabic graphs
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game
- Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex
- Non-leaving-face property for marked surfaces
- A Motzkin filter in the Tamari lattice
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
- Neighborhoods of trees in circular orderings
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- The Markovian hyperbolic triangulation
- The pruning-grafting lattice of binary trees
- A direct algorithm for restricted rotation distance
- Compatibility fans for graphical nested complexes
- Flip-graph moduli spaces of filling surfaces
- Computing the flip distance between triangulations
- Modular flip-graphs of one-holed surfaces
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
- Flip distance between triangulations of a planar point set is APX-hard
- The diameter of associahedra
- The cost of offline binary search tree algorithms and the complexity of the request sequence
- Computing spin networks
- Cut loci in lens manifolds
- Graphs of triangulations and perfect matchings
- The asymptotic diameter of cyclohedra
- Flip graphs of bounded degree triangulations
- On bounds for the rotation distance between binary coupling trees
- Two shortest path metrics on well-formed parentheses strings
- Noncrossing sets and a Grassmann associahedron
- A linear-time approximation algorithm for rotation distance
- An algorithm to compute the möbius function of the rotation lattice of binary trees
- A Glimpse into Thurston’s Work
- Finding Eulerian cycle decompositions and the rotation distance between binary trees
- Dissecting the circle, at random
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- scientific article; zbMATH DE number 5520855 (Why is no real title available?)
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- Iterated fiber polytopes
- Topological recursion for the Poincaré polynomial of the combinatorial moduli space of curves
- scientific article; zbMATH DE number 1121313 (Why is no real title available?)
- scientific article; zbMATH DE number 1161281 (Why is no real title available?)
- Multitriangulations, pseudotriangulations and primitive sorting networks
- scientific article; zbMATH DE number 1555932 (Why is no real title available?)
- Distances in domino flip graphs
- Coloring curves on surfaces
- A sequent calculus for a semi-associative law
- Edge Conflicts do not Determine Geodesics in the Associahedron
- On a subposet of the Tamari lattice
- scientific article; zbMATH DE number 910896 (Why is no real title available?)
- The higher Stasheff‐Tamari posets
- Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
- How I `met' Dov Tamari
- scientific article; zbMATH DE number 1428719 (Why is no real title available?)
- scientific article; zbMATH DE number 1439421 (Why is no real title available?)
- A point set whose space of triangulations is disconnected
- The diameter of type \(D\) associahedra and the non-leaving-face property
- 2-toroids and their 3-triangulation
- Improved bounds for multipass pairing heaps and path-balanced binary search trees
- Ranking trees generated by rotations
- Posets and spaces of \(k\)-noncrossing RNA structures
- scientific article; zbMATH DE number 7204452 (Why is no real title available?)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- Rainbow cycles in flip graphs
- A journey from the Hitchin section to the oper moduli
- Continuous-time birth-death MCMC for Bayesian regression tree models
- Discriminative measures for comparison of phylogenetic trees
- \(W\)-associahedra have the non-leaving-face property
This page was built for publication: Rotation Distance, Triangulations, and Hyperbolic Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799259)
