An $\mathcal {O}(3.82^{k})$ Time $\textsf {FPT}$ Algorithm for Convex Flip Distance
- 5 November 2023
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (3) , 702-718
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- An improved kernel size for rotation distance in binary treesInformation Processing Letters, 2010
- Rotation distance is fixed-parameter tractableInformation Processing Letters, 2009
- Flips in planar graphsComputational Geometry, 2009
- An efficient algorithm for estimating rotation distance between two binary treesInternational Journal of Computer Mathematics, 2005
- A lower bound on the number of triangulations of planar point setsComputational Geometry, 2004
- On the upper bound on the rotation distance of binary treesInformation Processing Letters, 1989
- Rotation distance, triangulations, and hyperbolic geometryJournal of the American Mathematical Society, 1988
- On the rotation distance in the lattice of binary treesInformation Processing Letters, 1987
- A note on some tree similarity measuresInformation Processing Letters, 1982
- Topological sorting of large networksCommunications of the ACM, 1962