Irène Charon

According to our database1, Irène Charon authored at least 52 papers between 1993 and 2014.

Collaborative distances:



In proceedings 
PhD thesis 




A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands.
Eur. J. Oper. Res., 2014

Maximum size of a minimum watching system and the graphs achieving the bound.
Discret. Appl. Math., 2014

Minimum sizes of identifying codes in graphs differing by one edge.
Cryptogr. Commun., 2014

Lexicographic decomposition of preferences.
Electron. Notes Discret. Math., 2013

Watching systems in graphs: An extension of identifying codes.
Discret. Appl. Math., 2013

Minimum sizes of identifying codes in graphs differing by one vertex.
Cryptogr. Commun., 2013

Extremal Values for the Maximum Degree in a Twin-Free Graph.
Ars Comb., 2012

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments.
Order, 2011

On the sizes of graphs and their powers: The undirected case.
Discret. Appl. Math., 2011

Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.
Ars Comb., 2011

Complexity results for identifying codes in planar graphs.
Int. Trans. Oper. Res., 2010

A post-optimization method to route scheduled lightpath demands with multiplicity.
Electron. Notes Discret. Math., 2010

New identifying codes in the binary Hamming space.
Eur. J. Comb., 2010

On the existence of a cycle of length at least 7 in a <i>(1, \le 2)</i>-twin-free graph.
Discuss. Math. Graph Theory, 2010

An updated survey on the linear ordering problem for weighted or unweighted tournaments.
Ann. Oper. Res., 2010

On the sizes of the graphs G, G<sup>r</sup>, G<sup>r</sup> \ G: the directed case.
Australas. J Comb., 2010

A Branch and Bound Method for a Clique Partitioning Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Adv. Math. Commun., 2009

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Adv. Math. Commun., 2009

Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005).
RAIRO Oper. Res., 2008

Discriminating codes in (bipartite) planar graphs.
Eur. J. Comb., 2008

Optimal clustering of multipartite graphs.
Discret. Appl. Math., 2008

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.
Adv. Math. Commun., 2008

Extremal cardinalities for identifying and locating-dominating codes in graphs.
Discret. Math., 2007

Structural Properties of Twin-Free Graphs.
Electron. J. Comb., 2007

A survey on the linear ordering problem for weighted or unweighted tournaments.
4OR, 2007

Application of the "descent with mutations" metaheuristic to a clique partitioning problem.
Proceedings of the 2007 IEEE International Conference on Research, 2007

Links Between Discriminating and Identifying Codes in the Binary Hamming Space.
Proceedings of the Applied Algebra, 2007

Discriminating codes in bipartite graphs.
Electron. Notes Discret. Math., 2006

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
Discret. Appl. Math., 2006

Noising methods for a clique partitioning problem.
Discret. Appl. Math., 2006

A linear algorithm for minimum 1-identifying codes in oriented trees.
Discret. Appl. Math., 2006

Maximum Transfer Distance Between Partitions.
J. Classif., 2006

Possible cardinalities for locating-dominating codes in graphs.
Australas. J Comb., 2006

On the Structure of Identifiable Graphs.
Electron. Notes Discret. Math., 2005

Possible cardinalities for identifying codes in graphs.
Australas. J Comb., 2005

1-identifying codes on trees.
Australas. J Comb., 2005

Identifying and locating-dominating codes on chains and cycles.
Eur. J. Comb., 2004

The minimum density of an identifying code in the king lattice.
Discret. Math., 2004

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Theor. Comput. Sci., 2003

Links between the Slater Index and the Ryser Index of Tournaments.
Graphs Comb., 2003

Identifying and locating-dominating codes: NP-Completeness results for directed graphs.
IEEE Trans. Inf. Theory, 2002

Identifying Codes with Small Radius in Some Infinite Regular Graphs.
Electron. J. Comb., 2002

The noising methods: A generalization of some metaheuristics.
Eur. J. Oper. Res., 2001

General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electron. J. Comb., 2001

Application of the noising method to the travelling salesman problem.
Eur. J. Oper. Res., 2000

Slater orders and Hamiltonian paths of tournaments.
Electron. Notes Discret. Math., 2000

Lamarckian genetic algorithmsapplied to the aggregation of preferences.
Ann. Oper. Res., 1998

New results on the computation of median orders.
Discret. Math., 1997

Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.
Discret. Appl. Math., 1997

The noising method: a new method for combinatorial optimization.
Oper. Res. Lett., 1993