default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElisabetta Bergamini
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Alexander van der Grinten
, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM J. Exp. Algorithmics 27: 1.7:1-1.7:16 (2022)- [p1]Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully Dynamic Graphs. Massive Graph Analytics 2022: 161-192
2010 – 2019
- 2019
- [j3]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - 2018
- [b1]Elisabetta Bergamini:
Algorithms for the Identification of Central Nodes in Large Real-World Networks. Karlsruhe University, Germany, 2018 - [j2]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018) - [c9]Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. ALENEX 2018: 21-35 - [c8]Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke:
Scaling up Group Closeness Maximization. ALENEX 2018: 209-222 - [c7]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ESA 2018: 42:1-42:14 - [i10]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. CoRR abs/1807.03847 (2018) - 2017
- [c6]Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. SEA 2017: 23:1-23:16 - [i9]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i8]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - [i7]Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. CoRR abs/1704.08592 (2017) - [i6]Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. CoRR abs/1710.01143 (2017) - [i5]Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke:
Scaling up Group Closeness Maximization. CoRR abs/1710.01144 (2017) - 2016
- [j1]Elisabetta Bergamini, Henning Meyerhenke:
Approximating Betweenness Centrality in Fully Dynamic Networks. Internet Math. 12(5): 281-314 (2016) - [c5]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c4]Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke:
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CSC 2016: 1-12 - [i4]Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke:
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CoRR abs/1607.02955 (2016) - 2015
- [c3]Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. ALENEX 2015: 133-146 - [c2]Elisabetta Bergamini, Romina D'Aurizio, Mauro Leoncini, Marco Pellegrini:
CNVScan: detecting borderline copy number variations in NGS data via scan statistics. BCB 2015: 335-344 - [c1]Elisabetta Bergamini, Henning Meyerhenke:
Fully-Dynamic Approximation of Betweenness Centrality. ESA 2015: 155-166 - [i3]Elisabetta Bergamini, Henning Meyerhenke:
Fully-dynamic Approximation of Betweenness Centrality. CoRR abs/1504.07091 (2015) - [i2]Elisabetta Bergamini, Henning Meyerhenke:
Approximating Betweenness Centrality in Fully-dynamic Networks. CoRR abs/1510.07971 (2015) - 2014
- [i1]Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. CoRR abs/1409.6241 (2014)
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-04-25 05:56 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:
