معرفی
Olivier Hudry is a Professor at Télécom Paris in the Computer Science and Networks (Infres) department. He is affiliated with the Cybersecurity and Cryptography (C²) research team and the Information Processing and Communication Laboratory (LTCI). His work bridges combinatorial optimization and graph theory with applications in cybersecurity, voting theory, and network optimization.
His research includes identifying codes in graphs, domination problems, and algorithmic complexity in social choice theory. Recent publications focus on q-ary Lee hypercubes, rainbow problems, and unique solutions in graph theory. He has also developed software for computing Slater indices in tournaments.
Teaching roles include courses on Data Structures and Algorithms (INF 101), Continuous Optimization (MDI 210), Complexity Theory (MITRO 203), and Combinatorial Optimization (MITRO 205). He has authored textbooks on combinatorial analysis and operations research.
Contact: olivier.hudry@telecom-paris.fr | olivier.hudry@telecom-paristech.fr
