Publication | Date of Publication | Type |
---|
An improved approximation algorithm for a scheduling problem with transporter coordination | 2024-04-02 | Paper |
The existence and efficiency of PMMS allocations | 2024-02-20 | Paper |
A semi brute-force search approach for (balanced) clustering | 2024-01-09 | Paper |
Approximation and competitive algorithms for single-minded selling problem | 2023-10-16 | Paper |
Exact and approximation algorithms for PMMS under identical constraints | 2023-08-04 | Paper |
Approximation algorithms for diversity-bounded center problems | 2023-08-04 | Paper |
EFX under budget constraint | 2023-08-03 | Paper |
A linear-time certifying algorithm for recognizing generalized series-parallel graphs | 2022-12-08 | Paper |
Online data caching in edge-cloud collaborative system with the data center | 2022-10-31 | Paper |
Principal-agent problem under the linear contract | 2022-10-18 | Paper |
On stochastic \(k\)-facility location | 2022-07-01 | Paper |
An online algorithm for data caching problem in edge computing | 2022-07-01 | Paper |
Constant competitive algorithms for unbounded one-way trading under monotone hazard rate | 2022-03-07 | Paper |
Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties | 2021-09-10 | Paper |
Influence maximization under the non-progressive linear threshold model | 2021-07-08 | Paper |
Minimizing energy on homogeneous processors with shared memory | 2021-07-08 | Paper |
Robustness and approximation for the linear contract design | 2021-07-05 | Paper |
Search complexity: a way for the quantitative analysis of the search space | 2021-07-05 | Paper |
Minimizing energy on homogeneous processors with shared memory | 2021-04-14 | Paper |
A constant FPT approximation algorithm for hard-capacitated \(k\)-means | 2021-01-18 | Paper |
\(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space | 2020-09-01 | Paper |
Approximation algorithms for the partial assignment problem | 2020-09-01 | Paper |
Approximation algorithms for the selling with preference | 2020-07-29 | Paper |
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint | 2020-06-24 | Paper |
Algorithmic pricing for the partial assignment | 2020-05-13 | Paper |
Approximation algorithm and incentive ratio of the selling with preference | 2020-05-13 | Paper |
Offline and online algorithms for single-minded selling problem | 2020-04-22 | Paper |
Universal facility location in generalized metric space | 2020-02-24 | Paper |
Weighted throughput maximization with calibrations | 2020-01-16 | Paper |
Online uniformly inserting points on the sphere | 2020-01-13 | Paper |
Realtime Channel Recommendation: Switch Smartly While Watching TV | 2019-04-26 | Paper |
Approximation strategy-proof mechanisms for obnoxious facility location on a line | 2018-07-20 | Paper |
Unbounded one-way trading on distributions with monotone hazard rate | 2018-02-26 | Paper |
Online Inserting Points Uniformly on the Sphere | 2017-05-05 | Paper |
Constrained pairwise and center-star sequences alignment problems | 2016-10-20 | Paper |
Competitive algorithms for unbounded one-way trading | 2015-12-08 | Paper |
Strategy-Proof Mechanism for Obnoxious Facility Location on a Line | 2015-10-29 | Paper |
Competitive Algorithms for Unbounded One-Way Trading | 2015-05-20 | Paper |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing | 2014-10-06 | Paper |
Online pricing for bundles of multiple items | 2014-09-18 | Paper |
A new upper bound 2.5545 on 2D Online Bin Packing | 2014-09-09 | Paper |
On the Complexity of Constrained Sequences Alignment Problems | 2014-09-02 | Paper |
Constant-competitive tree node assignment | 2014-01-13 | Paper |
Deterministic polynomial-time algorithms for designing short DNA words | 2014-01-10 | Paper |
A note on a selfish bin packing problem | 2013-08-07 | Paper |
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing | 2013-08-02 | Paper |
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing | 2013-06-11 | Paper |
Uniformly inserting points on square grid | 2013-04-04 | Paper |
COMPETITIVE ALGORITHMS FOR ONLINE PRICING | 2012-10-15 | Paper |
Online Pricing for Multi-type of Items | 2012-07-16 | Paper |
Online call control in cellular networks revisited | 2012-03-09 | Paper |
Online tree node assignment with resource augmentation | 2011-12-15 | Paper |
Competitive Algorithms for Online Pricing | 2011-08-17 | Paper |
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing | 2011-06-03 | Paper |
ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING | 2011-01-19 | Paper |
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing | 2010-12-09 | Paper |
Absolute and asymptotic bounds for online frequency allocation in cellular networks | 2010-09-16 | Paper |
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks | 2010-09-07 | Paper |
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs | 2010-07-20 | Paper |
Online Uniformly Inserting Points on Grid | 2010-07-20 | Paper |
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words | 2010-06-17 | Paper |
A note on on-line broadcast scheduling with deadlines | 2010-06-16 | Paper |
A constant-competitive algorithm for online OVSF code assignment | 2010-02-23 | Paper |
Greedy online frequency allocation in cellular networks | 2010-01-29 | Paper |
1-Bounded Space Algorithms for 2-Dimensional Bin Packing | 2009-12-17 | Paper |
A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs | 2009-11-25 | Paper |
Online Tree Node Assignment with Resource Augmentation | 2009-07-23 | Paper |
Variable-Size Rectangle Covering | 2009-07-07 | Paper |
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs | 2009-03-06 | Paper |
On-line scheduling of parallel jobs on two machines | 2008-11-18 | Paper |
A Constant-Competitive Algorithm for Online OVSF Code Assignment | 2008-05-27 | Paper |
Frequency Allocation Problems for Linear Cellular Networks | 2008-04-24 | Paper |
Online bin packing of fragile objects with application in cellular networks | 2008-04-23 | Paper |
Online OVSF Code Assignment with Resource Augmentation | 2008-01-04 | Paper |
Efficient algorithms for finding a longest common increasing subsequence | 2007-07-19 | Paper |
Approximating the minimum weight weak vertex cover | 2007-01-09 | Paper |
Algorithms and Computation | 2006-11-14 | Paper |
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time | 2006-08-14 | Paper |
Computing and Combinatorics | 2006-01-11 | Paper |
Computing and Combinatorics | 2005-06-15 | Paper |