On minimum stars, minimum Steiner stars, and maximum matchings
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Fast approximations for sums of distances, clustering and the Fermat--Weber problem
Computational Geometry: Theory and Applications
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
Journal of Experimental Algorithmics (JEA)
New results on shortest paths in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM (JACM)
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Computer-Aided Design
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours
Journal of Discrete Algorithms
Clustering for metric and non-metric distance measures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On stars and Steiner stars: II
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved bounds on the average distance to the Fermat--Weber center of a convex object
Information Processing Letters
The projection median of a set of points
Computational Geometry: Theory and Applications
Single facility collection depots location problem in the plane
Computational Geometry: Theory and Applications
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Power-aware scheduling for makespan and flow
Journal of Scheduling
On the Fermat--Weber center of a convex object
Computational Geometry: Theory and Applications
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Euclidean shortest paths in simple cube curves at a glance
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Clustering for metric and nonmetric distance measures
ACM Transactions on Algorithms (TALG)
Efficient robot-based energy maintenance in wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
A comparison between two representatives of a set of graphs: median vs. barycenter graph
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
A generic framework for median graph computation based on a recursive embedding approach
Computer Vision and Image Understanding
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Largest and smallest tours and convex hulls for imprecise points
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Efficient algorithms for detecting regular point configurations
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Generalized median string computation by means of string embedding in vector spaces
Pattern Recognition Letters
The dynamics and internal geometry of the three-city noxious location problem
Mathematical and Computer Modelling: An International Journal
Discrete Optimization
Facility location problems with uncertainty on the plane
Discrete Optimization
Mining GPS traces to recommend common meeting points
Proceedings of the 16th International Database Engineering & Applications Sysmposium
On the Fermat-Weber Point of a Polygonal Chain and its Generalizations
Fundamenta Informaticae
Similarity of polygonal curves in the presence of outliers
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |