معرفی
Florian Adriaens is a Postdoctoral Researcher in the Department of Computer Science at the University of Helsinki, specializing in data mining, graph algorithms, and theoretical computer science with significant contributions to algorithmic fairness and network analysis. His work bridges theoretical foundations and practical applications in complex graph structures.
His core research interests include:
- Data Mining
- Graph Algorithms
- Network Analysis
- Algorithmic Fairness
- Theoretical Computer Science
Adriaens has published 15 peer-reviewed articles from 2017-2025 in top venues including KDD and WWW, demonstrating evolving expertise from foundational graph problems (diameter minimization, signed graph clustering) to cutting-edge hypergraph optimization and fairness-aware diversification. Recent publications (2024-2025) show increased focus on cardinality-constrained hypergraph cuts, multilayer correlation clustering, and fair representative selection, reflecting growing complexity in his research trajectory. His collaborative work includes researchers like Gionis, Tatti, and Wang, indicating strong interdisciplinary connections within the data mining community.
Contact: florian.adriaens@helsinki.fi | ORCID
