default search action
Jean-Claude König
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
On the Shared Transportation Problem: Computational Hardness and Exact Approach. Int. J. Found. Comput. Sci. 35(6): 741-756 (2024) - 2021
- [j33]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: 69-83 (2021) - [c26]Tom Davot
, Rodolphe Giroudeau
Complexity and Approximation Results on the Shared Transportation Problem. COCOA 2021: 140-151
2010 – 2019
- 2019
- [c25]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: 449-460 - 2018
- [j32]Mathias Weller, Annie Chateau
On residual approximation in solution extension problems. J. Comb. Optim. 36(4): 1195-1220 (2018) - 2017
- [c24]Valentin Pollet, Vincent Boudet, Jean-Claude König:
Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks. FedCSIS 2017: 469-472 - [i3]Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR abs/1706.02200 (2017) - [i2]Gilles Simonin
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR abs/1706.02202 (2017) - [i1]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 abs/1706.02214 (2017) - 2016
- [j31]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): 781-795 (2016) - [c23]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. COCOA 2016: 463-476 - 2014
- [j30]Rémi Watrigant, Marin Bougeret
On the sum-max graph partitioning problem. Theor. Comput. Sci. 540: 143-155 (2014) - [j29]Abderrahim Benslimane
Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques. Wirel. Commun. Mob. Comput. 14(17): 1627-1646 (2014) - [c22]Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau:
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT 2014: 110-112 - [c21]Benoît Darties, Gilles Simonin
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO 2014: 161-172 - 2012
- [j28]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): 1-12 (2012) - [j27]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): 1-22 (2012) - [c20]Rémi Watrigant, Marin Bougeret
Sum-Max Graph Partitioning Problem. ISCO 2012: 297-308 - 2011
- [j26]Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 29-48 (2011) - [j25]Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 111 (2011) - [j24]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. 61(2): 352-356 (2011) - [j23]Gilles Simonin
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14(5): 501-509 (2011) - [c19]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
- [j22]Gilles Simonin
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electron. Notes Discret. Math. 36: 647-654 (2010)
2000 – 2009
- 2009
- [p1]Jean-Claude König, Rodolphe Giroudeau:
Approximation Algorithms for Scheduling Problems. Introduction to Scheduling 2009: 23-49 - 2008
- [j21]Rodolphe Giroudeau, Jean-Claude König:
General scheduling non-approximability results in presence of hierarchical communications. Eur. J. Oper. Res. 184(2): 441-457 (2008) - [j20]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) - [j19]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) - [c18]Clément Saad, Abderrahim Benslimane
Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions. GLOBECOM 2008: 78-82 - [c17]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 - [c16]Clément Saad, Abderrahim Benslimane
AT-Angle: A distributed method for localization using angles in sensor networks. ISCC 2008: 1190-1195 - 2007
- [c15]Clément Saad, Abderrahim Benslimane
A Distributed Method to Localization for Mobile Sensor Networks. WCNC 2007: 3058-3063 - 2006
- [c14]Ehoud Ahronovitz, Jean-Claude König, Clément Saad:
A distributed method for dynamic resolution of BGP oscillations. IPDPS 2006 - [c13]Clément Saad, Abderrahim Benslimane
MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks. WiMob 2006: 61-68 - 2005
- [c12]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
- [c11]Rodolphe Giroudeau, Jean-Claude König:
General Non-Approximability Results in Presence of Hierarchical Communications. ISPDC/HeteroPar 2004: 312-319 - 2003
- [j18]Evripidis Bampis
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. Theor. Comput. Sci. 290(3): 1883-1895 (2003) - 2002
- [j17]Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard:
Oriented hypercubes. Networks 39(2): 98-106 (2002) - [j16]Evripidis Bampis
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications. RAIRO Oper. Res. 36(1): 21-36 (2002) - [c10]Olivier Cogis, Jean-Claude König, Jérôme Palaysi:
On the List Colouring Problem. ASIAN 2002: 47-56 - 2000
- [j15]Evripidis Bampis
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Process. Lett. 10(1): 133-140 (2000) - [c9]Alexis Irlande, Jean-Claude König, Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO 2000: 197-210 - [c8]Evripidis Bampis
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454
1990 – 1999
- 1999
- [c7]Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. Euro-Par 1999: 369-372 - 1998
- [j14]Jean-Claude König, David W. Krumme, Emmanuel Lazard:
Diameter-preserving orientations of the torus. Networks 32(1): 1-11 (1998) - [j13]Jean-Claude König, P. S. Rao, Denis Trystram:
Analysis of Gossiping Algorithms with Restricted Buffers. Parallel Algorithms Appl. 13(2): 117-133 (1998) - [j12]Evripidis Bampis
Optimal Schedules for d-D Grid Graphs with Communication Delays. Parallel Comput. 24(11): 1653-1664 (1998) - [j11]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): 679-686 (1998) - [j10]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): 788-802 (1998) - 1997
- [j9]Alix Munier, Jean-Claude König:
A Heuristic for a Scheduling Problem with Communication Delays. Oper. Res. 45(1): 145-147 (1997) - [c6]Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738 - 1996
- [c5]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 - [c4]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) - [c3]Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König:
Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines. PARCO 1995: 569-572 - 1994
- [j7]Jean-Claude König, Emmanuel Lazard:
Minimum k-broadcast graphs. Discret. Appl. Math. 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. Discret. Math. 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 Process. Lett. 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 Process. Lett. 2: 283-290 (1992) - [j3]Evripidis Bampis
A Low Overhead Schedule for a 3D-Grid Graph. Parallel Process. Lett. 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 Comput. 17(1): 55-61 (1991)
1980 – 1989
- 1989
- [j1]Jean-Claude König:
Extensions de réseaux de connexité donnée. Discret. Appl. Math. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: