×
Compute Distance To:
Author ID: hudry.olivier Recent zbMATH articles by "Hudry, Olivier"
Published as: Hudry, Olivier; Hudry, O.

Publications by Year

Citations contained in zbMATH Open

76 Publications have been cited 713 times in 307 Documents Cited by Year
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Zbl 1044.68066
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
71
2003
Identifying and locating-dominating codes on chains and cycles. Zbl 1053.05095
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
58
2004
Identifying codes with small radius in some infinite regular graphs. Zbl 0985.05033
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2002
Extremal cardinalities for identifying and locating-dominating codes in graphs. Zbl 1113.05075
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2007
The noising method: A new method for combinatorial optimization. Zbl 0798.90118
Charon, Irène; Hudry, Olivier
31
1993
Identifying and locating-dominating codes: NP-completeness results for directed graphs. Zbl 1062.94056
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
22
2002
The minimum density of an identifying code in the king lattice. Zbl 1037.05018
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
21
2004
A survey on the linear ordering problem for weighted or unweighted tournaments. Zbl 1126.05052
Charon, Irène; Hudry, Olivier
20
2007
General bounds for identifying codes in some infinite regular graphs. Zbl 0990.05074
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
20
2001
An updated survey on the linear ordering problem for weighted or unweighted tournaments. Zbl 1185.90197
Charon, Irène; Hudry, Olivier
20
2010
A survey on the complexity of tournament solutions. Zbl 1176.91030
Hudry, Olivier
20
2009
The noising methods: A generalization of some metaheuristics. Zbl 1063.90042
Charon, Irène; Hudry, Olivier
18
2001
1-identifying codes on trees. Zbl 1081.94039
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
17
2005
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity. Zbl 1180.05055
Charbit, Emmanuel; Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
17
2008
New identifying codes in the binary Hamming space. Zbl 1198.94175
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
16
2010
Median linear orders: Heuristics and a branch and bound algorithm. Zbl 0689.90003
Barthélemy, J. P.; Guénoche, A.; Hudry, O.
15
1989
Structural properties of twin-free graphs. Zbl 1113.05085
Charon, Iréne; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
14
2007
A linear algorithm for minimum 1-identifying codes in oriented trees. Zbl 1103.68130
Charon, Irène; Gravier, Sylvain; Hudry, Olivier; Lobstein, Antoine; Mollard, Michel; Moncel, Julien
13
2006
Noising methods for a clique partitioning problem. Zbl 1120.90063
Charon, Iréne; Hudry, Olivier
12
2006
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Zbl 1111.90121
Charon, Irène; Hudry, Olivier
12
2006
Watching systems in graphs: an extension of identifying codes. Zbl 1287.05142
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
11
2013
Median and Slater’s orders of tournaments. (Ordres médians et ordres de Slater des tournois.) Zbl 0870.90095
Charon, Irène; Hudry, Olivier; Woirgard, Frédéric
10
1996
On the complexity of Slater’s problems. Zbl 1176.90606
Hudry, Olivier
10
2010
Lamarckian genetic algorithms applied to the aggregation of preferences. Zbl 0907.90009
Charon, Irène; Hudry, Olivier
10
1998
Complexity results for identifying codes in planar graphs. Zbl 1219.05178
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
9
2010
Maximum transfer distance between partitions. Zbl 1244.05023
Charon, Irène; Denœud, Lucile; Guénoche, Alain; Hudry, Olivier
9
2006
A note on “Bank winners in tournaments are difficult to recognize” by G. J. Woeginger. Zbl 1088.91506
Hudry, Olivier
9
2004
New results on the computation of median orders. Zbl 0878.68090
Charon, I.; Guénoche, A.; Hudry, O.; Woirgard, F.
8
1997
NP-hardness results for the aggregation of linear orders into median orders. Zbl 1192.68296
Hudry, Olivier
8
2008
The reversing number of a digraph. Zbl 0826.05032
Barthélemy, Jean-Pierre; Hudry, Olivier; Isaak, Garth; Roberts, Fred S.; Tesman, Barry
7
1995
Discriminating codes in (bipartite) planar graphs. Zbl 1143.94024
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
6
2008
Application of the noising method to the travelling salesman problem. Zbl 0952.90035
Charon, Irène; Hudry, Olivier
6
2000
The noising methods: A survey. Zbl 1005.90051
Charon, Irène; Hudry, Olivier
6
2002
Self-tuning of the noising methods. Zbl 1189.90105
Charon, Irène; Hudry, Olivier
6
2009
On the ensemble of optimal dominating and locating-dominating codes in a graph. Zbl 1329.05234
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
6
2015
More results on the complexity of identifying problems in graphs. Zbl 1336.68130
Hudry, Olivier; Lobstein, Antoine
6
2016
On the number of optimal identifying codes in a twin-free graph. Zbl 1303.05138
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
5
2015
A 16-vertex tournament for which Banks set and Slater set are disjoint. Zbl 0895.05027
Charon, Irène; Hudry, Olivier; Woirgard, Frédéric
5
1997
Maximum size of a minimum watching system and the graphs achieving the bound. Zbl 1321.05136
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
5
2014
Minimum sizes of identifying codes in graphs differing by one vertex. Zbl 1335.94099
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2013
Possible cardinalities for identifying codes in graphs. Zbl 1114.94021
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2005
Possible cardinalities for locating-dominating codes in graphs. Zbl 1101.05045
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2006
Bounds of Slater’s index of a tournament from its scores. (Encadrement de l’indice de Slater d’un tournoi à l’aide de ses scores.) Zbl 0846.05040
Charon-Fournier, Irène; Germa, Anne; Hudry, Olivier
4
1992
A Bonsaï branch and bound method applied to voting theory. Zbl 0897.90003
Charon, I.; Guénoche, A.; Hudry, O.; Woirgard, F.
4
1996
On the computation of median linear orders, of median complete preorders and of median weak orders. Zbl 1247.91047
Hudry, Olivier
4
2012
Discriminating codes in bipartite graphs. Zbl 1291.05152
Charbit, E.; Charon, I.; Cohen, G.; Hudry, O.
4
2006
Consensus theories. An oriented survey. Zbl 1221.91026
Hudry, Olivier; Monjardet, Bernard
4
2010
Slater orders and Hamiltonian paths of tournaments. Zbl 1412.05124
Charon, Irène; Hudry, Olivier
4
2000
On the ensemble of optimal identifying codes in a twin-free graph. Zbl 1333.05222
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2016
Random generation of tournaments and asymmetric graphs with given out-degrees. Zbl 0974.05502
Charon, Irène; Germa, Anne; Hudry, Olivier
3
1996
Links between the Slater index and the Ryser index of tournaments. Zbl 1023.05065
Charon, Irène; Hudry, Olivier
3
2003
Optimal clustering of multipartite graphs. Zbl 1144.05050
Charon, Irène; Hudry, Olivier
3
2008
Mixing different components of metaheuristics. Zbl 0877.90061
Charon, Irène; Hudry, Olivier
3
1996
Links between discriminating and identifying codes in the binary Hamming space. Zbl 1195.94081
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
2
2007
Weighted tournament solutions. Zbl 1457.91174
Fischer, Felix; Hudry, Olivier; Niedermeier, Rolf
2
2016
A smallest tournament for which the Banks set and the Copeland set are disjoint. Zbl 1066.91521
Hudry, Olivier
2
1999
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes. Zbl 1417.68069
Hudry, Olivier; Lobstein, Antoine
2
2019
Maximum distance between Slater orders and Copeland orders of tournaments. Zbl 1214.05038
Charon, Irène; Hudry, Olivier
2
2011
Minimum sizes of identifying codes in graphs differing by one edge. Zbl 1294.94111
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
2
2014
Maximum number of Slater orders of tournaments \(T\) with \(\sigma(T)=1\). (Nombre maximum d’ordres de Slater des tournois \(T\) vérifiant \(\sigma(T)=1\).) Zbl 0940.05036
Hudry, Olivier
2
1997
On the use of scores in exact methods computing the median orders of tournaments. (Utilisation des scores dans les méthodes exactes déterminant les orders médians de tournois.) Zbl 0845.05050
Charon-Fournier, Irène; Germa, Anne; Hudry, Olivier
2
1992
On the structure of identifiable graphs. Zbl 1200.05188
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
2
2005
Maximum of the transfer distance to a given partition. (Maximum de la distance de transfert à une partition donnée.) Zbl 1180.05016
Charon, Irène; Denoeud, Lucile; Hudry, Olivier
2
2007
Complexity results for extensions of median orders to different types of remoteness. Zbl 1320.91057
Hudry, Olivier
2
2015
Extremal values for the maximum degree in a twin-free graph. Zbl 1289.05116
Charon, Iréne; Hudry, Olivier; Lobstein, Antoine
1
2012
On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case. Zbl 1232.05083
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2010
The compared costs of domination location-domination and identification. Zbl 07148543
Hudry, Olivier; Lobstein, Antoine
1
2020
A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands. Zbl 1305.90343
Belgacem, Lucile; Charon, Irène; Hudry, Olivier
1
2014
NP-hardness of the computation of a median equivalence relation in classification (Régnier’s problem). (NP-difficulté de la détermination d’une relation d’équivalence médiane en classification (problème de Régnier).) Zbl 1288.91069
Hudry, Olivier
1
2012
The four-colors problem. (Le problème des quatre couleurs.) Zbl 0954.01009
Hudry, Olivier
1
1999
A branch-and-bound algorithm for solving the linear ordering problem on weighted tournaments. Zbl 1025.90012
Charon, Irene; Hudry, Olivier
1
2001
Extremal values for identification, domination and maximum cliques in twin-free graphs. Zbl 1265.05451
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
On the sizes of graphs and their powers: the undirected case. Zbl 1228.05247
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
Erratum to “Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs”. Zbl 1193.05157
Auger, David; Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
1
2009
Overlapping clustering in a graph using \(k\)-means and application to protein interactions networks. Zbl 1181.68230
Charon, Irène; Denoeud, Lucile; Hudry, Olivier
1
2007
Descent with mutations applied to the linear ordering problem. Zbl 1403.90573
Hudry, Olivier
1
2018
The compared costs of domination location-domination and identification. Zbl 07148543
Hudry, Olivier; Lobstein, Antoine
1
2020
Unique (optimal) solutions: complexity results for identifying and locating-dominating codes. Zbl 1417.68069
Hudry, Olivier; Lobstein, Antoine
2
2019
Descent with mutations applied to the linear ordering problem. Zbl 1403.90573
Hudry, Olivier
1
2018
More results on the complexity of identifying problems in graphs. Zbl 1336.68130
Hudry, Olivier; Lobstein, Antoine
6
2016
On the ensemble of optimal identifying codes in a twin-free graph. Zbl 1333.05222
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2016
Weighted tournament solutions. Zbl 1457.91174
Fischer, Felix; Hudry, Olivier; Niedermeier, Rolf
2
2016
On the ensemble of optimal dominating and locating-dominating codes in a graph. Zbl 1329.05234
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
6
2015
On the number of optimal identifying codes in a twin-free graph. Zbl 1303.05138
Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
5
2015
Complexity results for extensions of median orders to different types of remoteness. Zbl 1320.91057
Hudry, Olivier
2
2015
Maximum size of a minimum watching system and the graphs achieving the bound. Zbl 1321.05136
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
5
2014
Minimum sizes of identifying codes in graphs differing by one edge. Zbl 1294.94111
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
2
2014
A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands. Zbl 1305.90343
Belgacem, Lucile; Charon, Irène; Hudry, Olivier
1
2014
Watching systems in graphs: an extension of identifying codes. Zbl 1287.05142
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
11
2013
Minimum sizes of identifying codes in graphs differing by one vertex. Zbl 1335.94099
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
4
2013
On the computation of median linear orders, of median complete preorders and of median weak orders. Zbl 1247.91047
Hudry, Olivier
4
2012
Extremal values for the maximum degree in a twin-free graph. Zbl 1289.05116
Charon, Iréne; Hudry, Olivier; Lobstein, Antoine
1
2012
NP-hardness of the computation of a median equivalence relation in classification (Régnier’s problem). (NP-difficulté de la détermination d’une relation d’équivalence médiane en classification (problème de Régnier).) Zbl 1288.91069
Hudry, Olivier
1
2012
Maximum distance between Slater orders and Copeland orders of tournaments. Zbl 1214.05038
Charon, Irène; Hudry, Olivier
2
2011
Extremal values for identification, domination and maximum cliques in twin-free graphs. Zbl 1265.05451
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
On the sizes of graphs and their powers: the undirected case. Zbl 1228.05247
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2011
An updated survey on the linear ordering problem for weighted or unweighted tournaments. Zbl 1185.90197
Charon, Irène; Hudry, Olivier
20
2010
New identifying codes in the binary Hamming space. Zbl 1198.94175
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
16
2010
On the complexity of Slater’s problems. Zbl 1176.90606
Hudry, Olivier
10
2010
Complexity results for identifying codes in planar graphs. Zbl 1219.05178
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
9
2010
Consensus theories. An oriented survey. Zbl 1221.91026
Hudry, Olivier; Monjardet, Bernard
4
2010
On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case. Zbl 1232.05083
Auger, David; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
1
2010
A survey on the complexity of tournament solutions. Zbl 1176.91030
Hudry, Olivier
20
2009
Self-tuning of the noising methods. Zbl 1189.90105
Charon, Irène; Hudry, Olivier
6
2009
Erratum to “Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs”. Zbl 1193.05157
Auger, David; Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
1
2009
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity. Zbl 1180.05055
Charbit, Emmanuel; Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
17
2008
NP-hardness results for the aggregation of linear orders into median orders. Zbl 1192.68296
Hudry, Olivier
8
2008
Discriminating codes in (bipartite) planar graphs. Zbl 1143.94024
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
6
2008
Optimal clustering of multipartite graphs. Zbl 1144.05050
Charon, Irène; Hudry, Olivier
3
2008
Extremal cardinalities for identifying and locating-dominating codes in graphs. Zbl 1113.05075
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2007
A survey on the linear ordering problem for weighted or unweighted tournaments. Zbl 1126.05052
Charon, Irène; Hudry, Olivier
20
2007
Structural properties of twin-free graphs. Zbl 1113.05085
Charon, Iréne; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
14
2007
Links between discriminating and identifying codes in the binary Hamming space. Zbl 1195.94081
Charon, Irène; Cohen, Gérard; Hudry, Olivier; Lobstein, Antoine
2
2007
Maximum of the transfer distance to a given partition. (Maximum de la distance de transfert à une partition donnée.) Zbl 1180.05016
Charon, Irène; Denoeud, Lucile; Hudry, Olivier
2
2007
Overlapping clustering in a graph using \(k\)-means and application to protein interactions networks. Zbl 1181.68230
Charon, Irène; Denoeud, Lucile; Hudry, Olivier
1
2007
A linear algorithm for minimum 1-identifying codes in oriented trees. Zbl 1103.68130
Charon, Irène; Gravier, Sylvain; Hudry, Olivier; Lobstein, Antoine; Mollard, Michel; Moncel, Julien
13
2006
Noising methods for a clique partitioning problem. Zbl 1120.90063
Charon, Iréne; Hudry, Olivier
12
2006
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Zbl 1111.90121
Charon, Irène; Hudry, Olivier
12
2006
Maximum transfer distance between partitions. Zbl 1244.05023
Charon, Irène; Denœud, Lucile; Guénoche, Alain; Hudry, Olivier
9
2006
Possible cardinalities for locating-dominating codes in graphs. Zbl 1101.05045
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2006
Discriminating codes in bipartite graphs. Zbl 1291.05152
Charbit, E.; Charon, I.; Cohen, G.; Hudry, O.
4
2006
1-identifying codes on trees. Zbl 1081.94039
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
17
2005
Possible cardinalities for identifying codes in graphs. Zbl 1114.94021
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
4
2005
On the structure of identifiable graphs. Zbl 1200.05188
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
2
2005
Identifying and locating-dominating codes on chains and cycles. Zbl 1053.05095
Bertrand, Nathalie; Charon, Irène; Hudry, Olivier; Lobstein, Antoine
58
2004
The minimum density of an identifying code in the king lattice. Zbl 1037.05018
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
21
2004
A note on “Bank winners in tournaments are difficult to recognize” by G. J. Woeginger. Zbl 1088.91506
Hudry, Olivier
9
2004
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Zbl 1044.68066
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
71
2003
Links between the Slater index and the Ryser index of tournaments. Zbl 1023.05065
Charon, Irène; Hudry, Olivier
3
2003
Identifying codes with small radius in some infinite regular graphs. Zbl 0985.05033
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
34
2002
Identifying and locating-dominating codes: NP-completeness results for directed graphs. Zbl 1062.94056
Charon, Irène; Hudry, Olivier; Lobstein, Antoine
22
2002
The noising methods: A survey. Zbl 1005.90051
Charon, Irène; Hudry, Olivier
6
2002
General bounds for identifying codes in some infinite regular graphs. Zbl 0990.05074
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
20
2001
The noising methods: A generalization of some metaheuristics. Zbl 1063.90042
Charon, Irène; Hudry, Olivier
18
2001
A branch-and-bound algorithm for solving the linear ordering problem on weighted tournaments. Zbl 1025.90012
Charon, Irene; Hudry, Olivier
1
2001
Application of the noising method to the travelling salesman problem. Zbl 0952.90035
Charon, Irène; Hudry, Olivier
6
2000
Slater orders and Hamiltonian paths of tournaments. Zbl 1412.05124
Charon, Irène; Hudry, Olivier
4
2000
A smallest tournament for which the Banks set and the Copeland set are disjoint. Zbl 1066.91521
Hudry, Olivier
2
1999
The four-colors problem. (Le problème des quatre couleurs.) Zbl 0954.01009
Hudry, Olivier
1
1999
Lamarckian genetic algorithms applied to the aggregation of preferences. Zbl 0907.90009
Charon, Irène; Hudry, Olivier
10
1998
New results on the computation of median orders. Zbl 0878.68090
Charon, I.; Guénoche, A.; Hudry, O.; Woirgard, F.
8
1997
A 16-vertex tournament for which Banks set and Slater set are disjoint. Zbl 0895.05027
Charon, Irène; Hudry, Olivier; Woirgard, Frédéric
5
1997
Maximum number of Slater orders of tournaments \(T\) with \(\sigma(T)=1\). (Nombre maximum d’ordres de Slater des tournois \(T\) vérifiant \(\sigma(T)=1\).) Zbl 0940.05036
Hudry, Olivier
2
1997
Median and Slater’s orders of tournaments. (Ordres médians et ordres de Slater des tournois.) Zbl 0870.90095
Charon, Irène; Hudry, Olivier; Woirgard, Frédéric
10
1996
A Bonsaï branch and bound method applied to voting theory. Zbl 0897.90003
Charon, I.; Guénoche, A.; Hudry, O.; Woirgard, F.
4
1996
Random generation of tournaments and asymmetric graphs with given out-degrees. Zbl 0974.05502
Charon, Irène; Germa, Anne; Hudry, Olivier
3
1996
Mixing different components of metaheuristics. Zbl 0877.90061
Charon, Irène; Hudry, Olivier
3
1996
The reversing number of a digraph. Zbl 0826.05032
Barthélemy, Jean-Pierre; Hudry, Olivier; Isaak, Garth; Roberts, Fred S.; Tesman, Barry
7
1995
The noising method: A new method for combinatorial optimization. Zbl 0798.90118
Charon, Irène; Hudry, Olivier
31
1993
Bounds of Slater’s index of a tournament from its scores. (Encadrement de l’indice de Slater d’un tournoi à l’aide de ses scores.) Zbl 0846.05040
Charon-Fournier, Irène; Germa, Anne; Hudry, Olivier
4
1992
On the use of scores in exact methods computing the median orders of tournaments. (Utilisation des scores dans les méthodes exactes déterminant les orders médians de tournois.) Zbl 0845.05050
Charon-Fournier, Irène; Germa, Anne; Hudry, Olivier
2
1992
Median linear orders: Heuristics and a branch and bound algorithm. Zbl 0689.90003
Barthélemy, J. P.; Guénoche, A.; Hudry, O.
15
1989
all top 5

