Florian Adriaens

25 papers A* 4A 2B 1Journal 15Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Simple 2-approximations for bad triangle transversals and some hardness results for related problems.
CoRR
Florian Adriaens, Nikolaj Tatti
2025 — conf
Fair Diversity Maximization with Few Representatives.
KDD (2)
Florian Adriaens, Nikolaj Tatti
2025 J jnl
Fair Diversity Maximization with Few Representatives.
CoRR
Florian Adriaens, Nikolaj Tatti
2025 J jnl
Max-Min Diversification with Asymmetric Distances.
CoRR
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
2025 — conf
The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards.
ECML/PKDD (3)
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2025 J jnl
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards.
CoRR
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2024 J jnl
Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs.
CoRR
Florian Adriaens, Iiro Kumpulainen, Nikolaj Tatti
2024 A* conf
Max-Min Diversification with Asymmetric Distances.
KDD
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
2024 J jnl
Multilayer Correlation Clustering.
CoRR
Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
2023 A* conf
Minimizing Hitting Time between Disparate Groups with Shortcut Edges.
KDD
Florian Adriaens, Honglian Wang, Aristides Gionis
2023 J jnl
Minimizing Hitting Time between Disparate Groups with Shortcut Edges.
CoRR
Florian Adriaens, Honglian Wang, Aristides Gionis
2023 A* conf
Testing Cluster Properties of Signed Graphs.
WWW
Florian Adriaens, Simon Apers
2022 A* conf
Diameter Minimization by Shortcutting with Degree Constraints.
ICDM
Florian Adriaens, Aristides Gionis
2022 J jnl
Diameter Minimization by Shortcutting with Degree Constraints.
CoRR
Florian Adriaens, Aristides Gionis
2022 A conf
Improved analysis of randomized SVD for top-eigenvector approximation.
AISTATS
Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu
2022 J jnl
Improved analysis of randomized SVD for top-eigenvector approximation.
CoRR
Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu
2021 J jnl
Testing properties of signed graphs.
CoRR
Florian Adriaens, Simon Apers
2020 B conf
Block-Approximated Exponential Random Graphs.
DSAA
Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
2020 J jnl
Relaxing the strong triadic closure problem for edge strength inference.
Data Min. Knowl. Discov.
Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Antonis Matakos, Polina Rozenshtein
2020 J jnl
Scalable Dyadic Independence Models with Local and Global Constraints.
CoRR
Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
2019 A conf
Discovering Interesting Cycles in Directed Graphs.
CIKM
Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt
2019 J jnl
Discovering Interesting Cycles in Directed Graphs.
CoRR
Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt
2019 J jnl
Subjectively interesting connecting trees and forests.
Data Min. Knowl. Discov.
Florian Adriaens, Jefrey Lijffijt, Tijl De Bie
2018 J jnl
From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths.
CoRR
Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Polina Rozenshtein
2017 — conf
Subjectively Interesting Connecting Trees.
ECML/PKDD (2)
Florian Adriaens, Jefrey Lijffijt, Tijl De Bie