Research area
My PhD:
Social networks are more and more important in the world. A good analysis and understanding of the social networks is crucial nowadays. In fact studying of social networks can help to provide innovative services which are adapted to the needs of users in telecommunications and on the Web. Thus our work focuses on the algorithmic aspects of social networks. These networks are a particular case of telecommunication networks because of their large size. We focus particularly on the problem of detection of communities in large networks such as social networks. The purpose is to build effecient communities detection tools in order to target services according to the behavior of the communities. The algorithmic problems posed by such networks are the computational time and the memory required by the algorithms. Then in our work, we apply complexity theory, matroid theory and combinatorial optimization tools to gain insights into the characteristics of such problems within networks.
In general:
I also work on optimization in network design, routing and in search engines.
In general, I am interested in combinatorial optimization, Game theory Algorithms, Approximation of hard problems, Complexity theory, Graph theory and Operations research.
Generally, my work deals with the application of optimization in telecommunication.