| Publication | Date of Publication | Type |
|---|
On the shared transportation problem: computational hardness and exact approach
International Journal of Foundations of Computer Science | 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}
Computers & Operations Research | 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
Theoretical Computer Science | 2021-10-06 | Paper |
Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
Algorithmica | 2021-06-30 | Paper |
Linearizing genomes: exact methods and local search
SOFSEM 2020: Theory and Practice of Computer Science | 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
Journal of Scheduling | 2019-12-30 | Paper |
A method for the energy optimization of a multisource elevator
Informatics in Control, Automation and Robotics | 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
Journal of Discrete Algorithms | 2019-01-18 | Paper |
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
Approximability and exact resolution of the multidimensional binary vector assignment problem
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
On residual approximation in solution extension problems
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
| scientific article; zbMATH DE number 6971072 (Why is no real title available?) | 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
Algorithmica | 2018-06-01 | Paper |
On the complexity of wafer-to-wafer integration
Discrete Optimization | 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 |
On Residual Approximation in Solution Extension Problems
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Instance guaranteed ratio on greedy heuristic for genome scaffolding
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
RAIRO - Operations Research | 2017-01-12 | Paper |
Approximability and exact resolution of the multidimensional binary vector assignment problem
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
European Journal of Operational Research | 2016-10-07 | Paper |
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
Theory of Computing Systems | 2016-03-21 | Paper |
On the complexity of scaffolding problems: from cliques to sparse graphs
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Coupled-tasks in presence of bipartite compatibilities graphs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Multidimensional binary vector assignment problem: standard, structural and above guarantee parameterizations
Lecture Notes in Computer Science | 2015-09-29 | Paper |
On the complexity of wafer-to-wafer integration
Lecture Notes in Computer Science | 2015-09-21 | Paper |
A complexity and approximation framework for the maximization scaffolding problem
Theoretical Computer Science | 2015-07-24 | Paper |
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
4OR | 2014-12-17 | Paper |
Approximating the sparsest \(k\)-subgraph in chordal graphs
Approximation and Online Algorithms | 2014-09-02 | Paper |
On the sum-max graph partitioning problem
Theoretical Computer Science | 2014-06-06 | Paper |
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
Journal of Scheduling | 2014-02-05 | Paper |
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
Algorithmic Operations Research | 2013-12-11 | Paper |
Approximation algorithms for the wafer to wafer integration problem
Approximation and Online Algorithms | 2013-09-13 | Paper |
Sum-max graph partitioning problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
Advances in Operations Research | 2012-09-04 | Paper |
Scheduling in the presence of processor networks : complexity and approximation
RAIRO. Operations Research | 2012-06-20 | Paper |
Scheduling in the presence of processor networks : complexity and approximation
RAIRO. Operations Research | 2012-06-20 | Paper |
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
Advances in Operations Research | 2012-03-08 | Paper |
Scheduling \(UET\)-tasks on a star network: complexity and approximation
4OR | 2011-05-25 | Paper |
Complexity and approximation for precedence constrained scheduling problems with large communication delays
Theoretical Computer Science | 2008-07-31 | Paper |
General scheduling non-approximability results in presence of hierarchical communications
European Journal of Operational Research | 2007-10-10 | Paper |
| scientific article; zbMATH DE number 2090586 (Why is no real title available?) | 2004-08-12 | Paper |
Scheduling tasks with small communication delays for clusters of processors
Annals of Operations Research | 2004-08-10 | Paper |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theoretical Computer Science | 2003-08-17 | Paper |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
Theoretical Computer Science | 2003-01-21 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
RAIRO - Operations Research | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1500535 (Why is no real title available?) | 2000-09-04 | Paper |
