Irène Charon

Eur. J. Oper. Res., 2014

Maximum size of a minimum watching system and the graphs achieving the bound.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Minimum sizes of identifying codes in graphs differing by one edge.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2014

2013

Lexicographic decomposition of preferences.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Watching systems in graphs: An extension of identifying codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Minimum sizes of identifying codes in graphs differing by one vertex.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2013

2012

Extremal Values for the Maximum Degree in a Twin-Free Graph.

[BibT_eX]

Ars Comb., 2012

2011

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments.

[BibT_eX]

[DOI]

Order, 2011

On the sizes of graphs and their powers: The undirected case.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

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

[BibT_eX]

Ars Comb., 2011

2010

Complexity results for identifying codes in planar graphs.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2010

A post-optimization method to route scheduled lightpath demands with multiplicity.

[BibT_eX]

[DOI]

Lucile Belgacem

Electron. Notes Discret. Math., 2010

New identifying codes in the binary Hamming space.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

An updated survey on the linear ordering problem for weighted or unweighted tournaments.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2010

On the sizes of the graphs G, Gr, Gr \ G: the directed case.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

A Branch and Bound Method for a Clique Partitioning Problem.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Erratum.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

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

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.

[BibT_eX]

[DOI]

Lucile Belgacem

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

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

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2008

Discriminating codes in (bipartite) planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Optimal clustering of multipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2008

2007

Extremal cardinalities for identifying and locating-dominating codes in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Structural Properties of Twin-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

A survey on the linear ordering problem for weighted or unweighted tournaments.

[BibT_eX]

[DOI]

4OR, 2007

Application of the "descent with mutations" metaheuristic to a clique partitioning problem.

[BibT_eX]

[DOI]

Proceedings of the 2007 IEEE International Conference on Research, 2007

Links Between Discriminating and Identifying Codes in the Binary Hamming Space.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

Discriminating codes in bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Noising methods for a clique partitioning problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

A linear algorithm for minimum 1-identifying codes in oriented trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Maximum Transfer Distance Between Partitions.

[BibT_eX]

[DOI]

J. Classif., 2006

Possible cardinalities for locating-dominating codes in graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

2005

On the Structure of Identifiable Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Possible cardinalities for identifying codes in graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

1-identifying codes on trees.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

2004

Identifying and locating-dominating codes on chains and cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

The minimum density of an identifying code in the king lattice.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Links between the Slater Index and the Ryser Index of Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 2003

2002

Identifying and locating-dominating codes: NP-Completeness results for directed graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Identifying Codes with Small Radius in Some Infinite Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

The noising methods: A generalization of some metaheuristics.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

General Bounds for Identifying Codes in Some Infinite Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

Application of the noising method to the travelling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Slater orders and Hamiltonian paths of tournaments.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

1998

Lamarckian genetic algorithmsapplied to the aggregation of preferences.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1998

1997

New results on the computation of median orders.

[BibT_eX]

[DOI]

Discret. Math., 1997

Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.

[BibT_eX]

[DOI]

Frédéric Woirgard

Discret. Appl. Math., 1997

1993

The noising method: a new method for combinatorial optimization.

[BibT_eX]

[DOI]