General and Efficient Decentralized Consensus Protocols. - Jean-Claude Bermond; Jean-Claude König; Michel Raynal (WDAG, 1987)

Extensions de réseaux de connexité donnée. - Jean-Claude König (Discret. Appl. Math., 1989)

Impact of communications on the complexity of the parallel Gaussian Elimination. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Parallel Comput., 1991)

A Low Overhead Schedule for a 3D-Grid Graph. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Parallel Process. Lett., 1992)

Symmetric routings of the hypercube. - Jean-Claude König; Dominique Sotteau (Discret. Math., 1993)

An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant. - Abdelmadjid Bouabdallah; Jean-Claude König (Parallel Process. Lett., 1993)

Minimum k-broadcast graphs. - Jean-Claude König; Emmanuel Lazard (Discret. Appl. Math., 1994)

Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines. - Abdel Krim Amoura; Evripidis Bampis; Jean-Claude König (PARCO, 1995)

Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. - Evripidis Bampis; Jean-Claude König; Denis Trystram (Theor. Comput. Sci., 1995)

On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract). - Aristotelis Giannakos; Jean-Claude König; Alix Munier (Euro-Par, Vol. II, 1996)

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). - Evripidis Bampis; Charles Delorme; Jean-Claude König (STACS, 1996)

Broadcasting and Multicasting in Cut-through Routed Networks. - Johanne Cohen; Pierre Fraigniaud; Jean-Claude König; André Raspaud (IPPS, 1997)

A Heuristic for a Scheduling Problem with Communication Delays. - Alix Munier; Jean-Claude König (Oper. Res., 1997)

Diameter-preserving orientations of the torus. - Jean-Claude König; David W. Krumme; Emmanuel Lazard (Networks, 1998)

Analysis of Gossiping Algorithms with Restricted Buffers. - Jean-Claude König; P. S. Rao; Denis Trystram (Parallel Algorithms Appl., 1998)

Optimal Schedules for d-D Grid Graphs with Communication Delays. - Evripidis Bampis; Charles Delorme; Jean-Claude König (Parallel Comput., 1998)

Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. - Abdel Krim Amoura; Evripidis Bampis; Jean-Claude König (IEEE Trans. Parallel Distributed Syst., 1998)

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. - Johanne Cohen; Pierre Fraigniaud; Jean-Claude König; André Raspaud (IEEE Trans. Parallel Distributed Syst., 1998)

Construction of low-cost and low-diameter Steiner trees for multipoint groups. - Alexis Irlande; Jean-Claude König; Christian Laforest (SIROCCO, 2000)

Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Parallel Process. Lett., 2000)

On the List Colouring Problem. - Olivier Cogis; Jean-Claude König; Jérôme Palaysi (ASIAN, 2002)

Oriented hypercubes. - Pierre Fraigniaud; Jean-Claude König; Emmanuel Lazard (Networks, 2002)

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (RAIRO Oper. Res., 2002)

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. - Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2003)

General Non-Approximability Results in Presence of Hierarchical Communications. - Rodolphe Giroudeau; Jean-Claude König (ISPDC/HeteroPar, 2004)

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. - Rodolphe Giroudeau; Jean-Claude König; Feryal-Kamila Moulaï; Jérôme Palaysi (Euro-Par, 2005)

A distributed method for dynamic resolution of BGP oscillations. - Ehoud Ahronovitz; Jean-Claude König; Clément Saad (IPDPS, 2006)

MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks. - Clément Saad; Abderrahim Benslimane; Jean-Claude König (WiMob, 2006)

A Distributed Method to Localization for Mobile Sensor Networks. - Clément Saad; Abderrahim Benslimane; Jean-Claude König (WCNC, 2007)

Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions. - Clément Saad; Abderrahim Benslimane; Julien Champ; Jean-Claude König (GLOBECOM, 2008)

The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. - Olivier Cogis; Benoît Darties; Sylvain Durand; Jean-Claude König; Geneviève Simonet (IFIP TCS, 2008)

AT-Angle: A distributed method for localization using angles in sensor networks. - Clément Saad; Abderrahim Benslimane; Jean-Claude König (ISCC, 2008)

General scheduling non-approximability results in presence of hierarchical communications. - Rodolphe Giroudeau; Jean-Claude König (Eur. J. Oper. Res., 2008)

AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks. - Clément Saad; Abderrahim Benslimane; Jean-Claude König (Stud. Inform. Univ., 2008)

Complexity and approximation for precedence constrained scheduling problems with large communication delays. - Rodolphe Giroudeau; Jean-Claude König; Farida Kamila Moulai; Jérôme Palaysi (Theor. Comput. Sci., 2008)

Approximation Algorithms for Scheduling Problems. - Jean-Claude König; Rodolphe Giroudeau (Introduction to Scheduling, 2009)

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. - Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (Electron. Notes Discret. Math., 2010)

Scheduling UET-tasks on a star network: complexity and approximation. - Rodolphe Giroudeau; Jean-Claude König; Benoît Valéry (4OR, 2011)

Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. - Rodolphe Giroudeau; Jean-Claude König; Benoît Valéry (4OR, 2011)

Complexity and approximation for scheduling problem for a torpedo. - Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (Comput. Ind. Eng., 2011)

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. - Gilles Simonin; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (J. Sched., 2011)

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. - Gilles Simonin; Rodolphe Giroudeau; Benoît Darties; Jean-Claude König (Algorithmic Oper. Res., 2012)

Scheduling in the presence of processor networks : complexity and approximation. - Vincent Boudet; Johanne Cohen; Rodolphe Giroudeau; Jean-Claude König (RAIRO Oper. Res., 2012)

Approximation algorithm for constrained coupled-tasks scheduling problem. - Gilles Simonin; Benoît Darties; Jean-Claude König; Rodolphe Giroudeau (CoDIT, 2014)

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. - Benoît Darties; Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König (ISCO, 2014)

On the sum-max graph partitioning problem. - Rémi Watrigant; Marin Bougeret; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2014)

Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques. - Abderrahim Benslimane; Clément Saad; Jean-Claude König; Mohammed Boulmalf (Wirel. Commun. Mob. Comput., 2014)

Some complexity and approximation results for coupled-tasks scheduling problem according to topology. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Gilles Simonin (RAIRO Oper. Res., 2016)

Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks. - Valentin Pollet; Vincent Boudet; Jean-Claude König (FedCSIS, 2017)

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. - Rodolphe Giroudeau; Jean-Claude König; Benoît Darties; Gilles Simonin (CoRR, 2017)

On residual approximation in solution extension problems. - Mathias Weller; Annie Chateau; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (J. Comb. Optim., 2018)

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. - Benoît Darties; Rodolphe Giroudeau; Jean-Claude König; Valentin Pollet (COCOA, 2019)

Complexity and Approximation Results on the Shared Transportation Problem. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (COCOA, 2021)

Complexity and inapproximability results for balanced connected subgraph problem. - Timothée Martinod; Valentin Pollet; Benoît Darties; Rodolphe Giroudeau; Jean-Claude König (Theor. Comput. Sci., 2021)

On the Shared Transportation Problem: Computational Hardness and Exact Approach. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (Int. J. Found. Comput. Sci., 2024)