Jean-Claude König

Publication Activity (10 Years)

Years Active: 1987-2021
Publications (10 Years): 10

Top Topics

Scheduling Problem

Broadcast Scheduling

Graph Partitioning

Approximation Error

Top Venues

RAIRO Oper. Res.

Publications

Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Complexity and inapproximability results for balanced connected subgraph problem. Theor. Comput. Sci. 886 (2021)
Tom Davot, Rodolphe Giroudeau, Jean-Claude König
Complexity and Approximation Results on the Shared Transportation Problem. COCOA (2021)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. COCOA (2019)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On residual approximation in solution extension problems. J. Comb. Optim. 36 (4) (2018)
Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR (2017)
Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR (2017)
Valentin Pollet, Vincent Boudet, Jean-Claude König
Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks. FedCSIS (2017)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR (2017)
Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. 50 (4-5) (2016)
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
On Residual Approximation in Solution Extension Problems. COCOA (2016)
Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT (2014)
Abderrahim Benslimane, Clément Saad, Jean-Claude König, Mohammed Boulmalf
Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques. Wirel. Commun. Mob. Comput. 14 (17) (2014)
Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO (2014)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540 (2014)
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
Sum-Max Graph Partitioning Problem. ISCO (2012)
Vincent Boudet, Johanne Cohen, Rodolphe Giroudeau, Jean-Claude König
Scheduling in the presence of processor networks : complexity and approximation. RAIRO Oper. Res. 46 (1) (2012)
Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Oper. Res. 7 (1) (2012)
Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14 (5) (2011)
Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
-tasks on a star network: complexity and approximation. 4OR 9 (1) (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. 61 (2) (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS (2011)
Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry
-tasks on a star network: complexity and approximation. 4OR 9 (1) (2011)
Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electron. Notes Discret. Math. 36 (2010)
Clément Saad, Abderrahim Benslimane, Jean-Claude König
AT-Angle: A distributed method for localization using angles in sensor networks. ISCC (2008)
Rodolphe Giroudeau, Jean-Claude König
General scheduling non-approximability results in presence of hierarchical communications. Eur. J. Oper. Res. 184 (2) (2008)
Clément Saad, Abderrahim Benslimane, Julien Champ, Jean-Claude König
Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions. GLOBECOM (2008)
Clément Saad, Abderrahim Benslimane, Jean-Claude König
AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks. Stud. Inform. Univ. 6 (1) (2008)
Rodolphe Giroudeau, Jean-Claude König, Farida Kamila Moulai, Jérôme Palaysi
Complexity and approximation for precedence constrained scheduling problems with large communication delays. Theor. Comput. Sci. 401 (1-3) (2008)
Olivier Cogis, Benoît Darties, Sylvain Durand, Jean-Claude König, Geneviève Simonet
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. IFIP TCS (2008)
Clément Saad, Abderrahim Benslimane, Jean-Claude König
A Distributed Method to Localization for Mobile Sensor Networks. WCNC (2007)
Clément Saad, Abderrahim Benslimane, Jean-Claude König
MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks. WiMob (2006)
Ehoud Ahronovitz, Jean-Claude König, Clément Saad
A distributed method for dynamic resolution of BGP oscillations. IPDPS (2006)
Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. Euro-Par (2005)
Rodolphe Giroudeau, Jean-Claude König
General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar (2004)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theor. Comput. Sci. 290 (3) (2003)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. 36 (1) (2002)
Olivier Cogis, Jean-Claude König, Jérôme Palaysi
On the List Colouring Problem. ASIAN (2002)
Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard
Oriented hypercubes. Networks 39 (2) (2002)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS (2000)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. 10 (1) (2000)
Alexis Irlande, Jean-Claude König, Christian Laforest
Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO (2000)
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par (1999)
Evripidis Bampis, Charles Delorme, Jean-Claude König
Optimal Schedules for d-D Grid Graphs with Communication Delays. Parallel Comput. 24 (11) (1998)
Jean-Claude König, P. S. Rao, Denis Trystram
Analysis of Gossiping Algorithms with Restricted Buffers. Parallel Algorithms Appl. 13 (2) (1998)
Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. IEEE Trans. Parallel Distributed Syst. 9 (8) (1998)
Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. IEEE Trans. Parallel Distributed Syst. 9 (7) (1998)
Jean-Claude König, David W. Krumme, Emmanuel Lazard
Diameter-preserving orientations of the torus. Networks 32 (1) (1998)
Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
Broadcasting and Multicasting in Cut-through Routed Networks. IPPS (1997)
Alix Munier, Jean-Claude König
A Heuristic for a Scheduling Problem with Communication Delays. Oper. Res. 45 (1) (1997)
Aristotelis Giannakos, Jean-Claude König, Alix Munier
On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract). Euro-Par, Vol. II (1996)
Evripidis Bampis, Charles Delorme, Jean-Claude König
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). STACS (1996)
Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König
Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines. PARCO (1995)
Evripidis Bampis, Jean-Claude König, Denis Trystram
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. Theor. Comput. Sci. 147 (1&2) (1995)
Evripidis Bampis, Jean-Claude König, Denis Trystram
Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks. PARLE (1994)
Jean-Claude König, Emmanuel Lazard
Minimum k-broadcast graphs. Discret. Appl. Math. 53 (1-3) (1994)
Jean-Claude König, Dominique Sotteau
Symmetric routings of the hypercube. Discret. Math. 121 (1-3) (1993)
Abdelmadjid Bouabdallah, Jean-Claude König
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant. Parallel Process. Lett. 3 (1993)
Abdelmadjid Bouabdallah, Jean-Claude König
An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant. Parallel Process. Lett. 2 (1992)
Evripidis Bampis, Jean-Claude König, Denis Trystram
A Low Overhead Schedule for a 3D-Grid Graph. Parallel Process. Lett. 2 (1992)
Evripidis Bampis, Jean-Claude König, Denis Trystram
Impact of communications on the complexity of the parallel Gaussian Elimination. Parallel Comput. 17 (1) (1991)
Jean-Claude König
Extensions de réseaux de connexité donnée. Discret. Appl. Math. 24 (1-3) (1989)
Jean-Claude Bermond, Jean-Claude König, Michel Raynal
General and Efficient Decentralized Consensus Protocols. WDAG (1987)