Rotation Distance, Triangulations, and Hyperbolic Geometry
From MaRDI portal
Publication:3799259
Recommendations
Cites work
- 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?)
- A Theorem on Planar Graphs
- A note on some tree similarity measures
- A theorem on graphs
- 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)- A Glimpse into Thurston’s Work
- Random recursive triangulations of the disk via fragmentation theory
- Multitriangulations as complexes of star polygons
- The diameter of type \(D\) associahedra and the non-leaving-face property
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- Minimum ideal triangulations of hyperbolic 3-manifolds
- Symmetries of unlabelled planar triangulations
- Ranking trees generated by rotations
- An algorithm to compute the möbius function of the rotation lattice of binary trees
- The asymptotic diameter of cyclohedra
- Restricted rotation distance between k-ary trees
- Rectangulotopes
- Celebrating Loday's associahedron
- Arc diagrams, flip distances, and Hamiltonian triangulations
- The dual diameter of triangulations
- The genus of curve, pants and flip graphs
- Signed diagonal flips and the four color theorem
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- The geometry of flip graphs and mapping class groups
- Rotation distance for rank bounded trees
- The higher Stasheff‐Tamari posets
- An improved kernel size for rotation distance in binary trees
- Flip distance and triangulations of a polyhedron
- \(W\)-associahedra have the non-leaving-face property
- scientific article; zbMATH DE number 7204452 (Why is no real title available?)
- Flip distance between triangulations of a planar point set is APX-hard
- Flips in planar graphs
- Cut loci in lens manifolds
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game
- Non-leaving-face property for marked surfaces
- Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
- Diameter estimates for graph associahedra
- Computing the flip distance between triangulations
- Flip distances between graph orientations
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
- The cost of offline binary search tree algorithms and the complexity of the request sequence
- Geometry of the space of phylogenetic trees
- Flipping in spirals
- scientific article; zbMATH DE number 1428719 (Why is no real title available?)
- Finding Eulerian cycle decompositions and the rotation distance between binary trees
- An efficient upper bound of the rotation distance of binary trees
- Flip distance between two triangulations of a point set is NP-complete
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- scientific article; zbMATH DE number 910896 (Why is no real title available?)
- On a subposet of the Tamari lattice
- A sequent calculus for a semi-associative law
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
- Simultaneous flips on triangulated surfaces
- scientific article; zbMATH DE number 1121313 (Why is no real title available?)
- Poincaré rotation numbers and Riesz and Voronoi means.
- Normalish Amenable Subgroups of the R. Thompson Groups
- Topological recursion for symplectic volumes of moduli spaces of curves
- Noncrossing sets and a Grassmann associahedron
- Rotation sequences and edge-colouring of binary tree pairs
- Spin network quantum simulator
- The rotation graph of \(k\)-ary trees is Hamiltonian
- The Markovian hyperbolic triangulation
- \(k\)-restricted rotation distance between binary trees
- Flipping edge-labelled triangulations
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations
- On the rotation distance between binary trees
- Triangle-free triangulations
- Refined upper bounds for right-arm rotation distances
- A type-B associahedron.
- The Fermat star of binary trees
- Distances in domino flip graphs
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Rotation distance is fixed-parameter tractable
- Bounding restricted rotation distance
- A Motzkin filter in the Tamari lattice
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- The diameter of associahedra
- Two shortest path metrics on well-formed parentheses strings
- scientific article; zbMATH DE number 1555932 (Why is no real title available?)
- Compatibility fans for graphical nested complexes
- The phagocyte lattice of Dyck words
- Associahedra via spines
- Edge Conflicts do not Determine Geodesics in the Associahedron
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- On flips in planar matchings
- Neighborhoods of trees in circular orderings
- A point set whose space of triangulations is disconnected
- The pruning-grafting lattice of binary trees
- Catalan triangulations of the Möbius band
- A journey from the Hitchin section to the oper moduli
- Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex
- Lower bounds on the rotation distance of binary trees
- Flip-graph moduli spaces of filling surfaces
- Modular flip-graphs of one-holed surfaces
- Topological recursion for the Poincaré polynomial of the combinatorial moduli space of curves
- 2-toroids and their 3-triangulation
- A generalization of diagonal flips in a convex polygon
- A linear-time approximation algorithm for rotation distance
- scientific article; zbMATH DE number 5520855 (Why is no real title available?)
- Dissecting the circle, at random
- Rotational tree structures on binary trees and triangulations
- On the upper bound on the rotation distance of binary trees
- The geometry of graphs and some of its algorithmic applications
- Flip graphs of bounded degree triangulations
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)
