Resume: CV

I have been an associate professor in computing science since September 1993. The following sections gather different types of information useful for administrative applications (and mostly in French).

I completed my PhD in Graph Theory with Applications to Multiprocessor Computing at the University of Nice Sophia Antipolis (UNS) in 1992. Then I joined the Simon Fraser University in British Columbia as a postdoctoral fellow. I have been an associate professor at UNS since 1993. My current research topic is big graph processing.

In discrete mathematics, a graph is a structure used to represent relations between objects. The structure consists of vertices that model objects, and edges that connect pairs of related vertices. A graph is usually depicted as a diagram in which the vertices are drawn as disks (with labels), and the edges are drawn as line segments.

Graphs have been intensively used in the study of networks, whether for modeling road networks or computer networks such as for the Internet. Researchers have investigated fundamental properties of graphs and have produced efficient algorithms for application to networks, as for example the well-known Dijkstra’s algorithm that computes all of the shortest paths sourced at one given node.

More recently, the Internet has enabled the emergence of social networks that gather millions of users. The corresponding graphs used in the study of social activities occurring in these networks are so big that they cannot fit into the memory of a single computer. Moreover, existing algorithms that were designed and proved efficient for small graphs fail to terminate when processing such huge graphs.

Hence, the challenge today is to design new graph algorithms dedicated to very large graphs. That is our goal!