The following pages link to (Q4942049):
Displaying 21 items.
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
- On the rotation distance between binary trees (Q846983) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- A quadratic distance bound on sliding between crossing-free spanning trees (Q883234) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Flips in planar graphs (Q950400) (← links)
- An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
- Restricted rotation distance between binary trees. (Q1853166) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Flipping in spirals (Q1984590) (← links)
- A Motzkin filter in the Tamari lattice (Q2342623) (← links)
- Motzkin subposets and Motzkin geodesics in Tamari lattices. (Q2350595) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Edge Conflicts do not Determine Geodesics in the Associahedron (Q4638997) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
