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)- 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
- Lagrangian fillings in \(A\)-type and their Kálmán loop orbits
- Posets and spaces of \(k\)-noncrossing RNA structures
- Curves on the torus intersecting at most k times
- Exchange graphs of cluster algebras have the non‐leaving‐face property
- A survey of parameterized algorithms and the complexity of edge modification
- Graphs of triangulations and perfect matchings
- Iterated fiber polytopes
- scientific article; zbMATH DE number 7306891 (Why is no real title available?)
- On the deque conjecture for the splay algorithm
- On minimal triangulations of products of convex polygons
- Combinatorial flip actions and Gelfand pairs for affine Weyl groups
- On bounds for the rotation distance between binary coupling trees
- Computing spin networks
- A direct algorithm for restricted rotation distance
- How I `met' Dov Tamari
- Sampling planar tanglegrams and pairs of disjoint triangulations
- Once punctured disks, non-convex polygons, and pointihedra
- The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
- Constructions and complexity of secondary polytopes
- Restricted rotation distance between binary trees.
- Enumeration of rooted planar triangulations with respect to diagonal flips
- Higher secondary polytopes and regular plabic graphs
- Rainbow cycles in flip graphs
- Rainbow cycles in flip graphs
- The rotation distance of brooms
- Coloring curves on surfaces
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra
- An improved kernel for the flip distance problem on simple convex polygons
- Transforming plane triangulations by simultaneous diagonal flips
- Improved bounds for multipass pairing heaps and path-balanced binary search trees
- Edge contraction on dual ribbon graphs and 2D TQFT
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
- Discriminative measures for comparison of phylogenetic trees
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
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)
