Olivier Hudry

	2011
42		David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein: On the sizes of graphs and their powers: The undirected case. Discrete Applied Mathematics 159(16): 1666-1675 (2011)
41		Irène Charon, Olivier Hudry: Maximum Distance Between Slater Orders and Copeland Orders of Tournaments. Order 28(1): 99-119 (2011)
	2010
40		Irène Charon, Olivier Hudry: A Branch and Bound Method for a Clique Partitioning Problem. CTW 2010: 43-46
39		Irène Charon, Olivier Hudry: An updated survey on the linear ordering problem for weighted or unweighted tournaments. Annals OR 175(1): 107-158 (2010)
38		David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein: Watching Systems in graphs: an extension of Identifying Codes CoRR abs/1005.0765: (2010)
37		David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein: On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. Discussiones Mathematicae Graph Theory 30(4): 591-609 (2010)
36		Lucile Belgacem, Irène Charon, Olivier Hudry: A post-optimization method to route scheduled lightpath demands with multiplicity. Electronic Notes in Discrete Mathematics 36: 263-270 (2010)
35		Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2): 491-501 (2010)
34		Olivier Hudry: On the complexity of Slater's problems. European Journal of Operational Research 203(1): 216-221 (2010)
	2009
33		Lucile Belgacem, Irène Charon, Olivier Hudry: Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs. CTW 2009: 225-228
32		Olivier Hudry: Voting Procedures, Complexity of. Encyclopedia of Complexity and Systems Science 2009: 9942-9965
31		Olivier Hudry: A survey on the complexity of tournament solutions. Mathematical Social Sciences 57(3): 292-303 (2009)
	2008
30		Olivier Hudry: NP-hardness results for the aggregation of linear orders into median orders. Annals OR 163(1): 63-88 (2008)
29		Olivier Hudry, Melvin F. Janowitz, Sergei Ovchinnikov: Preface. Discrete Applied Mathematics 156(8): 1181 (2008)
28		Irène Charon, Olivier Hudry: Optimal clustering of multipartite graphs. Discrete Applied Mathematics 156(8): 1330-1341 (2008)
27		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)
26		Irène Charon, Olivier Hudry: ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26-28 October 2005). RAIRO - Operations Research 42(4): 433-434 (2008)
	2007
25		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
24		Irène Charon, Olivier Hudry: Application of the "descent with mutations" metaheuristic to a clique partitioning problem. RIVF 2007: 29-35
23		Irène Charon, Olivier Hudry: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5(1): 5-60 (2007)
22		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)
21		Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: Structural Properties of Twin-Free Graphs. Electr. J. Comb. 14(1): (2007)
	2006
20		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)
19		Irène Charon, Olivier Hudry: Noising methods for a clique partitioning problem. Discrete Applied Mathematics 154(5): 754-769 (2006)
18		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)
17		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)
16		Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry: Maximum Transfer Distance Between Partitions. J. Classification 23(1): 103-121 (2006)
	2005
15		Irène Charon, Olivier Hudry, Antoine Lobstein: On the Structure of Identifiable Graphs. Electronic Notes in Discrete Mathematics 22: 491-495 (2005)
	2004
14		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)
13		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)
12		Olivier Hudry: A note on "Banks winners in tournaments are difficult to recognize" by G. J. Woeginger. Social Choice and Welfare 23(1): 113-114 (2004)
	2003
11		Irène Charon, Olivier Hudry: Links between the Slater Index and the Ryser Index of Tournaments. Graphs and Combinatorics 19(3): 309-322 (2003)
10		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
9		Irène Charon, Olivier Hudry, Antoine Lobstein: Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electr. J. Comb. 9(1): (2002)
8		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
7		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)
6		Irène Charon, Olivier Hudry: The noising methods: A generalization of some metaheuristics. European Journal of Operational Research 135(1): 86-101 (2001)
	2000
5		Irène Charon, Olivier Hudry: Slater orders and Hamiltonian paths of tournaments. Electronic Notes in Discrete Mathematics 5: 60-63 (2000)
4		Irène Charon, Olivier Hudry: Application of the noising method to the travelling salesman problem. European Journal of Operational Research 125(2): 266-277 (2000)
	1997
3		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)
2		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)
	1995
1		Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman: The Reversing Number of a Digraph. Discrete Applied Mathematics 60(1-3): 39-76 (1995)

Coauthor Index

1	David Auger	[37] [38] [42]
2	Jean-Pierre Barthélemy	[1]
3	Lucile Belgacem	[33] [36]
4	Nathalie Bertrand	[13]
5	E. Charbit	[17]
6	Irène Charon	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [33] [35] [36] [37] [38] [39] [40] [41] [42]
7	Gérard D. Cohen	[17] [25] [27] [35]
8	Lucile Denoeud	[16]
9	Sylvain Gravier	[18]
10	Alain Guénoche (A. Guénoche)	[2] [16]
11	Iiro S. Honkala	[7] [14] [21]
12	Garth Isaak	[1]
13	Melvin F. Janowitz	[29]
14	Antoine Lobstein	[7] [8] [9] [10] [13] [14] [15] [18] [21] [22] [25] [27] [35] [37] [38] [42]
15	Michel Mollard	[18]
16	Julien Moncel	[18]
17	Sergei Ovchinnikov	[29]
18	Fred S. Roberts	[1]
19	Barry A. Tesman	[1]
20	Frédéric Woirgard	[2] [3]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page