Irène Charon

Publication Activity (10 Years)

Years Active: 1993-2014
Publications (10 Years): 0

Top Topics

Optimization Method

Subgraph Isomorphism

Maximally Stable

Top Venues

Discret. Appl. Math.

Cryptogr. Commun.

Electron. Notes Discret. Math.

Publications

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