default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdriano Fazzone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Tommaso Lanciano
, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi:
A Survey on the Densest Subgraph Problem and its Variants. ACM Comput. Surv. 56(8): 208:1-208:40 (2024)- [j4]Adriano Fazzone, Yanhao Wang, Francesco Bonchi:
Fair Representation in Submodular Subset Selection: A Pareto Optimization Approach. Trans. Mach. Learn. Res. 2024 (2024) - [i7]Giulia Preti, Adriano Fazzone, Giovanni Petri, Gianmarco De Francisci Morales:
A Higher-Order Lens for Social Systems. CoRR abs/2402.18470 (2024) - 2023
- [i6]Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi:
A Survey on the Densest Subgraph Problem and its Variants. CoRR abs/2303.14467 (2023) - 2022
- [j3]Adriano Fazzone, Tommaso Lanciano, Riccardo Denni, Charalampos E. Tsourakakis, Francesco Bonchi:
Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers. Proc. VLDB Endow. 15(13): 3883-3896 (2022) - 2021
- [j2]Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn:
Algorithms for fair k-clustering with multiple protected attributes. Oper. Res. Lett. 49(5): 787-789 (2021) - [c5]Aris Anagnostopoulos, Adriano Fazzone, Giacomo Vettraino:
Skyline in Crowdsourcing with Imprecise Comparisons. CIKM 2021: 37-46 - [i5]Luca Becchetti, Adriano Fazzone, Leonardo Martini:
Network and Sequence-Based Prediction of Protein-Protein Interactions. CoRR abs/2107.03694 (2021) - 2020
- [c4]Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, Cristina Menghini, Chris Schwiegelshohn:
Spectral Relaxations and Fair Densest Subgraphs. CIKM 2020: 35-44 - [i4]Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi:
Algorithms for Hiring and Outsourcing in the Online Labor Market. CoRR abs/2002.07618 (2020) - [i3]Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Fair Clustering with Multiple Colors. CoRR abs/2002.07892 (2020) - [i2]Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Algorithms for Fair Team Formation in Online Labour Marketplaces. CoRR abs/2002.11621 (2020)
2010 – 2019
- 2019
- [c3]Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn:
Algorithms for Fair Team Formation in Online Labour Marketplaces✱. WWW (Companion Volume) 2019: 484-490 - [i1]Aris Anagnostopoulos, Luca Becchetti, Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn:
Principal Fairness: \\ Removing Bias via Projections. CoRR abs/1905.13651 (2019) - 2018
- [c2]Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi:
Algorithms for Hiring and Outsourcing in the Online Labor Market. KDD 2018: 1109-1118 - 2017
- [j1]Aris Anagnostopoulos, Reem Atassi, Luca Becchetti, Adriano Fazzone, Fabrizio Silvestri:
Tour recommendation for groups. Data Min. Knowl. Discov. 31(5): 1157-1188 (2017) - 2015
- [c1]Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, Ida Mele, Matteo Riondato:
The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing. SIGMOD Conference 2015: 983-998
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-08-10 00:23 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:
