Florian Adriaens

Computer Science · Physical Sciences

5h-index58citations23works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(9), Complexity and Algorithms in Graphs(8), Complex Network Analysis Techniques(5), Advanced Graph Neural Networks(4), Optimization and Search Problems(4)

Publications23 total

Simple 2-approximations for bad triangle transversals and some hardness results for related problems
ArXiv.org·2026Open Access
Simple 2-approximations for bad triangle transversals and some hardness results for related problems
arXiv (Cornell University)·2026Open Access
The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards
Lecture notes in computer science·2025
Fair Diversity Maximization with Few Representatives
2025Open Access
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
arXiv (Cornell University)·2025Open Access
Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
arXiv (Cornell University)·2024Open Access
Max-Min Diversification with Asymmetric Distances
2024· 1 citedOpen Access
Multilayer Correlation Clustering
arXiv (Cornell University)·2024Open Access
Minimizing Hitting Time between Disparate Groups with Shortcut Edges
2023· 3 citedOpen Access
Minimizing Hitting Time between Disparate Groups with Shortcut Edges
arXiv (Cornell University)·2023Open Access
Testing Cluster Properties of Signed Graphs
2023· 5 citedOpen Access
Diameter Minimization by Shortcutting with Degree Constraints
2022 IEEE International Conference on Data Mining (ICDM)·2022· 11 cited
Diameter Minimization by Shortcutting with Degree Constraints
arXiv (Cornell University)·2022· 1 citedOpen Access
Improved analysis of randomized SVD for top-eigenvector approximation
arXiv (Cornell University)·2022· 1 citedOpen Access
Testing properties of signed graphs
arXiv (Cornell University)·2021· 1 citedOpen Access
Block-Approximated Exponential Random Graphs
2020Open Access
Scalable Dyadic Independence Models with Local and Global Constraints
arXiv (Cornell University)·2020· 3 citedOpen Access
Relaxing the strong triadic closure problem for edge strength inference
Data Mining and Knowledge Discovery·2020· 7 citedOpen Access
Mining and modeling graphs using patterns and priors
Ghent University Academic Bibliography (Ghent University)·2020Open Access
Subjectively interesting connecting trees and forests
Data Mining and Knowledge Discovery·2019· 15 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Aristides Gionis(8), Jefrey Lijffijt(7), Tijl De Bie(7), Nikolaj Tatti(6), Iiro Kumpulainen(4), Polina Rozenshtein(2), Simon Apers(2), Alexandru Mara(2), Honglian Wang(2), Nikolaj Tatti(2), Vedangi Bengali(2), Nate Veldt(2), Antonis Matakos(1), Ruo-Chun Tzeng(1), Po-An Wang(1), Chi-Jen Lu(1), Çiğdem Aslay(1), Atsushi Miyauchi(1), Francesco Bonchi(1)