Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Approximation algorithms for TSP with neighborhoods in the plane
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
Coverage for robotics – A survey of recent results
Annals of Mathematics and Artificial Intelligence
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Balanced Partition of Minimum Spanning Trees
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Robotic Exploration, Brownian Motion and Electrical Resistance
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Service-constrained network design problems
Nordic Journal of Computing
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
TSP with neighborhoods of varying size
Journal of Algorithms
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Minimum Spanning Tree with Neighborhoods
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On A☆ search with stopover areas
International Journal of Geographical Information Science
TSP with neighborhoods of varying size
Journal of Algorithms
Double rulings for information brokerage in sensor networks
IEEE/ACM Transactions on Networking (TON)
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Theoretical Computer Science
Proceedings of the twenty-sixth annual symposium on Computational geometry
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Racetrack: an approximation algorithm for the mobile sink routing problem
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Fast track article: Designing hierarchical sensor networks with mobile data collectors
Pervasive and Mobile Computing
Optimizing data collection path in sensor networks with mobile elements
International Journal of Automation and Computing
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Minimum-perimeter intersecting polygons
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On approximating the TSP with intersecting neighborhoods
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
An integer programming-based local search for the covering salesman problem
Computers and Operations Research
Mind the gap: A study of Tube tour
Computers and Operations Research
Efficient data collection from wireless nodes under the two-ring communication model
International Journal of Robotics Research
An evolutionary approach for the dubins' traveling salesman problem with neighborhoods
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
The Generalized Covering Salesman Problem
INFORMS Journal on Computing
Controlled mobility in stochastic and dynamic wireless networks
Queueing Systems: Theory and Applications
Parameterized algorithms for generalized traveling salesman problems in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Computers and Electronics in Agriculture
A survey on coverage path planning for robotics
Robotics and Autonomous Systems
Collecting data in ad-hoc networks with reduced uncertainty
Ad Hoc Networks
| Hi-index | 0.05 |