Subjectively Interesting Connecting Trees. - Florian Adriaens; Jefrey Lijffijt; Tijl De Bie (ECML/PKDD (2), 2017)

From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths. - Florian Adriaens; Tijl De Bie; Aristides Gionis; Jefrey Lijffijt; Polina Rozenshtein (CoRR, 2018)

Discovering Interesting Cycles in Directed Graphs. - Florian Adriaens; Çigdem Aslay; Tijl De Bie; Aristides Gionis; Jefrey Lijffijt (CIKM, 2019)

Subjectively interesting connecting trees and forests. - Florian Adriaens; Jefrey Lijffijt; Tijl De Bie (Data Min. Knowl. Discov., 2019)

Block-Approximated Exponential Random Graphs. - Florian Adriaens; Alexandru Mara; Jefrey Lijffijt; Tijl De Bie (DSAA, 2020)

Scalable Dyadic Independence Models with Local and Global Constraints. - Florian Adriaens; Alexandru Mara; Jefrey Lijffijt; Tijl De Bie (CoRR, 2020)

Relaxing the strong triadic closure problem for edge strength inference. - Florian Adriaens; Tijl De Bie; Aristides Gionis; Jefrey Lijffijt; Antonis Matakos; Polina Rozenshtein (Data Min. Knowl. Discov., 2020)

Testing properties of signed graphs. - Florian Adriaens; Simon Apers (CoRR, 2021)

Improved analysis of randomized SVD for top-eigenvector approximation. - Ruo-Chun Tzeng; Po-An Wang; Florian Adriaens; Aristides Gionis; Chi-Jen Lu (AISTATS, 2022)

Diameter Minimization by Shortcutting with Degree Constraints. - Florian Adriaens; Aristides Gionis (ICDM, 2022)

Minimizing Hitting Time between Disparate Groups with Shortcut Edges. - Florian Adriaens; Honglian Wang; Aristides Gionis (KDD, 2023)

Testing Cluster Properties of Signed Graphs. - Florian Adriaens; Simon Apers (WWW, 2023)

Max-Min Diversification with Asymmetric Distances. - Iiro Kumpulainen; Florian Adriaens; Nikolaj Tatti (KDD, 2024)

Multilayer Correlation Clustering. - Atsushi Miyauchi 001; Florian Adriaens; Francesco Bonchi; Nikolaj Tatti (CoRR, 2024)

Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs. - Florian Adriaens; Iiro Kumpulainen; Nikolaj Tatti (CoRR, 2024)

Fair Diversity Maximization with Few Representatives. - Florian Adriaens; Nikolaj Tatti (CoRR, 2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. - Vedangi Bengali; Nikolaj Tatti; Iiro Kumpulainen; Florian Adriaens; Nate Veldt (CoRR, 2025)