The above article has been cited by the articles listed below.
Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang,
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ,
Theoretical Computer Science 355 (2006) 303-314.(*) Jean-Luc Baril, Jean-Marcel Pallo,
Efficient lower and upper bounds of the diagonal-flip distance between triangulations ,
Information Processing Letters 100 (2006) 131-136.(*) Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood,
Simultaneous diagonal flips in plane triangulations ,
Journal of Graph Theory 54 (2007) 307-330.(*) Joan M. Lucas,
Effective splaying with restricted rotations ,
International Journal of Computer Mathematics 85 (2008) 717-726.(*) Deqiang Wang, Xian Wang, Shaoxi Li, Shaofang Zhang,
Diagonal-flip distance algorithms of three type triangulations ,
Proceedings of 2008 International Conference on Computer Science and Software Engineering (CSSE2008) , Wuhan, China, 12-14 Dec. 2008, pp. 980-983. Joan M. Lucas,
An improved kernel size for rotation distance in binary trees ,
Information Processing Letters 110 (2010) 481-484.(*) Fabrizio Luccio, Antonio Mesa Enriquez, Linda Pagli,
Lower bounds on the rotation distance of binary trees ,
Information Processing Letters 110 (2010) 934-938.(*) Fabrizio Luccio, Bernard Mans, Luke Mathieson, Linda Pagli
Complete Balancing via Rotation ,
Computer Journal 59 (2016) 1252-1263.(*) Ansis Ataols Berzins,
Metric of hierarchical choices and possibilities of its application in computational linguistics ,
Proceedings of Conference on Computational Linguistics and Intellectual Technologies , pp. 1031-1040. Haohong Li, Ge Xia,
An O(3.82^k) Time FPT Algorithm for Convex Flip Distance ,
Discrete & Computational Geometry .
Times cited: 8