Jean-Claude König

Available identifiers

zbMath Open konig.jean-claudeMaRDI QIDQ935149

List of research outcomes

Publication	Date of Publication	Type
On the shared transportation problem: computational hardness and exact approach	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	2021-10-06	Paper
On residual approximation in solution extension problems	2018-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q4553433	2018-11-02	Paper
Optimal schedules for d-D grid graphs with communication delays	2017-11-16	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
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs	2015-10-16	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
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph	2013-12-11	Paper
Sum-Max Graph Partitioning Problem	2012-11-02	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
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
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4417351	2003-07-29	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
Diameter-preserving orientations of the torus	2002-07-21	Paper
Oriented hypercubes	2002-07-01	Paper
On the complexity of scheduling with large communication delays	2000-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4501554	2000-09-04	Paper
Minimizing the schedule length for a parallel 3D-grid precedence graph	1999-02-22	Paper
A Heuristic for a Scheduling Problem with Communication Delays	1997-11-25	Paper
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks	1997-02-28	Paper
Minimum \(k\)-broadcast graphs	1994-12-11	Paper
Symmetric routings of the hypercube	1993-12-20	Paper
Impact of communications of the complexity of the parallel Gaussian elimination	1991-01-01	Paper
Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4729335	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3793717	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3806796	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3809117	1988-01-01	Paper

Research outcomes over time

This page was built for person: Jean-Claude König