Sequences of spanning trees and a fixed tree theorem
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
On local transformation of polygons with visibility properties
Theoretical Computer Science
On Local Transformation of Polygons with Visibility Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Information Processing Letters
Computational Geometry: Theory and Applications
Planar tree transformation: Results and counterexample
Information Processing Letters
On the diameter of geometric path graphs of points in convex position
Information Processing Letters
Gray codes for non-crossing partitions and dissections of a convex polygon
Discrete Applied Mathematics
Transforming spanning trees: A lower bound
Computational Geometry: Theory and Applications
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
| Hi-index | 0.00 |