| Publication | Date of Publication | Type |
|---|
| On the shared transportation problem: computational hardness and exact approach | 2024-09-24 | Paper |
| Exact method approaches for the differential harvest problem | 2022-12-21 | Paper |
| Using VRPSolver to efficiently solve the \textsc{differential harvest problem} | 2022-12-19 | Paper |
| Complexity and approximation results on the shared transportation problem | 2022-06-29 | Paper |
| Complexity and inapproximability results for balanced connected subgraph problem | 2021-10-06 | Paper |
| Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds | 2021-06-30 | Paper |
| Linearizing Genomes: Exact Methods and Local Search | 2020-07-20 | Paper |
| The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs | 2020-05-13 | Paper |
| Power Edge Set and Zero Forcing Set remain difficult in cubic graphs | 2020-02-25 | Paper |
| Parameterized complexity of a coupled-task scheduling problem | 2019-12-30 | Paper |
| A Method for the Energy Optimization of a Multisource Elevator | 2019-11-27 | Paper |
| New results about the linearization of scaffolds sharing repeated contigs | 2019-10-11 | Paper |
| New polynomial-time algorithm around the scaffolding problem | 2019-07-25 | Paper |
| Complexity and lowers bounds for power edge set problem | 2019-01-18 | Paper |
| Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations | 2018-12-10 | Paper |
| Approximability and exact resolution of the multidimensional binary vector assignment problem | 2018-12-06 | Paper |
| On residual approximation in solution extension problems | 2018-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553433 | 2018-11-02 | Paper |
| Improved complexity for power edge set problem | 2018-06-15 | Paper |
| Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases | 2018-06-01 | Paper |
| On the complexity of wafer-to-wafer integration | 2018-05-24 | Paper |
| On the linearization of scaffolds sharing repeated contigs | 2018-03-26 | Paper |
| New insights for power edge set problem | 2018-02-26 | Paper |
| Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding | 2017-02-01 | Paper |
| On Residual Approximation in Solution Extension Problems | 2017-02-01 | Paper |
| Some complexity and approximation results for coupled-tasks scheduling problem according to topology | 2017-01-12 | Paper |
| Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem | 2016-11-30 | Paper |
| Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows | 2016-10-07 | Paper |
| Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs | 2016-03-21 | Paper |
| On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs | 2016-02-05 | Paper |
| Coupled-Tasks in Presence of Bipartite Compatibilities Graphs | 2015-10-16 | Paper |
| Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations | 2015-09-29 | Paper |
| On the Complexity of Wafer-to-Wafer Integration | 2015-09-21 | Paper |
| A complexity and approximation framework for the maximization scaffolding problem | 2015-07-24 | Paper |
| Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs | 2015-01-13 | Paper |
| A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration | 2014-12-17 | Paper |
| Approximating the Sparsest k-Subgraph in Chordal Graphs | 2014-09-02 | Paper |
| On the sum-max graph partitioning problem | 2014-06-06 | Paper |
| Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor | 2014-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2865876 | 2013-12-11 | Paper |
| Approximation Algorithms for the Wafer to Wafer Integration Problem | 2013-09-13 | Paper |
| Sum-Max Graph Partitioning Problem | 2012-11-02 | Paper |
| Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks | 2012-09-04 | Paper |
| Scheduling in the presence of processor networks : complexity and approximation | 2012-06-20 | Paper |
| Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks | 2012-05-13 | Paper |
| Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks | 2012-03-08 | Paper |
| Scheduling \(UET\)-tasks on a star network: complexity and approximation | 2011-05-25 | Paper |
| Complexity and approximation for precedence constrained scheduling problems with large communication delays | 2008-07-31 | Paper |
| General scheduling non-approximability results in presence of hierarchical communications | 2007-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813032 | 2004-08-12 | Paper |
| Scheduling tasks with small communication delays for clusters of processors | 2004-08-10 | Paper |
| An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. | 2003-08-17 | Paper |
| An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications | 2003-01-21 | Paper |
| On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501554 | 2000-09-04 | Paper |
