default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Pellizzoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Paolo Pellizzoni, Till Hendrik Schulz, Dexiong Chen, Karsten M. Borgwardt:
On the Expressivity and Sample Complexity of Node-Individualized Graph Neural Networks. NeurIPS 2024- [c6]Paolo Pellizzoni, Carlos G. Oliver, Karsten M. Borgwardt:
Structure- and Function-Aware Substitution Matrices via Learnable Graph Matching. RECOMB 2024: 288-307 - [i5]Dexiong Chen, Philip Hartout, Paolo Pellizzoni, Carlos G. Oliver, Karsten M. Borgwardt:
Endowing Protein Language Models with Structural Knowledge. CoRR abs/2401.14819 (2024) - 2023
- [j3]Paolo Pellizzoni, Giulia Muzio
, Karsten M. Borgwardt:
Higher-order genetic interaction discovery with network-based biological priors. Bioinform. 39(Supplement-1): 523-533 (2023) - [c5]Paolo Pellizzoni, Fabio Vandin:
VC-dimension and Rademacher Averages of Subgraphs, with Applications to Graph Mining. ICDE 2023: 2470-2482 - [c4]Paolo Pellizzoni, Karsten M. Borgwardt:
FASM and FAST-YB: Significant Pattern Mining with False Discovery Rate Control. ICDM 2023: 1265-1270 - [c3]Dexiong Chen, Paolo Pellizzoni, Karsten M. Borgwardt:
Fisher Information Embedding for Node and Graph Learning. ICML 2023: 4839-4855 - [c2]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. WADS 2023: 620-636 - [i4]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully dynamic clustering and diversity maximization in doubling metrics. CoRR abs/2302.07771 (2023) - [i3]Dexiong Chen, Paolo Pellizzoni, Karsten M. Borgwardt:
Fisher Information Embedding for Node and Graph Learning. CoRR abs/2305.07580 (2023) - 2022
- [j2]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
k-Center Clustering with Outliers in Sliding Windows. Algorithms 15(2): 52 (2022) - [j1]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Adaptive k-center and diameter estimation in sliding windows. Int. J. Data Sci. Anal. 14(2): 155-173 (2022) - [i2]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
k-Center Clustering with Outliers in Sliding Windows. CoRR abs/2201.02448 (2022) - [i1]Paolo Pellizzoni, Francesco Silvestri:
Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance. CoRR abs/2212.06605 (2022) - 2020
- [c1]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Dimensionality-adaptive k-center in sliding windows. DSAA 2020: 197-206
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 2025-02-15 00:24 CET 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:
