| 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 |
| 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 |
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 |
Optimal schedules for d-D grid graphs with communication delays
STACS 96 | 2017-11-16 | Paper |
On Residual Approximation in Solution Extension Problems
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 |
Coupled-tasks in presence of bipartite compatibilities graphs
Lecture Notes in Computer Science | 2015-10-16 | 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 |
Sum-max graph partitioning problem
Lecture Notes in Computer Science | 2012-11-02 | 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 |
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 |
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1955762 (Why is no real title available?) | 2003-07-29 | 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 |
| Diameter-preserving orientations of the torus | 2002-07-21 | Paper |
Oriented hypercubes
Networks | 2002-07-01 | Paper |
On the complexity of scheduling with large communication delays
European Journal of Operational Research | 2000-11-08 | Paper |
| scientific article; zbMATH DE number 1500535 (Why is no real title available?) | 2000-09-04 | Paper |
Minimizing the schedule length for a parallel 3D-grid precedence graph
European Journal of Operational Research | 1999-02-22 | Paper |
A Heuristic for a Scheduling Problem with Communication Delays
Operations Research | 1997-11-25 | Paper |
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
Theoretical Computer Science | 1997-02-28 | Paper |
Minimum \(k\)-broadcast graphs
Discrete Applied Mathematics | 1994-12-11 | Paper |
Symmetric routings of the hypercube
Discrete Mathematics | 1993-12-20 | Paper |
Impact of communications of the complexity of the parallel Gaussian elimination
Parallel Computing | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4113979 (Why is no real title available?) | 1989-01-01 | Paper |
Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
Discrete Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4058843 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4076593 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4078622 (Why is no real title available?) | 1988-01-01 | Paper |
