Recent Publications
Journal
Conference proceedings
Conference, workshop
Book, proceedings
HDR, PhD thesis
Book part
Research/contract report
Standardization
Characterization of Régnier?s matrices in classification.  
O. Hudry.
Structured Matrix Days, Limoges, Mai 2019.
Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes.
O. Hudry et A. Lobstein.
Theoretical Computer Science, vol. 767, pp. 83-102, DOI: 10.1016/j.tcs.2018.09.034, 2019.
Introduction à l?optimisation continue et discrète.
I. Charon et O. Hudry.
Lavoisier, 2019.
Optimization of wireless sensor networks deployment with coverage and connectivity constraints.
S. Elloumi, O. Hudry, E. Marie, A. Martin, A. Plateau et S. Rovedakis.
Annals of Operations Research, Juin 2018.
Descent with mutations applied to the linear ordering problem.
O. Hudry.
International Symposium on Combinatorial Optimization, vol. 10856, pp. 253-264, Marrakech, Maroc, Avril 2018.
Application of the ?descent with mutations? metaheuristic to a clique partitioning problem.
O. Hudry.
RAIRO - Operations Research, DOI: 10.1051/ro/2018048, 2018.
Operations Research and Enterprise Systems.
O. Hudry.
2018.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Septembre 2017.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Septembre 2017.
Complexity results on dominating codes.
O. Hudry et A. Lobstein.
The Second Malta Conference in Graph Theory and Combinatorics, Qawra, Malta., Juin 2017.
Optimization of wireless sensor networks deployment with coverage and connectivity constraints.
S. Elloumi, O. Hudry, E. Marie, A. Plateau et S. Rovedakis.
4th International Conference on Control, Decision and Information Technologies (CoDIT'17), pp. 336-341, Barcelone, Espagne, Avril 2017.
Operations Research and Voting Theory.
O. Hudry.
Février 2017.
Challenges, Solutions and Implications for Large Scale Enterprise Systems: OR in the Age of Big Data.
O. Hudry.
Février 2017.
More Results on the Complexity of Domination Problems in Graphs.  
O. Hudry et A. Lobstein.
International Journal of Information and Coding Theory, vol. 4, n° 2/3, pp. 129-144, 2017.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Internet Engineering Task Force - (IETF), 2017.
On metric convexity, the discrete Hahn-Banach theorem, separating systems and sets of points forming only acute angles.
H. Randriambololona.
Int. J. of Information and Coding Theory, vol. 4, n° 2/3, pp. 159-169, 2017.
More Results on the Complexity of Identifying Problems in Graphs.  
O. Hudry et A. Lobstein.
Theoretical Computer Science , vol. 626, pp. 1-12, Mai 2016.
Lexicographic decomposition of preferences into partial orders.
O. Hudry.
European Chapter on Combinatorial Optimization XXIX (ECCO XXIX), Budapest, Hongrie, Mai 2016.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-13.txt, Février 2016.
Yet another variation on minimal linear codes.  
G. Cohen, S. Mesnager et H. Randriambololona.
Advances in mathmatics of Communications, vol. 10, n° 1, pp. 53-61, Février 2016.
Handbook of Computational Social Choice.
F. Fischer, O. Hudry et R. Niedermeier.
2016.
On the Ensemble of Optimal Identifying Codes in a Twin-Free Graph.
I. Honkala, O. Hudry et A. Lobstein.
Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, vol. 8, pp. 139-153, 2016.
On existence (based on an arithmetical problem) and constructions of bent functions.  
S. Mesnager, G. Cohen et D. Madore.
IMACC , vol. LNCS 9496, pp. 3-19, Décembre 2015.
Linear independence of rank 1 matrices and the dimension of *-products of codes.
H. Randriambololona.
2015 IEEE International Symposium on Information Theory (ISIT 2015), Juin 2015.
On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a Graph.  
I. Honkala, O. Hudry et A. Lobstein.
Information Processing Letters, vol. 115, pp. 699-702, Mai 2015.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-12.txt, Mai 2015.
On products and powers of linear codes under componentwise multiplication.
H. Randriambololona.
Contemporary Mathematics, Avril 2015.
LISP EID Block.
L. Iannone, D. Lewis, D. Meyer et V. Fuller.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-11.txt, Avril 2015.
Computation of the winner of an election .
O. Hudry.
Avril 2015.
Calculabilité de la cohomologie étale modulo $\ell$.
D. Madore et F. Orgogozo.
Algebra Number Theory, vol. 9, n° 7, pp. 1647--1739, DOI: 10.2140/ant.2015.9.1647, Avril 2015.
Lower bounds on the minimum distance of long codes in the Lee metric.
H. Randriam, L. Sok et P. Solé.
Designs, Codes and Cryptography, vol. 74, n° 2, pp. 441-452, Février 2015.
Complexité et théorie du vote.
O. Hudry.
Bulletin de la Société française de recherche opérationnelle et d?aide à la décision (ROADEF), vol. 33, pp. 7-14, Février 2015.
On the number of optimal identifying codes in a twin-free graph.  
I. Honkala, O. Hudry et A. Lobstein.
Discrete Applied Mathematics, vol. 180, pp. 111-119, Janvier 2015.
LISP EID Block.
L. Iannone, D. Lewis, V. Fuller et D. Meyer.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-10.txt, Janvier 2015.
Yet another variation on minimal linear codes.  
G. Cohen, S. Mesnager et H. Randriam.
ITA , pp. 329-330, Janvier 2015.
Complexity results for extensions of median orders to different types of remoteness.  
O. Hudry.
Annals of Operations Research , vol. 225, pp. 111-123, 2015.
New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields.
J. Pieltant et H. Randriam.
Math. of Computation, vol. 84, n° 294, pp. 2023-2045, 2015.
On Polynomial Pairs of Integers.
F. Ezerman, B. Meyer et P. Solé.
Journal of Integer Sequences, vol. 18, 2015.
NP-hardness of the computation of a median equivalence relation in classification.
O. Hudry.
VIII ALIO/EURO Workshop on Applied Combinatorial Optimization (ALIO/EURO 2014), Montevideo, Uruguay, Décembre 2014.
On the Number of Optimal Identifying Codes in Twin-Free Graphs.
I. Honkala, O. Hudry et A. Lobstein.
Bordeaux Graph Workshop (BGW 2014), Bordeaux, Novembre 2014.
Variations of identifying codes in graphs obained by adding or removing one vertex.
I. Charon, I. Honkala, O. Hudry et A. Lobstein.
9th International colloquium on graph theory and combinatorics (ICGT 2014), vol. Book of extended abstracts, n° 39, pp. 1-4, Grenoble, France, Juillet 2014.
LISP EID Block.
L. Iannone, D. Lewis, V. Fuller et D. Meyer.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-09.txt, Juillet 2014.
Simplicial Homology of Random Configurations.  
L. Decreusefond, E. Ferraz, H. Randriambololona et A. Vergne.
Advances in Applied Probability., vol. 46, n° 2, pp. 325-347, Juin 2014.
A Post-Optimization Method for the Routing and Wavelength Assignment Problem Applied to Scheduled Lightpath Demands.  
L. Belgacem, I. Charon et O. Hudry.
European Journal of Operational Research, vol. 232, pp. 298-306, Janvier 2014.
Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound.  
D. Auger, I. Charon, O. Hudry et A. Lobstein.
Discrete Applied Mathematics, vol. 164, pp. 20-33, Janvier 2014.
LISP EID Block.
L. Iannone, D. Lewis, V. Fuller et D. Meyer.
Internet Engineering Task Force (IETF), n° draft-ietf-lisp-eid-block-08.txt, Janvier 2014.
Minimum Sizes of Identifying Codes in Graphs Differing by One Edge.  
I. Charon, I. Honkala, O. Hudry et A. Lobstein.
Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, vol. 6, n° 2, pp. 157-170, 2014.