| Publication | Date of Publication | Type |
|---|
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
INFORMS Journal on Computing | 2024-07-29 | Paper |
Approximation algorithms for maximum weighted target cover problem with distance limitations
Journal of Combinatorial Optimization | 2024-07-11 | Paper |
Approximation algorithms for the minimum power partial cover problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Computing connected-\(k\)-subgraph cover with connectivity requirement
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Nearly tight approximation algorithm for (connected) Roman dominating set
Optimization Letters | 2022-10-11 | Paper |
A primal-dual algorithm for the minimum power partial cover problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Theoretical Computer Science | 2022-09-14 | Paper |
| Parallel algorithm for minimum partial dominating set in unit disk graph | 2022-06-29 | Paper |
Approximation algorithm for minimum partial multi-cover under a geometric setting
Optimization Letters | 2022-03-15 | Paper |
Parallel approximation for partial set cover
Applied Mathematics and Computation | 2021-11-11 | Paper |
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Journal of Global Optimization | 2021-08-17 | Paper |
| Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem | 2021-08-09 | Paper |
Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
INFORMS Journal on Computing | 2021-06-23 | Paper |
Data mule scheduling on a path with handling time and time span constraints
Optimization Letters | 2021-02-17 | Paper |
A primal-dual algorithm for the minimum partial set multi-cover problem
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
Theoretical Computer Science | 2019-12-27 | Paper |
Approximation algorithm for the partial set multi-cover problem
Journal of Global Optimization | 2019-12-03 | Paper |
Approximation algorithms for minimum weight connected 3-path vertex cover
Applied Mathematics and Computation | 2019-11-26 | Paper |
| Primal dual algorithm for partial set multi-cover | 2019-10-11 | Paper |
Primal dual based algorithm for degree-balanced spanning tree problem
Applied Mathematics and Computation | 2019-04-29 | Paper |
Approximation algorithm for distance constraint sweep coverage without predetermined base stations
Discrete Mathematics, Algorithms and Applications | 2018-11-14 | Paper |
A simple approximation algorithm for minimum weight partial connected set cover
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Local ratio method on partial set multi-cover
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Approximation algorithm for partial positive influence problem in social network
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
An approximation algorithm for maximum weight budgeted connected set cover
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
