| Publication | Date of Publication | Type |
|---|
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
Annals of Operations Research | 2024-05-30 | Paper |
Online \(k\)-color spanning disk problems
Journal of Combinatorial Optimization | 2023-09-27 | Paper |
| A 21/16-Approximation for the Minimum 3-Path Partition Problem | 2023-02-03 | Paper |
Online generalized assignment problem with historical information
Computers & Operations Research | 2022-12-19 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Learn from history for online bipartite matching
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
Theoretical Computer Science | 2022-06-13 | Paper |
Online crowdsourced truck delivery using historical information
European Journal of Operational Research | 2022-05-20 | Paper |
No-wait two-stage flowshop problem with multi-task flexibility of the first machine
Information Sciences | 2021-11-30 | Paper |
An improved approximation algorithm for the minimum common integer partition problem
Information and Computation | 2021-11-25 | Paper |
Multiple sink location problem in path networks with a combinational objective
Optimization Letters | 2021-05-05 | Paper |
Single-machine scheduling with job-dependent machine deterioration
Journal of Scheduling | 2020-02-12 | Paper |
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
European Journal of Operational Research | 2019-10-17 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
(available as arXiv preprint) | 2019-10-11 | Paper |
An approximation algorithm for genome sorting by reversals to recover all adjacencies
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
Frontiers in Algorithmics | 2019-04-26 | Paper |
Algorithms for communication scheduling in data gathering network with data compression
Algorithmica | 2019-01-11 | Paper |
The Steiner traveling salesman problem with online advanced edge blockages
Computers & Operations Research | 2018-07-12 | Paper |
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Theoretical Computer Science | 2018-06-05 | Paper |
Single machine scheduling with job-dependent machine deterioration
(available as arXiv preprint) | 2018-04-19 | Paper |
Approximation for vertex cover in \(\beta\)-conflict graphs
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
Theoretical Computer Science | 2017-06-13 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Optimization Letters | 2017-03-28 | Paper |
An FPTAS for the parallel two-stage flowshop problem
Theoretical Computer Science | 2017-02-06 | Paper |
The Steiner traveling salesman problem with online edge blockages
European Journal of Operational Research | 2016-10-06 | Paper |
Approximating the maximum multiple RNA interaction problem
Theoretical Computer Science | 2016-06-27 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
Smoothed heights of tries and patricia tries
Theoretical Computer Science | 2015-12-11 | Paper |
Machine scheduling with a maintenance interval and job delivery coordination
Frontiers in Algorithmics | 2015-11-12 | Paper |
A 0.5358-approximation for Bandpass-2
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
An improved approximation algorithm for the minimum common integer partition problem
Algorithms and Computation | 2015-09-11 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Theoretical Computer Science | 2014-10-06 | Paper |
On the smoothed heights of trie and patricia index trees
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Theoretical Computer Science | 2014-08-26 | Paper |
Set cover, set packing and hitting set for tree convex and tree-like set systems
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Approximation algorithms for the maximum multiple RNA interaction problem
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Approximating the minimum independent dominating set in perturbed graphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
An improved approximation algorithm for the bandpass problem
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
