dblp.uni-trier.dewww.uni-trier.de

Olivier Hudry

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
26EEOlivier Hudry: A survey on the complexity of tournament solutions. Mathematical Social Sciences 57(3): 292-303 (2009)
2008
25EEOlivier Hudry: NP-hardness results for the aggregation of linear orders into median orders. Annals OR 163(1): 63-88 (2008)
24EEOlivier Hudry, Melvin F. Janowitz, Sergei Ovchinnikov: Preface. Discrete Applied Mathematics 156(8): 1181 (2008)
23EEIrène Charon, Olivier Hudry: Optimal clustering of multipartite graphs. Discrete Applied Mathematics 156(8): 1330-1341 (2008)
22EEIrè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
21EEIrè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
20EEIrène Charon, Olivier Hudry: Application of the "descent with mutations" metaheuristic to a clique partitioning problem. RIVF 2007: 29-35
19EEIrène Charon, Olivier Hudry: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5(1): 5-60 (2007)
18EEIrène Charon, Olivier Hudry, Antoine Lobstein: Extremal cardinalities for identifying and locating-dominating codes in graphs. Discrete Mathematics 307(3-5): 356-366 (2007)
17EEIrène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: Structural Properties of Twin-Free Graphs. Electr. J. Comb. 14(1): (2007)
2006
16EEIrè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)
15EEIrène Charon, Olivier Hudry: Noising methods for a clique partitioning problem. Discrete Applied Mathematics 154(5): 754-769 (2006)
14EEIrè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)
13EEE. 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
12EEIrène Charon, Olivier Hudry, Antoine Lobstein: On the Structure of Identifiable Graphs. Electronic Notes in Discrete Mathematics 22: 491-495 (2005)
2004
11EEIrè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)
10EENathalie 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
9EEIrène Charon, Olivier Hudry: Links between the Slater Index and the Ryser Index of Tournaments. Graphs and Combinatorics 19(3): 309-322 (2003)
8 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
7EEIrène Charon, Olivier Hudry, Antoine Lobstein: Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electr. J. Comb. 9(1): (2002)
6 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
5EEIrè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
4EEIrène Charon, Olivier Hudry: Slater orders and Hamiltonian paths of tournaments. Electronic Notes in Discrete Mathematics 5: 60-63 (2000)
1997
3EEIrè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)
2EEIrè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
1EEJean-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

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)