Irène Charon

53 papers C 2Journal 49Unranked 2
YearRankTypeTitle / Venue / Authors
2014 J jnl
A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands.
Eur. J. Oper. Res.
Lucile Belgacem, Irène Charon, Olivier Hudry
2014 J jnl
Maximum size of a minimum watching system and the graphs achieving the bound.
Discret. Appl. Math.
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2014 J jnl
Minimum sizes of identifying codes in graphs differing by one edge.
Cryptogr. Commun.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2013 J jnl
Lexicographic decomposition of preferences.
Electron. Notes Discret. Math.
Irène Charon, Olivier Hudry
2013 J jnl
Minimum sizes of identifying codes in graphs differing by one vertex.
Cryptogr. Commun.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2013 J jnl
Watching systems in graphs: An extension of identifying codes.
Discret. Appl. Math.
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2012 J jnl
Extremal Values for the Maximum Degree in a Twin-Free Graph.
Ars Comb.
Irène Charon, Olivier Hudry, Antoine Lobstein
2011 J jnl
Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.
Ars Comb.
Irène Charon, Olivier Hudry, Antoine Lobstein
2011 J jnl
Maximum Distance Between Slater Orders and Copeland Orders of Tournaments.
Order
Irène Charon, Olivier Hudry
2011 J jnl
On the sizes of graphs and their powers: The undirected case.
Discret. Appl. Math.
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010 C conf
A Branch and Bound Method for a Clique Partitioning Problem.
CTW
Irène Charon, Olivier Hudry
2010 J jnl
A post-optimization method to route scheduled lightpath demands with multiplicity.
Electron. Notes Discret. Math.
Lucile Belgacem, Irène Charon, Olivier Hudry
2010 J jnl
An updated survey on the linear ordering problem for weighted or unweighted tournaments.
Ann. Oper. Res.
Irène Charon, Olivier Hudry
2010 J jnl
Complexity results for identifying codes in planar graphs.
Int. Trans. Oper. Res.
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010 J jnl
New identifying codes in the binary Hamming space.
Eur. J. Comb.
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
2010 J jnl
On the existence of a cycle of length at least 7 in a
Discuss. Math. Graph Theory
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010 J jnl
On the sizes of the graphs G, G
Australas. J Comb.
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010 J jnl
Watching Systems in graphs: an extension of Identifying Codes
CoRR
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2009 J jnl
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Adv. Math. Commun.
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009 J jnl
Erratum.
Adv. Math. Commun.
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009 C conf
Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.
CTW
Lucile Belgacem, Irène Charon, Olivier Hudry
2008 J jnl
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005).
RAIRO Oper. Res.
Irène Charon, Olivier Hudry
2008 J jnl
Discriminating codes in (bipartite) planar graphs.
Eur. J. Comb.
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
2008 J jnl
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.
Adv. Math. Commun.
Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
2008 J jnl
Optimal clustering of multipartite graphs.
Discret. Appl. Math.
Irène Charon, Olivier Hudry
2007 J jnl
A survey on the linear ordering problem for weighted or unweighted tournaments.
4OR
Irène Charon, Olivier Hudry
2007 — conf
Application of the "descent with mutations" metaheuristic to a clique partitioning problem.
RIVF
Irène Charon, Olivier Hudry
2007 J jnl
Extremal cardinalities for identifying and locating-dominating codes in graphs.
Discret. Math.
Irène Charon, Olivier Hudry, Antoine Lobstein
2007 — conf
Links Between Discriminating and Identifying Codes in the Binary Hamming Space.
AAECC
Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein
2007 J jnl
Structural Properties of Twin-Free Graphs.
Electron. J. Comb.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2006 J jnl
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
Discret. Appl. Math.
Irène Charon, Olivier Hudry
2006 J jnl
A linear algorithm for minimum 1-identifying codes in oriented trees.
Discret. Appl. Math.
Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
2006 J jnl
Discriminating codes in bipartite graphs.
Electron. Notes Discret. Math.
Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry
2006 J jnl
Maximum Transfer Distance Between Partitions.
J. Classif.
Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry
2006 J jnl
Noising methods for a clique partitioning problem.
Discret. Appl. Math.
Irène Charon, Olivier Hudry
2006 J jnl
Possible cardinalities for locating-dominating codes in graphs.
Australas. J Comb.
Irène Charon, Olivier Hudry, Antoine Lobstein
2005 J jnl
1-identifying codes on trees.
Australas. J Comb.
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
2005 J jnl
On the Structure of Identifiable Graphs.
Electron. Notes Discret. Math.
Irène Charon, Olivier Hudry, Antoine Lobstein
2005 J jnl
Possible cardinalities for identifying codes in graphs.
Australas. J Comb.
Irène Charon, Olivier Hudry, Antoine Lobstein
2004 J jnl
Identifying and locating-dominating codes on chains and cycles.
Eur. J. Comb.
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
2004 J jnl
The minimum density of an identifying code in the king lattice.
Discret. Math.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2003 J jnl
Links between the Slater Index and the Ryser Index of Tournaments.
Graphs Comb.
Irène Charon, Olivier Hudry
2003 J jnl
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Theor. Comput. Sci.
Irène Charon, Olivier Hudry, Antoine Lobstein
2002 J jnl
Identifying Codes with Small Radius in Some Infinite Regular Graphs.
Electron. J. Comb.
Irène Charon, Olivier Hudry, Antoine Lobstein
2002 J jnl
Identifying and locating-dominating codes: NP-Completeness results for directed graphs.
IEEE Trans. Inf. Theory
Irène Charon, Olivier Hudry, Antoine Lobstein
2001 J jnl
General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electron. J. Comb.
Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2001 J jnl
The noising methods: A generalization of some metaheuristics.
Eur. J. Oper. Res.
Irène Charon, Olivier Hudry
2000 J jnl
Application of the noising method to the travelling salesman problem.
Eur. J. Oper. Res.
Irène Charon, Olivier Hudry
2000 J jnl
Slater orders and Hamiltonian paths of tournaments.
Electron. Notes Discret. Math.
Irène Charon, Olivier Hudry
1998 J jnl
Lamarckian genetic algorithmsapplied to the aggregation of preferences.
Ann. Oper. Res.
Irène Charon, Olivier Hudry
1997 J jnl
New results on the computation of median orders.
Discret. Math.
Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard
1997 J jnl
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.
Discret. Appl. Math.
Irène Charon, Olivier Hudry, Frédéric Woirgard
1993 J jnl
The noising method: a new method for combinatorial optimization.
Oper. Res. Lett.
Irène Charon, Olivier Hudry