The following pages link to Jean-Claude Konig (Q935149):
Displayed 39 items.
- Item:Q935149 (redirect page) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Item:Q935149 (redirect page) (← links)
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks (Q672453) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity) (Q1122506) (← links)
- Item:Q935149 (redirect page) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
- Symmetric routings of the hypercube (Q1309461) (← links)
- Minimum \(k\)-broadcast graphs (Q1339891) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- Impact of communications of the complexity of the parallel Gaussian elimination (Q2277765) (← links)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- (Q2865876) (← links)
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374) (← links)
- Sum-Max Graph Partitioning Problem (Q3167634) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
- (Q3793717) (← links)
- (Q3806796) (← links)
- (Q3809117) (← links)
- A Heuristic for a Scheduling Problem with Communication Delays (Q4367272) (← links)
- (Q4417351) (← links)
- (Q4501554) (← links)
- Oriented hypercubes (Q4537616) (← links)
- Diameter-preserving orientations of the torus (Q4540058) (← links)
- (Q4553433) (← links)
- Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
- (Q4729335) (← links)