SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
Computers and Operations Research
Self-Stabilizing Clustering of Tree Networks
IEEE Transactions on Computers
An improved algorithm for the p-center problem on interval graphs with unit lengths
Computers and Operations Research
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters
A stabilizing algorithm for clustering of line networks
EURASIP Journal on Wireless Communications and Networking
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs
Proceedings of the fifth international workshop on Foundations of mobile computing
Kinetic maintenance of mobile k-centres on trees
Discrete Applied Mathematics
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the minimum diameter spanning tree problem
Information Processing Letters
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
SIAM Journal on Discrete Mathematics
Efficient algorithms for the weighted 2-center problem in a cactus graph
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The connected p-center problem on block graphs with forbidden vertices
Theoretical Computer Science
One-way and round-trip center location problems
Discrete Optimization
Improved algorithms to network p-center location problems
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |