Minimizing the sum of the k largest functions in linear time
Information Processing Letters
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
DCC '02 Proceedings of the Data Compression Conference
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
Improved algorithms for several network location problems with equality measures
Discrete Applied Mathematics
Computers and Operations Research
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
Computers and Operations Research
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
Efficient top-k processing over query-dependent functions
Proceedings of the VLDB Endowment
Heuristic algorithms for route-search queries over geographical data
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Solving the linear multiple choice knapsack problem with two objectives: profit and equity
Computational Optimization and Applications
Finding an Euclidean anti-k-centrum location of a set of points
Computers and Operations Research
Improvement of building automation system
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Multicasting of multiview 3D videos over wireless networks
Proceedings of the 4th Workshop on Mobile Video
Optimal algorithms for the path/tree-shaped facility location problems in trees
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
One-way and round-trip center location problems
Discrete Optimization
A linear-time algorithm for solving continuous maximin knapsack problems
Operations Research Letters
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Operations Research Letters
Operations Research Letters
The linear multiple choice knapsack problem
Operations Research Letters
Energy-efficient multicasting of multiview 3D videos to mobile devices
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special section of best papers of ACM multimedia 2011, and special section on 3D mobile multimedia
Optimal algorithms for the weighted p-center problems on the real line for small p
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.89 |