Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Parallel Optimal Weighted Links
Transactions on Computational Science III
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Hi-index | 0.00 |