| 2008 |
|---|
| 22 | EE | Irène Charon,
Olivier Hudry:
Optimal clustering of multipartite graphs.
Discrete Applied Mathematics 156(8): 1330-1341 (2008) |
| 21 | EE | Irène Charon,
Gérard D. Cohen,
Olivier Hudry,
Antoine Lobstein:
Discriminating codes in (bipartite) planar graphs.
Eur. J. Comb. 29(5): 1353-1364 (2008) |
| 2007 |
|---|
| 20 | EE | Irène Charon,
Gérard D. Cohen,
Olivier Hudry,
Antoine Lobstein:
Links Between Discriminating and Identifying Codes in the Binary Hamming Space.
AAECC 2007: 267-270 |
| 19 | EE | Irène Charon,
Olivier Hudry:
Application of the "descent with mutations" metaheuristic to a clique partitioning problem.
RIVF 2007: 29-35 |
| 18 | EE | Irène Charon,
Olivier Hudry:
A survey on the linear ordering problem for weighted or unweighted tournaments.
4OR 5(1): 5-60 (2007) |
| 17 | EE | Irène Charon,
Olivier Hudry,
Antoine Lobstein:
Extremal cardinalities for identifying and locating-dominating codes in graphs.
Discrete Mathematics 307(3-5): 356-366 (2007) |
| 16 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
Structural Properties of Twin-Free Graphs.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 15 | EE | Irène Charon,
Olivier Hudry:
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
Discrete Applied Mathematics 154(15): 2097-2116 (2006) |
| 14 | EE | Irène Charon,
Olivier Hudry:
Noising methods for a clique partitioning problem.
Discrete Applied Mathematics 154(5): 754-769 (2006) |
| 13 | EE | Irène Charon,
Sylvain Gravier,
Olivier Hudry,
Antoine Lobstein,
Michel Mollard,
Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees.
Discrete Applied Mathematics 154(8): 1246-1253 (2006) |
| 12 | EE | E. Charbit,
Irène Charon,
Gérard D. Cohen,
Olivier Hudry:
Discriminating codes in bipartite graphs.
Electronic Notes in Discrete Mathematics 26: 29-35 (2006) |
| 2005 |
|---|
| 11 | EE | Irène Charon,
Olivier Hudry,
Antoine Lobstein:
On the Structure of Identifiable Graphs.
Electronic Notes in Discrete Mathematics 22: 491-495 (2005) |
| 2004 |
|---|
| 10 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
The minimum density of an identifying code in the king lattice.
Discrete Mathematics 276(1-3): 95-109 (2004) |
| 9 | EE | Nathalie Bertrand,
Irène Charon,
Olivier Hudry,
Antoine Lobstein:
Identifying and locating-dominating codes on chains and cycles.
Eur. J. Comb. 25(7): 969-987 (2004) |
| 2003 |
|---|
| 8 | EE | Irène Charon,
Olivier Hudry:
Links between the Slater Index and the Ryser Index of Tournaments.
Graphs and Combinatorics 19(3): 309-322 (2003) |
| 7 | | 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): 2109-2120 (2003) |
| 2002 |
|---|
| 6 | EE | Irène Charon,
Olivier Hudry,
Antoine Lobstein:
Identifying Codes with Small Radius in Some Infinite Regular Graphs.
Electr. J. Comb. 9(1): (2002) |
| 5 | | Irène Charon,
Olivier Hudry,
Antoine Lobstein:
Identifying and locating-dominating codes: NP-Completeness results for directed graphs.
IEEE Transactions on Information Theory 48(8): 2192-2200 (2002) |
| 2001 |
|---|
| 4 | EE | Irène Charon,
Iiro S. Honkala,
Olivier Hudry,
Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 3 | EE | Irène Charon,
Olivier Hudry:
Slater orders and Hamiltonian paths of tournaments.
Electronic Notes in Discrete Mathematics 5: 60-63 (2000) |
| 1997 |
|---|
| 2 | EE | Irène Charon,
Olivier Hudry,
Frédéric Woirgard:
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.
Discrete Applied Mathematics 80(2-3): 211-215 (1997) |
| 1 | EE | Irène Charon,
A. Guénoche,
Olivier Hudry,
Frédéric Woirgard:
New results on the computation of median orders.
Discrete Mathematics 165-166: 139-153 (1997) |
