On the solution value of the continuous P-center location problem on a graph
Mathematics of Operations Research
The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
NP-Hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands
Mathematics of Operations Research
Computing the geodesic center of a simple polygon
Discrete & Computational Geometry
An overview of representative problems in location research
Management Science
Algebraic optimization: the Fermat-Weber location problem
Mathematical Programming: Series A and B
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
A faster algorithm for the two-center decision problem
Information Processing Letters
A multifacility location problem on median spaces
Discrete Applied Mathematics
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
Location and shape of a rectangular facility in Rn : convexity properties
Mathematical Programming: Series A and B
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
More planar two-center algorithms
Computational Geometry: Theory and Applications
An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
The Capacitated K-Center Problem (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
IEEE Transactions on Computers
Improved bounds on the average distance to the Fermat--Weber center of a convex object
Information Processing Letters
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
On the Fermat--Weber center of a convex object
Computational Geometry: Theory and Applications
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Robust second-order source separation identifies experimental responses in biomedical imaging
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
New bounds on the average distance from the Fermat-Weber center of a planar convex body
Discrete Optimization
Facility location problems with uncertainty on the plane
Discrete Optimization
| Hi-index | 0.00 |