Cited by 478 Authors

38 Hudry, Olivier
27 Laihonen, Tero K.
25 Charon, Irène
21 Lobstein, Antoine-Christophe
17 Foucaud, Florent
17 Honkala, Iiro S.
17 Parreau, Aline
13 Junnila, Ville
10 Gravier, Sylvain
8 Auger, David
7 Brandt, Felix
7 Moncel, Julien
7 Naserasr, Reza
6 Argiroffo, Gabriela R.
6 Valicov, Petru
6 Wagler, Annegret Katrin
5 Bianchi, Silvia M.
5 Havet, Frédéric
4 Balbuena, Camino
4 Exoo, Geoffrey
4 Guénoche, Alain
4 Hao, Jin-Kao
4 Lucarini, Yanina P.
4 Pelto, Mikko
4 Ranto, Sanna Maarit
4 Seedig, Hans Georg
4 Seo, Suk Jai
4 Suksompong, Warut
3 Fazil, Muhammad
3 Ghorbani, Modjtaba
3 Harrenstein, Paul
3 Hernando, Carmen
3 Javaid, Imran
3 Jayagopal, R.
3 Kovše, Matjaž
3 Leclerc, Bruno
3 Lehtilä, Tuomo
3 Maddah, Sheyda
3 Maimani, Hamid Reza
3 Mertzios, George B.
3 Mora, Mercè
3 Pelayo, Ignacio M.
3 Rajan, R. Sundara
3 Rajasingh, Indra
3 Roozbayani, Maryam
3 Saile, Christian
3 Slater, Peter James
3 Thomassé, Stéphan
2 Aras, Necati
2 Barbero, Florian
2 Bazgan, Cristina
2 Bellitto, Thomas
2 Brill, Markus
2 Brusco, Michael J.
2 Buljubašić, Mirsad
2 Cohen, Gérard Denis
2 Crama, Yves
2 Dalfó, Cristina
2 Dantas, Rennan
2 Dehmer, Matthias
2 Demuynck, Thomas
2 Deng, Xiao-Tie
2 Dhanalakshmi, R.
2 Fernau, Henning
2 Fischer, Felix
2 Fréville, Arnaud
2 Gavranović, Haris
2 Guo, Jiong
2 Isenmann, Lucas
2 Landete, Mercedes
2 Laporte, Gilbert
2 Lin, Jun
2 Liu, Yongguo
2 Martello, Silvano
2 Martínez-Barona, Berenice
2 Milanič, Martin
2 Mohemmed, Ammar W.
2 Mollard, Michel
2 Monge, Juan Francisco
2 Murtaza, Muhammad
2 Nguyen Thanh Ngoc
2 Niedermeier, Rolf
2 Niepel, Ľudovít
2 Pehlivan, Hüseyin
2 Puerto Albandoz, Justo
2 Qian, Yanjun
2 Raspaud, André
2 Sahoo, Nirod Chandra
2 Sampaio, Rudini Menezes
2 Saurabh, Saket
2 Sikora, Florian
2 Song, Shujiao
2 Spieksma, Frits C. R.
2 Thiebaut, Jocelyn
2 Tomescu, Alexandru Ioan
2 Tong, Li-Da
2 Vasquez, Michel
2 Woirgard, Frédéric
2 Zufferey, Nicolas
1 Abdul Gafur, Anuwar Kadir
...and 378 more Authors
all top 5

