The following pages link to Christian Laforest (Q186177):
Displaying 30 items.
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- A better list heuristic for vertex cover (Q963417) (← links)
- Mean analysis of an online algorithm for the vertex cover problem (Q987781) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- (Q1382272) (redirect page) (← links)
- Broadcast and gossip in line-communication mode (Q1382273) (← links)
- Domination problems with no conflicts (Q1752590) (← links)
- A new lower bound on the independence number of graphs (Q1946229) (← links)
- Scattering and multi-scattering in trees and meshes, with local routing and without buffering (Q1960604) (← links)
- On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
- Graph problems with obligations (Q2327111) (← links)
- (Q2865867) (← links)
- New Approximation Algorithms for the Vertex Cover Problem (Q2870054) (← links)
- An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions (Q2927651) (← links)
- Some Hamiltonian Properties of One-Conflict Graphs (Q2946062) (← links)
- (Q2965836) (← links)
- An Optimal Rebuilding Strategy for a Decremental Tree Problem (Q3613650) (← links)
- AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM (Q3636563) (← links)
- (Q4560218) (← links)
- Computing and Combinatorics (Q4681180) (← links)
- (Q4813143) (← links)
- Minimum gossip bus networks (Q4887755) (← links)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)
- Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs (Q5175119) (← links)
- Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic (Q5397695) (← links)
- (Q5406226) (← links)
- Computing and Combinatorics (Q5716948) (← links)
- (Q5755518) (← links)
- Edge-disjoint spanners of complete bipartite graphs (Q5936052) (← links)
