معرفی
Maximilien Danisch is an Associate Professor at Sorbonne University's ComplexNetworks team (LIP6) in Paris, France, affiliated with CNRS. His research focuses on the analysis and algorithmics of massive real-world graphs, particularly in network science and graph theory. He holds a PhD from Sorbonne University, supervised by Jean-Loup Guillaume and Bénédicte Le Grand, and conducted postdoctoral work under Mauro Sozio. His work emphasizes scalable algorithms for graph processing, community detection, and social network analysis.
Education:
- PhD in Computer Science, Sorbonne University (2015)
- Supervised by Jean-Loup Guillaume and Bénédicte Le Grand
Research Interests:
- Graph Theory: Focusing on clique detection, dense subgraphs, and graph compression.
- Social Network Analysis: Studying influence propagation, tweet virality, and social media dynamics.
- Data Science: Applying optimization techniques like convex programming to graph decomposition.
Grants & Projects: Leads the ANR JCJC project LiMass (Linear algorithms for massive real-world graphs). Collaborates on projects like LouvainNE for scalable network embedding and KClist++ for clique-based densest subgraphs.
Labs & Teams: Part of the ComplexNetworks team at LIP6, a leading lab in computer science and network analysis.
