The noising method: a new method for combinatorial optimization. - Irène Charon; Olivier Hudry (Oper. Res. Lett., 1993)

Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint. - Irène Charon; Olivier Hudry; Frédéric Woirgard (Discret. Appl. Math., 1997)

New results on the computation of median orders. - Irène Charon; A. Guénoche; Olivier Hudry; Frédéric Woirgard (Discret. Math., 1997)

Lamarckian genetic algorithmsapplied to the aggregation of preferences. - Irène Charon; Olivier Hudry (Ann. Oper. Res., 1998)

Slater orders and Hamiltonian paths of tournaments. - Irène Charon; Olivier Hudry (Electron. Notes Discret. Math., 2000)

Application of the noising method to the travelling salesman problem. - Irène Charon; Olivier Hudry (Eur. J. Oper. Res., 2000)

General Bounds for Identifying Codes in Some Infinite Regular Graphs. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Electron. J. Comb., 2001)

The noising methods: A generalization of some metaheuristics. - Irène Charon; Olivier Hudry (Eur. J. Oper. Res., 2001)

Identifying Codes with Small Radius in Some Infinite Regular Graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Electron. J. Comb., 2002)

Identifying and locating-dominating codes: NP-Completeness results for directed graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (IEEE Trans. Inf. Theory, 2002)

Links between the Slater Index and the Ryser Index of Tournaments. - Irène Charon; Olivier Hudry (Graphs Comb., 2003)

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. - Irène Charon; Olivier Hudry; Antoine Lobstein (Theor. Comput. Sci., 2003)

The minimum density of an identifying code in the king lattice. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Discret. Math., 2004)

Identifying and locating-dominating codes on chains and cycles. - Nathalie Bertrand 001; Irène Charon; Olivier Hudry; Antoine Lobstein (Eur. J. Comb., 2004)

1-identifying codes on trees. - Nathalie Bertrand 001; Irène Charon; Olivier Hudry; Antoine Lobstein (Australas. J Comb., 2005)

Possible cardinalities for identifying codes in graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Australas. J Comb., 2005)

On the Structure of Identifiable Graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Electron. Notes Discret. Math., 2005)

Possible cardinalities for locating-dominating codes in graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Australas. J Comb., 2006)

Maximum Transfer Distance Between Partitions. - Irène Charon; Lucile Denoeud; Alain Guénoche; Olivier Hudry (J. Classif., 2006)

A linear algorithm for minimum 1-identifying codes in oriented trees. - Irène Charon; Sylvain Gravier; Olivier Hudry; Antoine Lobstein; Michel Mollard; Julien Moncel (Discret. Appl. Math., 2006)

Noising methods for a clique partitioning problem. - Irène Charon; Olivier Hudry (Discret. Appl. Math., 2006)

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. - Irène Charon; Olivier Hudry (Discret. Appl. Math., 2006)

Discriminating codes in bipartite graphs. - Emmanuel Charbit; Irène Charon; Gérard D. Cohen; Olivier Hudry (Electron. Notes Discret. Math., 2006)

Links Between Discriminating and Identifying Codes in the Binary Hamming Space. - Irène Charon; Gérard D. Cohen; Olivier Hudry; Antoine Lobstein (AAECC, 2007)

Application of the "descent with mutations" metaheuristic to a clique partitioning problem. - Irène Charon; Olivier Hudry (RIVF, 2007)

A survey on the linear ordering problem for weighted or unweighted tournaments. - Irène Charon; Olivier Hudry (4OR, 2007)

Structural Properties of Twin-Free Graphs. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Electron. J. Comb., 2007)

Extremal cardinalities for identifying and locating-dominating codes in graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Math., 2007)

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. - Emmanuel Charbit; Irène Charon; Gérard D. Cohen; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2008)

Optimal clustering of multipartite graphs. - Irène Charon; Olivier Hudry (Discret. Appl. Math., 2008)

Discriminating codes in (bipartite) planar graphs. - Irène Charon; Gérard D. Cohen; Olivier Hudry; Antoine Lobstein (Eur. J. Comb., 2008)

ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005). - Irène Charon; Olivier Hudry (RAIRO Oper. Res., 2008)

Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs. - Lucile Belgacem; Irène Charon; Olivier Hudry (CTW, 2009)

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

Erratum. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

A Branch and Bound Method for a Clique Partitioning Problem. - Irène Charon; Olivier Hudry (CTW, 2010)

On the sizes of the graphs G, Gr, Gr G: the directed case. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Australas. J Comb., 2010)

An updated survey on the linear ordering problem for weighted or unweighted tournaments. - Irène Charon; Olivier Hudry (Ann. Oper. Res., 2010)

On the existence of a cycle of length at least 7 in a (1, le 2)-twin-free graph. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discuss. Math. Graph Theory, 2010)

New identifying codes in the binary Hamming space. - Irène Charon; Gérard D. Cohen; Olivier Hudry; Antoine Lobstein (Eur. J. Comb., 2010)

A post-optimization method to route scheduled lightpath demands with multiplicity. - Lucile Belgacem; Irène Charon; Olivier Hudry (Electron. Notes Discret. Math., 2010)

Complexity results for identifying codes in planar graphs. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Int. Trans. Oper. Res., 2010)

Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs. - Irène Charon; Olivier Hudry; Antoine Lobstein (Ars Comb., 2011)

On the sizes of graphs and their powers: The undirected case. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2011)

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments. - Irène Charon; Olivier Hudry (Order, 2011)

Extremal Values for the Maximum Degree in a Twin-Free Graph. - Irène Charon; Olivier Hudry; Antoine Lobstein (Ars Comb., 2012)

Minimum sizes of identifying codes in graphs differing by one vertex. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Cryptogr. Commun., 2013)

Watching systems in graphs: An extension of identifying codes. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2013)

Lexicographic decomposition of preferences. - Irène Charon; Olivier Hudry (Electron. Notes Discret. Math., 2013)

Minimum sizes of identifying codes in graphs differing by one edge. - Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Cryptogr. Commun., 2014)

Maximum size of a minimum watching system and the graphs achieving the bound. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2014)

A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands. - Lucile Belgacem; Irène Charon; Olivier Hudry (Eur. J. Oper. Res., 2014)