| 2008 |
|---|
| 33 | EE | 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: 78-82 |
| 32 | EE | 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: 115-126 |
| 31 | EE | Clément Saad,
Abderrahim Benslimane,
Jean-Claude König:
AT-Angle: A distributed method for localization using angles in sensor networks.
ISCC 2008: 1190-1195 |
| 30 | EE | Rodolphe Giroudeau,
Jean-Claude König:
General scheduling non-approximability results in presence of hierarchical communications.
European Journal of Operational Research 184(2): 441-457 (2008) |
| 29 | EE | 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): 107-119 (2008) |
| 2006 |
|---|
| 28 | EE | Ehoud Ahronovitz,
Jean-Claude König,
Clément Saad:
A distributed method for dynamic resolution of BGP oscillations.
IPDPS 2006 |
| 2005 |
|---|
| 27 | EE | 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: 252-261 |
| 2004 |
|---|
| 26 | EE | Rodolphe Giroudeau,
Jean-Claude König:
General Non-Approximability Results in Presence of Hierarchical Communications.
ISPDC/HeteroPar 2004: 312-319 |
| 2003 |
|---|
| 25 | | 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): 1883-1895 (2003) |
| 2002 |
|---|
| 24 | EE | Olivier Cogis,
Jean-Claude König,
Jérôme Palaysi:
On the List Colouring Problem.
ASIAN 2002: 47-56 |
| 23 | EE | Pierre Fraigniaud,
Jean-Claude König,
Emmanuel Lazard:
Oriented hypercubes.
Networks 39(2): 98-106 (2002) |
| 2000 |
|---|
| 22 | | Alexis Irlande,
Jean-Claude König,
Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups.
SIROCCO 2000: 197-210 |
| 21 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
STACS 2000: 443-454 |
| 20 | | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Parallel Processing Letters 10(1): 133-140 (2000) |
| 1999 |
|---|
| 19 | EE | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Euro-Par 1999: 369-372 |
| 1998 |
|---|
| 18 | EE | Abdel Krim Amoura,
Evripidis Bampis,
Jean-Claude König:
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs.
IEEE Trans. Parallel Distrib. Syst. 9(7): 679-686 (1998) |
| 17 | EE | Johanne Cohen,
Pierre Fraigniaud,
Jean-Claude König,
André Raspaud:
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.
IEEE Trans. Parallel Distrib. Syst. 9(8): 788-802 (1998) |
| 16 | EE | Jean-Claude König,
David W. Krumme,
Emmanuel Lazard:
Diameter-preserving orientations of the torus.
Networks 32(1): 1-11 (1998) |
| 15 | EE | Jean-Claude König,
P. S. Rao,
Denis Trystram:
Analysis of Gossiping Algorithms with Restricted Buffers.
Parallel Algorithms Appl. 13(2): 117-133 (1998) |
| 14 | | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays.
Parallel Computing 24(11): 1653-1664 (1998) |
| 1997 |
|---|
| 13 | EE | Johanne Cohen,
Pierre Fraigniaud,
Jean-Claude König,
André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks.
IPPS 1997: 734-738 |
| 1996 |
|---|
| 12 | | Aristotelis Giannakos,
Jean-Claude König,
Alix Munier:
On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract).
Euro-Par, Vol. II 1996: 578-581 |
| 11 | | Evripidis Bampis,
Charles Delorme,
Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).
STACS 1996: 655-666 |
| 1995 |
|---|
| 10 | EE | 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): 1-18 (1995) |
| 1994 |
|---|
| 9 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks.
PARLE 1994: 122-133 |
| 8 | | Jean-Claude König,
Emmanuel Lazard:
Minimum k-broadcast graphs.
Discrete Applied Mathematics 53(1-3): 199-209 (1994) |
| 1993 |
|---|
| 7 | EE | Jean-Claude König,
Dominique Sotteau:
Symmetric routings of the hypercube.
Discrete Mathematics 121(1-3): 123-134 (1993) |
| 6 | | Abdelmadjid Bouabdallah,
Jean-Claude König:
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant.
Parallel Processing Letters 3: 305 (1993) |
| 1992 |
|---|
| 5 | | Abdelmadjid Bouabdallah,
Jean-Claude König:
An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant.
Parallel Processing Letters 2: 283-290 (1992) |
| 4 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
A Low Overhead Schedule for a 3D-Grid Graph.
Parallel Processing Letters 2: 363-372 (1992) |
| 1991 |
|---|
| 3 | | Evripidis Bampis,
Jean-Claude König,
Denis Trystram:
Impact of communications on the complexity of the parallel Gaussian Elimination.
Parallel Computing 17(1): 55-61 (1991) |
| 1989 |
|---|
| 2 | EE | Jean-Claude König:
Extensions de réseaux de connexité donnée.
Discrete Applied Mathematics 24(1-3): 197-211 (1989) |
| 1987 |
|---|
| 1 | | Jean-Claude Bermond,
Jean-Claude König,
Michel Raynal:
General and Efficient Decentralized Consensus Protocols.
WDAG 1987: 41-56 |
