Pages that link to "Item:Q989526"
From MaRDI portal
The following pages link to Rotation distance is fixed-parameter tractable (Q989526):
Displaying 13 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
- The rotation distance of brooms (Q6201876) (← links)
