| Publication | Date of Publication | Type |
|---|
Generalized unrelated machine scheduling problem
| 2024-05-14 | Paper |
Optimal in-place suffix sorting
String Processing and Information Retrieval | 2023-07-28 | Paper |
Approximation algorithms for clustering with dynamic points
| 2023-02-07 | Paper |
Approximation algorithms for clustering with dynamic points
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Optimal in-place suffix sorting
Information and Computation | 2022-06-08 | Paper |
A PTAS for a class of stochastic dynamic programs
| 2021-07-28 | Paper |
SVM via saddle point optimization: new bounds and distributed algorithms
| 2020-08-25 | Paper |
Odd Yao-Yao graphs are not spanners
| 2020-08-18 | Paper |
Maximizing expected utility for stochastic combinatorial optimization problems
Mathematics of Operations Research | 2020-03-12 | Paper |
Approximation algorithms for the connected sensor cover problem
Theoretical Computer Science | 2020-01-29 | Paper |
Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference
Machine Learning | 2019-08-23 | Paper |
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Coordination of supply chain with a dominant retailer under demand disruptions
Mathematical Problems in Engineering | 2019-02-08 | Paper |
A two-stage mechanism for ordinal peer assessment
| 2018-11-08 | Paper |
A constant factor approximation algorithm for fault-tolerant \(k\)-median
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A fully polynomial-time approximation scheme for approximating a sum of random variables
Operations Research Letters | 2018-09-28 | Paper |
Balanced splitting on weighted intervals
Operations Research Letters | 2018-09-28 | Paper |
Electronic markets selection in supply chain with uncertain demand and uncertain price
Mathematical Problems in Engineering | 2018-08-27 | Paper |
\(k\)-regret minimizing set: efficient algorithms and hardness
| 2018-07-18 | Paper |
Stochastic \(k\)-center and \(j\)-flat-center problems
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Near-linear time approximation schemes for geometric maximum coverage
Theoretical Computer Science | 2018-05-15 | Paper |
\(\varepsilon\)-kernel coresets for stochastic points
| 2018-03-02 | Paper |
Almost All Even Yao-Yao Graphs Are Spanners
| 2018-03-02 | Paper |
Coordination of supply chain with a dominant retailer under government price regulation by revenue sharing contracts
Annals of Operations Research | 2018-02-16 | Paper |
Analysis of permissible delay in payment of a two-Level supply chain for deteriorating item considering cash constraint
| 2018-01-29 | Paper |
Generalized machine activation problems
| 2017-09-29 | Paper |
Capacitated center problems with two-sided bounds and outliers
| 2017-09-22 | Paper |
Ranking with diverse intents and correlated contents
| 2017-02-21 | Paper |
Matroid and knapsack center problems
Algorithmica | 2016-06-28 | Paper |
Approximation algorithms for stochastic combinatorial optimization problems
Journal of the Operations Research Society of China | 2016-06-01 | Paper |
Range queries on uncertain data
Theoretical Computer Science | 2015-12-08 | Paper |
Linear Time Approximation Schemes for Geometric Maximum Coverage
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Approximation algorithms for the connected sensor cover problem
Lecture Notes in Computer Science | 2015-10-29 | Paper |
A PTAS for the Weighted Unit Disk Cover Problem
Automata, Languages, and Programming | 2015-10-27 | Paper |
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
Automata, Languages, and Programming | 2015-10-27 | Paper |
Efficient algorithms for the one-dimensional \(k\)-center problem
Theoretical Computer Science | 2015-10-08 | Paper |
Range queries on uncertain data
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Learning Arbitrary Statistical Mixtures of Discrete Distributions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Optimal allocation for chunked-reward advertising
Web and Internet Economics | 2015-01-12 | Paper |
Forecasting time series with genetic programming based on least square method
Journal of Systems Science and Complexity | 2014-09-15 | Paper |
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
scientific article; zbMATH DE number 6297793 (Why is no real title available?)
| 2014-05-22 | Paper |
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Discrete & Computational Geometry | 2013-09-23 | Paper |
Matroid and knapsack center problems
Lecture Notes in Computer Science | 2013-03-19 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings
Algorithmica | 2012-12-06 | Paper |
The coordination of a closed-loop supply chain based on the reward and punishment contract
Journal of Systems Science and Mathematical Sciences | 2012-10-05 | Paper |
Coordination of supply chain inventory and routing under tripartite return contract
Journal of Systems Science and Mathematical Sciences | 2012-10-05 | Paper |
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Lecture Notes in Computer Science | 2012-08-14 | Paper |
The load-distance balancing problem
Networks | 2012-06-18 | Paper |
Risk management of supply and cash flows in supply chains
International Series in Operations Research & Management Science | 2011-07-08 | Paper |
Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm
Journal of Systems Science and Complexity | 2011-02-25 | Paper |
Densest \(k\)-subgraph approximation on intersection graphs
Approximation and Online Algorithms | 2011-02-15 | Paper |
New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)
Approximation and Online Algorithms | 2011-02-15 | Paper |
A bi-level programming model for competitive location under a pricing constraint
| 2010-11-05 | Paper |
Clustering with diversity
Automata, Languages and Programming | 2010-09-07 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
Information Processing Letters | 2010-08-20 | Paper |
Algorithms for core stability, core largeness, exactness, and extendability of flow games
Frontiers of Mathematics in China | 2010-02-26 | Paper |
An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
Journal of Software | 2010-02-12 | Paper |
Integrated logistics facilities network design for 3PLS under uncertainty
| 2010-01-13 | Paper |
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
Lecture Notes in Computer Science | 2009-03-06 | Paper |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Approximating the Maximum Sharing Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Algorithms and Computation | 2008-05-27 | Paper |
On Approximating the Maximum Simple Sharing Problem
Algorithms and Computation | 2008-04-24 | Paper |
Traversing the Machining Graph
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Non-metric Multicommodity and Multilevel Facility Location
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
scientific article; zbMATH DE number 5203953 (Why is no real title available?)
| 2007-10-23 | Paper |
