default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Adriaens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Iiro Kumpulainen
, Florian Adriaens, Nikolaj Tatti:
Max-Min Diversification with Asymmetric Distances. KDD 2024: 1440-1450- [i9]Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti:
Multilayer Correlation Clustering. CoRR abs/2404.16676 (2024) - [i8]Florian Adriaens, Iiro Kumpulainen, Nikolaj Tatti:
Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs. CoRR abs/2409.07201 (2024) - 2023
- [c7]Florian Adriaens, Honglian Wang, Aristides Gionis:
Minimizing Hitting Time between Disparate Groups with Shortcut Edges. KDD 2023: 1-10 - [c6]Florian Adriaens, Simon Apers:
Testing Cluster Properties of Signed Graphs. WWW 2023: 49-59 - [i7]Florian Adriaens, Honglian Wang, Aristides Gionis:
Minimizing Hitting Time between Disparate Groups with Shortcut Edges. CoRR abs/2306.03571 (2023) - 2022
- [c5]Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu:
Improved analysis of randomized SVD for top-eigenvector approximation. AISTATS 2022: 2045-2072 - [c4]Florian Adriaens, Aristides Gionis:
Diameter Minimization by Shortcutting with Degree Constraints. ICDM 2022: 843-848 - [i6]Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens, Aristides Gionis, Chi-Jen Lu:
Improved analysis of randomized SVD for top-eigenvector approximation. CoRR abs/2202.07992 (2022) - [i5]Florian Adriaens, Aristides Gionis:
Diameter Minimization by Shortcutting with Degree Constraints. CoRR abs/2209.00370 (2022) - 2021
- [i4]Florian Adriaens, Simon Apers:
Testing properties of signed graphs. CoRR abs/2102.07587 (2021) - 2020
- [j2]Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Antonis Matakos, Polina Rozenshtein:
Relaxing the strong triadic closure problem for edge strength inference. Data Min. Knowl. Discov. 34(3): 611-651 (2020) - [c3]Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie:
Block-Approximated Exponential Random Graphs. DSAA 2020: 70-80 - [i3]Florian Adriaens, Alexandru Mara, Jefrey Lijffijt, Tijl De Bie:
Scalable Dyadic Independence Models with Local and Global Constraints. CoRR abs/2002.07076 (2020)
2010 – 2019
- 2019
- [j1]Florian Adriaens, Jefrey Lijffijt, Tijl De Bie:
Subjectively interesting connecting trees and forests. Data Min. Knowl. Discov. 33(4): 1088-1124 (2019) - [c2]Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt:
Discovering Interesting Cycles in Directed Graphs. CIKM 2019: 1191-1200 - [i2]Florian Adriaens, Çigdem Aslay, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt:
Discovering Interesting Cycles in Directed Graphs. CoRR abs/1909.01060 (2019) - 2018
- [i1]Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Polina Rozenshtein:
From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths. CoRR abs/1802.03549 (2018) - 2017
- [c1]Florian Adriaens, Jefrey Lijffijt, Tijl De Bie:
Subjectively Interesting Connecting Trees. ECML/PKDD (2) 2017: 53-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
