Florian Adriaens

According to our database, Florian Adriaens authored at least 15 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs.

Florian Adriaens, Iiro Kumpulainen, Nikolaj Tatti

CoRR, 2024

Multilayer Correlation Clustering.

Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti

CoRR, 2024

Max-Min Diversification with Asymmetric Distances.

Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023

Testing Cluster Properties of Signed Graphs.

Florian Adriaens, Simon Apers

Proceedings of the ACM Web Conference 2023, 2023

Minimizing Hitting Time between Disparate Groups with Shortcut Edges.

Florian Adriaens, Honglian Wang, Aristides Gionis

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022

Diameter Minimization by Shortcutting with Degree Constraints.

Florian Adriaens, Aristides Gionis

Proceedings of the IEEE International Conference on Data Mining, 2022

Improved analysis of randomized SVD for top-eigenvector approximation.

Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Testing properties of signed graphs.

Florian Adriaens, Simon Apers

CoRR, 2021

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

Scalable Dyadic Independence Models with Local and Global Constraints.

Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie

CoRR, 2020

Block-Approximated Exponential Random Graphs.

Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie

Proceedings of the 7th IEEE International Conference on Data Science and Advanced Analytics, 2020

2019

Subjectively interesting connecting trees and forests.

Florian Adriaens, Jefrey Lijffijt, Tijl De Bie

Data Min. Knowl. Discov., 2019

Discovering Interesting Cycles in Directed Graphs.

Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

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

2017

Subjectively Interesting Connecting Trees.

Florian Adriaens, Jefrey Lijffijt, Tijl De Bie

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017