Cited in 81 Serials

42 Discrete Applied Mathematics
18 European Journal of Combinatorics
17 Discrete Mathematics
14 European Journal of Operational Research
13 Theoretical Computer Science
12 Computers & Operations Research
10 Applied Mathematics and Computation
10 Annals of Operations Research
6 Information Processing Letters
6 Mathematical Social Sciences
6 Social Choice and Welfare
6 Graphs and Combinatorics
5 The Electronic Journal of Combinatorics
5 Discussiones Mathematicae. Graph Theory
5 RAIRO. Operations Research
5 Cryptography and Communications
4 Advances in Data Analysis and Classification. ADAC
4 Discrete Mathematics, Algorithms and Applications
3 Information Sciences
3 Journal of Combinatorial Theory. Series A
3 Networks
3 Operations Research
3 Designs, Codes and Cryptography
3 4OR
3 Journal of Discrete Algorithms
3 Advances in Mathematics of Communications
2 Indian Journal of Pure & Applied Mathematics
2 Psychometrika
2 Journal of Computer and System Sciences
2 Journal of Graph Theory
2 Journal of Mathematical Psychology
2 Advances in Applied Mathematics
2 Algorithmica
2 Information and Computation
2 SIAM Journal on Discrete Mathematics
2 Computational Optimization and Applications
2 International Transactions in Operational Research
2 Journal of Heuristics
2 Journal of Combinatorial Optimization
2 Discrete Dynamics in Nature and Society
2 Optimization Letters
1 Artificial Intelligence
1 Journal of Mathematical Biology
1 Linear and Multilinear Algebra
1 Periodica Mathematica Hungarica
1 Ukrainian Mathematical Journal
1 Mathematics Magazine
1 International Journal of Game Theory
1 Journal of Combinatorial Theory. Series B
1 Journal of Economic Theory
1 Journal of Mathematical Economics
1 Cybernetics and Systems
1 Journal of Classification
1 Order
1 Optimization
1 Statistical Science
1 International Journal of Approximate Reasoning
1 Machine Learning
1 Journal of Global Optimization
1 Automation and Remote Control
1 Combinatorics, Probability and Computing
1 Computational and Applied Mathematics
1 Mathematical Logic Quarterly (MLQ)
1 Economic Theory
1 Complexity
1 OR Spectrum
1 Journal of Applied Mathematics and Computing
1 Quantum Information Processing
1 Journal of Intelligent and Fuzzy Systems
1 Discrete Optimization
1 Contributions to Discrete Mathematics
1 Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica
1 The Annals of Applied Statistics
1 Ars Mathematica Contemporanea
1 Symmetry
1 ISRN Computational Mathematics
1 Transactions on Combinatorics
1 Journal of Mathematics
1 Electronic Journal of Graph Theory and Applications
1 Journal of Logical and Algebraic Methods in Programming
1 International Journal of Applied and Computational Mathematics

Citations by Year