# Olivier Hudry

According to our database

Collaborative distances:

^{1}, Olivier Hudry authored at least 79 papers between 1993 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Discuss. Math. Graph Theory, 2020

2019

Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes.

Theor. Comput. Sci., 2019

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

RAIRO - Operations Research, 2019

Int. Trans. Oper. Res., 2019

2018

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

IJICoT, 2017

Operations Research and Voting Theory.

Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

Optimization of wireless sensor networks deployment with coverage and connectivity constraints.

Proceedings of the 4th International Conference on Control, 2017

2016

Proceedings of the Handbook of Computational Social Choice, 2016

Theor. Comput. Sci., 2016

Cryptogr. Commun., 2016

2015

Inf. Process. Lett., 2015

Discret. Appl. Math., 2015

Complexity results for extensions of median orders to different types of remoteness.

Annals OR, 2015

2014

A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands.

Eur. J. Oper. Res., 2014

Discret. Appl. Math., 2014

Cryptogr. Commun., 2014

2013

Electron. Notes Discret. Math., 2013

Electron. Notes Discret. Math., 2013

Electron. Notes Discret. Math., 2013

Discret. Appl. Math., 2013

Cryptogr. Commun., 2013

Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation.

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

On the computation of median linear orders, of median complete preorders and of median weak orders.

Math. Soc. Sci., 2012

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

Ars Comb., 2012

Majority Graphs of Profiles of Equivalence Relations and Complexity of Réegnier's Problem.

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Order, 2011

Discret. Appl. Math., 2011

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

Ars Comb., 2011

2010

Int. Trans. Oper. Res., 2010

Eur. J. Oper. Res., 2010

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

Electron. Notes Discret. Math., 2010

Eur. J. Comb., 2010

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

Discuss. Math. Graph Theory, 2010

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

Annals OR, 2010

On the sizes of the graphs G, G<sup>r</sup>, G<sup>r</sup> \ G: the directed case.

Australas. J Comb., 2010

A Branch and Bound Method for a Clique Partitioning Problem.

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

2009

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Math. Soc. Sci., 2009

Adv. Math. Commun., 2009

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

Adv. Math. Commun., 2009

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

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

Proceedings of the Decision-making Process, 2009

2008

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

RAIRO - Operations Research, 2008

Eur. J. Comb., 2008

Discret. Appl. Math., 2008

Discret. Appl. Math., 2008

Annals OR, 2008

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

Adv. Math. Commun., 2008

2007

Discret. Math., 2007

Electron. J. Comb., 2007

4OR, 2007

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

Proceedings of the 2007 IEEE International Conference on Research, 2007

Proceedings of the Applied Algebra, 2007

2006

Electron. Notes Discret. Math., 2006

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

Discret. Appl. Math., 2006

Discret. Appl. Math., 2006

Discret. Appl. Math., 2006

J. Classif., 2006

Australas. J Comb., 2006

2005

Electron. Notes Discret. Math., 2005

Australas. J Comb., 2005

Australas. J Comb., 2005

2004

A note on "Banks winners in tournaments are difficult to recognize" by G. J. Woeginger.

Soc. Choice Welf., 2004

Eur. J. Comb., 2004

Discret. Math., 2004

2003

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

Theor. Comput. Sci., 2003

Graphs Comb., 2003

2002

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

IEEE Trans. Inf. Theory, 2002

Electron. J. Comb., 2002

2001

Eur. J. Oper. Res., 2001

Electron. J. Comb., 2001

2000

Eur. J. Oper. Res., 2000

Electron. Notes Discret. Math., 2000

1998

Annals OR, 1998

1997

Discret. Math., 1997

Discret. Appl. Math., 1997

1995

Discret. Appl. Math., 1995

1993

Oper. Res. Lett., 1993