| Publication | Date of Publication | Type |
|---|
| A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops | 2024-05-30 | Paper |
| Online \(k\)-color spanning disk problems | 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 | 2022-12-19 | Paper |
| A local search 4/3-approximation algorithm for the minimum 3-path partition problem | 2022-10-31 | Paper |
| Learn from history for online bipartite matching | 2022-10-31 | Paper |
| A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint | 2022-06-13 | Paper |
| Online crowdsourced truck delivery using historical information | 2022-05-20 | Paper |
| No-wait two-stage flowshop problem with multi-task flexibility of the first machine | 2021-11-30 | Paper |
| An improved approximation algorithm for the minimum common integer partition problem | 2021-11-25 | Paper |
| Multiple sink location problem in path networks with a combinational objective | 2021-05-05 | Paper |
| Single-machine scheduling with job-dependent machine deterioration | 2020-02-12 | Paper |
| A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops | 2019-10-17 | Paper |
| A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem | 2019-10-11 | Paper |
| An approximation algorithm for genome sorting by reversals to recover all adjacencies | 2019-06-25 | Paper |
| A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan | 2019-04-26 | Paper |
| Algorithms for communication scheduling in data gathering network with data compression | 2019-01-11 | Paper |
| The Steiner traveling salesman problem with online advanced edge blockages | 2018-07-12 | Paper |
| An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops | 2018-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636539 | 2018-04-19 | Paper |
| Approximation for vertex cover in \(\beta\)-conflict graphs | 2017-11-09 | Paper |
| Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem | 2017-06-13 | Paper |
| Machine scheduling with a maintenance interval and job delivery coordination | 2017-03-28 | Paper |
| An FPTAS for the parallel two-stage flowshop problem | 2017-02-06 | Paper |
| The Steiner traveling salesman problem with online edge blockages | 2016-10-06 | Paper |
| Approximating the maximum multiple RNA interaction problem | 2016-06-27 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| Smoothed heights of tries and patricia tries | 2015-12-11 | Paper |
| Machine Scheduling with a Maintenance Interval and Job Delivery Coordination | 2015-11-12 | Paper |
| A 0.5358-approximation for Bandpass-2 | 2015-09-28 | Paper |
| An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem | 2015-09-11 | Paper |
| Algorithms for Cut Problems on Trees | 2015-09-11 | Paper |
| Approximating the minimum independent dominating set in perturbed graphs | 2014-10-06 | Paper |
| On the Smoothed Heights of Trie and Patricia Index Trees | 2014-09-26 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems | 2014-04-16 | Paper |
| Approximation Algorithms for the Maximum Multiple RNA Interaction Problem | 2013-12-10 | Paper |
| Approximating the Minimum Independent Dominating Set in Perturbed Graphs | 2013-06-11 | Paper |
| An Improved Approximation Algorithm for the Bandpass Problem | 2012-07-16 | Paper |
