Vincent Daniel Blondel (born April 28, 1965) is a Belgian professor of applied mathematics and former rector of the University of Louvain (UCLouvain) and a visiting professor at the Massachusetts Institute of Technology (MIT). Blondel's research lies in the area of mathematical control theory and theoretical computer science. He is mostly known for his contributions in computational complexity in control,[1] multi-agent coordination[2] and complex networks.[3][4]
Blondel is a former associate editor of the European Journal of Control (Springer) and of Systems and Control Letters (Elsevier). He is an editor of the journal Mathematics of Control, Signals, and Systems He has published about 100 journal articles and 6 books.
At UCLouvain, Blondel has founded the Group on Large Graphs and Networks. He has supervised 20 doctoral and postdoctoral researchers and 15 visiting professors. He was department head in 2003-2010 and a university president candidate in 2009.
In 2012, he is in charge of the following courses at UCLouvain :
LINMA 1691 : Discrete mathematics I : Graphs algorithmics and theory
LINMA 1702 : Optimisation Models and Methods
LINMA 2111 : Discrete mathematics II: Algorithms and complexity
LINMA 2120 : System theory seminar
LINMA 2472 : Special questions about discrete mathematics.
The last course is following the online course of M. Chiang from Princeton University : "20Q about networks : Friends, Money and Bytes"
[7]
References
^Blondel, V.D; Tsitsiklis, J.N. (2000). "Survey of computational complexity results in systems and control". Automatica. 36 (9): 1249–1274. doi:10.1016/S0005-1098(00)00050-9.
^Blondel, V.D; Hendrickx, J.M.; Olshevsky, A.; Tsitsiklis, J.N. (2005). "Convergence in multiagent coordination, consensus, and flocking". 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. pp. 2996–3000.
^Blondel, V.D; Guillaume, J.-L.; Lambiotte, R. and Lefebvre E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics. Vol. P10008, no. 9. pp. 1742–5468.
^
Blondel, V.D; Gajardo, A.; Heymans, M.; Senellart, P.; Van Dooren, P. (2004). A measure of similarity between graph vertices. With applications to synonym extraction and web searching. SIAM Review. Vol. 46, no. 4. pp. 647–666.{{cite conference}}: CS1 maint: multiple names: authors list (link)