The following pages link to Olivier Hudry (Q226963):
Displaying 45 items.
- (Q2776560) (← links)
- (Q2816068) (← links)
- (Q2864455) (← links)
- A post-optimization method to route scheduled lightpath demands with multiplicity (Q2883572) (← links)
- (Q2918543) (← links)
- On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph (Q2997586) (← links)
- (Q3001191) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Liminaire au n° spécial : Mathématiques discrètes : théories et usages. Numéro en hommage à Bruno Leclerc (Q3010523) (← links)
- Consensus theories. An oriented survey (Q3010532) (← links)
- (Q3025212) (← links)
- (Q3081834) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Maximum de la distance de transfert à une partition donnée (Q3405694) (← links)
- (Q3405839) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- Discriminating codes in bipartite graphs (Q3439638) (← links)
- Self-tuning of the noising methods (Q3646090) (← links)
- (Q4339963) (← links)
- (Q4350077) (← links)
- (Q4395490) (← links)
- (Q4501634) (← links)
- (Q4659582) (← links)
- Identifying and locating-dominating codes: NP-completeness results for directed graphs (Q4677540) (← links)
- (Q4788093) (← links)
- (Q4811470) (← links)
- (Q4878464) (← links)
- (Q4880988) (← links)
- (Q4946665) (← links)
- Weighted Tournament Solutions (Q5133007) (← links)
- (Q5133053) (← links)
- (Q5133215) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Application of the “descent with mutations” metaheuristic to a clique partitioning problem (Q5242283) (← links)
- Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks (Q5302505) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)
- NP-hardness of the computation of a median equivalence relation in classification (Régnier problem) (Q5412503) (← links)
- (Q5487899) (← links)
- General bounds for identifying codes in some infinite regular graphs (Q5954312) (← links)
- The noising methods: A generalization of some metaheuristics (Q5954829) (← links)
- Identifying codes with small radius in some infinite regular graphs (Q5960786) (← links)
- Some results about a conjecture on identifying codes in complete suns (Q6070992) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
- Iiro Honkala's contributions to identifying codes (Q6521556) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
