Jean-Claude König
According to our database1,
Jean-Claude König
authored at least 55 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
1
1
1
2
2
4
1
3
1
2
1
5
1
1
1
2
1
1
1
1
1
1
2
3
1
2
1
1
1
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Int. J. Found. Comput. Sci., September, 2024
2021
Theor. Comput. Sci., 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
2019
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
2017
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints.
CoRR, 2017
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017
2016
Some complexity and approximation results for coupled-tasks scheduling problem according to topology.
RAIRO Oper. Res., 2016
2014
Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques.
Wirel. Commun. Mob. Comput., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the International Conference on Control, 2014
2012
RAIRO Oper. Res., 2012
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph.
Algorithmic Oper. Res., 2012
2011
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor.
J. Sched., 2011
Comput. Ind. Eng., 2011
Erratum to: Scheduling <i>UET</i>-tasks on a star network: complexity and approximation.
4OR, 2011
4OR, 2011
2010
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks.
Electron. Notes Discret. Math., 2010
2009
Proceedings of the Introduction to Scheduling., 2009
2008
Complexity and approximation for precedence constrained scheduling problems with large communication delays.
Theor. Comput. Sci., 2008
Stud. Inform. Univ., 2008
General scheduling non-approximability results in presence of hierarchical communications.
Eur. J. Oper. Res., 2008
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008
Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008
2007
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007
2006
Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006
2005
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005
2004
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004
2003
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theor. Comput. Sci., 2003
2002
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications.
RAIRO Oper. Res., 2002
Proceedings of the Advances in Computing Science, 2002
2000
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Parallel Process. Lett., 2000
Construction of low-cost and low-diameter Steiner trees for multipoint groups.
Proceedings of the SIROCCO 7, 2000
1998
IEEE Trans. Parallel Distributed Syst., 1998
IEEE Trans. Parallel Distributed Syst., 1998
Parallel Comput., 1998
Parallel Algorithms Appl., 1998
1997
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997
1996
Proceedings of the STACS 96, 1996
On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996
1995
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.
Theor. Comput. Sci., 1995
Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines.
Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995
1994
1993
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant.
Parallel Process. Lett., 1993
1992
1991
Parallel Comput., 1991
1989
1987
Proceedings of the Distributed Algorithms, 1987