Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Maximum Linear Arrangement
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Generalized Maximum Independent Sets for Trees in Subquadratic Time
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
Computers and Operations Research
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
The minimum weighted covering location problem with distance constraints
Computers and Operations Research
Locating a semi-obnoxious facility with expropriation
Computers and Operations Research
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Location of a facility minimizing nuisance to or from a planar network
Computers and Operations Research
The p-maxian problem on interval graphs
Discrete Applied Mathematics
The multi-facility median problem with Pos/Neg weights on general graphs
Computers and Operations Research
Mechanisms for obnoxious facility game on a path
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
SIAM Journal on Discrete Mathematics
Probabilistic single obnoxious facility location with fixed budget
Information Processing Letters
Dynamic diversification of continuous data
Proceedings of the 15th International Conference on Extending Database Technology
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
The p-maxian problem on a tree
Operations Research Letters
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
Approximation algorithms for maximum dispersion
Operations Research Letters
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Theoretical Computer Science
| Hi-index | 0.00 |