Jean-Claude König

Proceedings of the Combinatorial Optimization and Applications, 2021

2019

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

On residual approximation in solution extension problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

2017

Bounds and approximation results for scheduling coupled-tasks with compatibility constraints.

[BibT_eX]

[DOI]

CoRR, 2017

Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks.

[BibT_eX]

[DOI]

Valentin Pollet

Vincent Boudet

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.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2016

2014

Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques.

[BibT_eX]

[DOI]

Mohammed Boulmalf

Wirel. Commun. Mob. Comput., 2014

On the sum-max graph partitioning problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Coupled-Tasks in Presence of Bipartite Compatibilities Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Approximation algorithm for constrained coupled-tasks scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2014

2012

Scheduling in the presence of processor networks : complexity and approximation.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2012

Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2012

2011

Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor.

[BibT_eX]

[DOI]

J. Sched., 2011

Complexity and approximation for scheduling problem for a torpedo.

[BibT_eX]

[DOI]

Gilles Simonin

Comput. Ind. Eng., 2011

Erratum to: Scheduling <i>UET</i>-tasks on a star network: complexity and approximation.

[BibT_eX]

[DOI]

Benoît Valéry

4OR, 2011

Scheduling <i>UET</i>-tasks on a star network: complexity and approximation.

[BibT_eX]

[DOI]

Benoît Valéry

4OR, 2011

2010

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks.

[BibT_eX]

[DOI]

Gilles Simonin

Electron. Notes Discret. Math., 2010

2009

Approximation Algorithms for Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Introduction to Scheduling., 2009

2008

Complexity and approximation for precedence constrained scheduling problems with large communication delays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks.

[BibT_eX]

[DOI]

Stud. Inform. Univ., 2008

General scheduling non-approximability results in presence of hierarchical communications.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

AT-Angle: A distributed method for localization using angles in sensor networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Julien Champ

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007

A Distributed Method to Localization for Mobile Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

2006

MuR: A Distributed Preliminary Method For Location Techniques in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006

A distributed method for dynamic resolution of BGP oscillations.

[BibT_eX]

[DOI]

Ehoud Ahronovitz

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.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004

General Non-Approximability Results in Presence of Hierarchical Communications.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2002

Oriented hypercubes.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Emmanuel Lazard

Networks, 2002

On the List Colouring Problem.

[BibT_eX]

[DOI]

Olivier Cogis

Jérôme Palaysi

Proceedings of the Advances in Computing Science, 2002

2000

Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Construction of low-cost and low-diameter Steiner trees for multipoint groups.

[BibT_eX]

Alexis Irlande

Christian Laforest

Proceedings of the SIROCCO 7, 2000

1998

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1998

Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs.

[BibT_eX]

[DOI]

Abdel Krim Amoura

IEEE Trans. Parallel Distributed Syst., 1998

Optimal Schedules for d-D Grid Graphs with Communication Delays.

[BibT_eX]

[DOI]

Charles Delorme

Parallel Comput., 1998

Analysis of Gossiping Algorithms with Restricted Buffers.

[BibT_eX]

[DOI]

P. S. Rao

Parallel Algorithms Appl., 1998

Diameter-preserving orientations of the torus.

[BibT_eX]

[DOI]

David W. Krumme

Emmanuel Lazard

Networks, 1998

1997

A Heuristic for a Scheduling Problem with Communication Delays.

[BibT_eX]

[DOI]

Alix Munier

Oper. Res., 1997

Broadcasting and Multicasting in Cut-through Routed Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract).

[BibT_eX]

[DOI]

Charles Delorme

Proceedings of the STACS 96, 1996

On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract).

[BibT_eX]

[DOI]

Aristotelis Giannakos

Alix Munier

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Efficient Algorithms for the Parallel Gaussian Elimination on Distributed Memory Machines.

[BibT_eX]

Abdel Krim Amoura

Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995

1994

Minimum k-broadcast graphs.

[BibT_eX]

[DOI]

Emmanuel Lazard

Discret. Appl. Math., 1994

1993

Symmetric routings of the hypercube.

[BibT_eX]

[DOI]

Dominique Sotteau

Discret. Math., 1993

1992

An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant.

[BibT_eX]

[DOI]

Abdelmadjid Bouabdallah

Parallel Process. Lett., 1992

A Low Overhead Schedule for a 3D-Grid Graph.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

1991

Impact of communications on the complexity of the parallel Gaussian Elimination.

[BibT_eX]

[DOI]

Parallel Comput., 1991

1989

Extensions de réseaux de connexité donnée.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

1987

General and Efficient Decentralized Consensus Protocols.

[BibT_eX]

[DOI]

Jean-Claude Bermond