Christian Laforest

Timothée Martinod

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

On the complexity of independent dominating set with obligations in graphs.

[BibT_eX]

[DOI]

Timothée Martinod

Theor. Comput. Sci., 2022

2018

Domination problems with no conflicts.

[BibT_eX]

[DOI]

Alexis Cornet

Discret. Appl. Math., 2018

Graph Problems with Obligations.

[BibT_eX]

[DOI]

Alexis Cornet

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts.

[BibT_eX]

[DOI]

Alexis Cornet

Discret. Math. Theor. Comput. Sci., 2017

2015

Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems.

[BibT_eX]

[DOI]

Stephane Rovedakis

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Some Hamiltonian Properties of One-Conflict Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic.

[BibT_eX]

[DOI]

Raksmey Phan

RAIRO Oper. Res., 2013

A new lower bound on the independence number of graphs.

[BibT_eX]

[DOI]

Eric Angel

Romain Campigotto

Discret. Appl. Math., 2013

Trees in Graphs with Conflict Edges or Forbidden Transitions.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Proceedings of the Theory and Applications of Models of Computation, 2013

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

New Approximation Algorithms for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Raksmey Phan

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs.

[BibT_eX]

[DOI]

Eric Angel

Romain Campigotto

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011

Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2011

Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities.

[BibT_eX]

[DOI]

Eric Angel

Romain Campigotto

Algorithmic Oper. Res., 2011

2010

Analytical and experimental comparison of six algorithms for the vertex cover problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2010

Hardness Results and Heuristic for Multi-groups Interconnection.

[BibT_eX]

[DOI]

Comput. J., 2010

2009

Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks.

[BibT_eX]

[DOI]

JOCN, 2009

Mean analysis of an online algorithm for the vertex cover problem.

[BibT_eX]

[DOI]

Etienne Birmelé

Inf. Process. Lett., 2009

Online time constrained scheduling with penalties.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

A better list heuristic for vertex cover.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Bicriteria scheduling for contiguous and non contiguous parallel tasks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

2007

An Optimal Rebuilding Strategy for an Incremental Tree Problem.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2007

2006

Constructing Incremental Sequences in Graphs.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2006

An Optimal Rebuilding Strategy for a Decremental Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Distributed Approximation Allocation Resources Algorithm for Connecting Groups.

[BibT_eX]

[DOI]

Fabien Baille

Lélia Blin

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

On-line Time-Constrained Scheduling Problem for the Size on kappa machines.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

On-Line Bicriteria Interval Scheduling.

[BibT_eX]

[DOI]

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

On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

A Note On Bicriteria Schedules With Optimal Approximations Ratios.

[BibT_eX]

[DOI]

Fabien Baille

Evripidis Bampis

Parallel Process. Lett., 2004

Hardness results and approximation algorithms of k-tuple domination in graphs.

[BibT_eX]

[DOI]

Ralf Klasing

Inf. Process. Lett., 2004

Assignment of Shortest Paths Spanning Trees in Meshes.

[BibT_eX]

[DOI]

Christian Destré

Sandrine Vial

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Maximization of the Size and the Weight of Schedules of Degradable Intervals.

[BibT_eX]

[DOI]

Fabien Baille

Evripidis Bampis

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

The Broadcast Assignment Problem.

[BibT_eX]

Christian Destré

Sandrine Vial

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002

A good balance between weight and distances for multipoint trees.

[BibT_eX]

Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks.

[BibT_eX]

[DOI]

Sandrine Vial

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

Edge-disjoint spanners of complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

A Distributed token/based Algorithm for the Dynamic Resource Allocation Problem.

[BibT_eX]

[DOI]

Abdelmadjid Bouabdallah

ACM SIGOPS Oper. Syst. Rev., 2000

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

[BibT_eX]

Alexis Irlande

Jean-Claude König

Proceedings of the SIROCCO 7, 2000

1999

Scattering and multi-scattering in trees and meshes, with local routing and without buffering.

[BibT_eX]

[DOI]

Dominique Barth

Parallel Comput., 1999

Edge-disjoint spanners of complete graphs and complete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1997

Broadcast and Gossip in Line-communication Mode.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996

Minimum gossip bus networks.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Networks, 1996

Gossip in Trees under Line-Communication Mode.

[BibT_eX]

[DOI]

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

A Gossip Algorithm for Bus Networks with Buses of Limited Length.

[BibT_eX]

[DOI]

Satoshi Fujita

Stephane Perennes

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

1993

Disjoint Spanning Trees of Small Depth.

[BibT_eX]

Pierre Fraigniaud