- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j27 |      | Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König: Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Operations Research 7(1): 1-12 (2012) |
| j26 | | Vincent Boudet, Johanne Cohen, Rodolphe Giroudeau, Jean-Claude König: Scheduling in the presence of processor networks : complexity and approximation. RAIRO - Operations Research 46(1): 1-22 (2012) |
| c19 | | R. Watrigant, M. Bougeret, Rodolphe Giroudeau, Jean-Claude König: Sum-Max Graph Partitioning Problem. ISCO 2012: 297-308 |
| 2011 | ||
| j25 | | Rodolphe Giroudeau, Jean-Claude König, B. Valery: Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 29-48 (2011) |
| j24 | | Rodolphe Giroudeau, Jean-Claude König, B. Valery: Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 111 (2011) |
| j23 | | Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König: Complexity and approximation for scheduling problem for a torpedo. Computers & Industrial Engineering 61(2): 352-356 (2011) |
| j22 | | Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König: Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Scheduling 14(5): 501-509 (2011) |
| c18 | | 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 |
| 2010 | ||
| j21 | | Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König: Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electronic Notes in Discrete Mathematics 36: 647-654 (2010) |
| 2008 | ||
| j20 | | 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) |
| j19 | | 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): 14-39 (2008) |
| j18 | | 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) |
| c17 | | 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 |
| c16 | | 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 |
| c15 | | 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 |
| 2007 | ||
| c14 | | Clément Saad, Abderrahim Benslimane, Jean-Claude König: A Distributed Method to Localization for Mobile Sensor Networks. WCNC 2007: 3058-3063 |
| 2006 | ||
| c13 | | Ehoud Ahronovitz, Jean-Claude König, Clément Saad: A distributed method for dynamic resolution of BGP oscillations. IPDPS 2006 |
| c12 | | Clément Saad, Abderrahim Benslimane, Jean-Claude König: MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks. WiMob 2006: 61-68 |
| 2005 | ||
| c11 | | 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 | ||
| c10 | | Rodolphe Giroudeau, Jean-Claude König: General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar 2004: 312-319 |
| 2003 | ||
| j17 | | 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 | ||
| j16 | | Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard: Oriented hypercubes. Networks 39(2): 98-106 (2002) |
| j15 | | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO - Operations Research 36(1): 21-36 (2002) |
| c9 | | |
| 2000 | ||
| j14 | | 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) |
| c8 |  | Alexis Irlande, Jean-Claude König, Christian Laforest: Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO 2000: 197-210 |
| c7 | | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454 |
| 1999 | ||
| c6 | | Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König: Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par 1999: 369-372 |
| 1998 | ||
| j13 | | Jean-Claude König, David W. Krumme, Emmanuel Lazard: Diameter-preserving orientations of the torus. Networks 32(1): 1-11 (1998) |
| j12 | | Jean-Claude König, P. S. Rao, Denis Trystram: Analysis of Gossiping Algorithms with Restricted Buffers. Parallel Algorithms Appl. 13(2): 117-133 (1998) |
| j11 | | 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) |
| j10 | | 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) |
| j9 | | 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) |
| 1997 | ||
| c5 | | Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud: Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738 |
| 1996 | ||
| c4 | | 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 |
| c3 | | 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 | ||
| j8 | | 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 | ||
| j7 | | Jean-Claude König, Emmanuel Lazard: Minimum k-broadcast graphs. Discrete Applied Mathematics 53(1-3): 199-209 (1994) |
| c2 | | 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 |
| 1993 | ||
| j6 | | Jean-Claude König, Dominique Sotteau: Symmetric routings of the hypercube. Discrete Mathematics 121(1-3): 123-134 (1993) |
| j5 | | 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 | ||
| j4 | | 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) |
| j3 | | 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 | ||
| j2 | | 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 | ||
| j1 | | Jean-Claude König: Extensions de réseaux de connexité donnée. Discrete Applied Mathematics 24(1-3): 197-211 (1989) |
| 1987 | ||
| c1 | | Jean-Claude Bermond, Jean-Claude König, Michel Raynal: General and Efficient Decentralized Consensus Protocols. WDAG 1987: 41-56 |
Data released under the ODC-BY 1.0 license — See also our legal information page