Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Reflexivity of Point Sets
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Traversing a set of points with a minimum number of turns
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Connected Rectilinear Graphs on Point Sets
Graph Drawing
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
SIAM Journal on Discrete Mathematics
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Drawing hamiltonian cycles with no large angles
GD'09 Proceedings of the 17th international conference on Graph Drawing
On covering points with minimum turns
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Maximizing maximal angles for plane straight-line graphs
Computational Geometry: Theory and Applications
Maximizing maximal angles for plane straight-line graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |