default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander van der Grinten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]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)- [c15]Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke:
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs. CLUSTER 2022: 429-439 - [c14]Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke:
Interactive Visualization of Protein RINs using NetworKit in the Cloud. IPDPS Workshops 2022: 255-264 - [c13]Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke:
An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality. SBAC-PAD 2022: 100-109 - [c12]Alexander van der Grinten, Maria Predari, Florian Willich:
A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks. SEA 2022: 11:1-11:18 - [p1]Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. Algorithms for Big Data 2022: 3-20 - [i14]Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke:
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs. CoRR abs/2202.08808 (2022) - [i13]Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke:
Interactive Visualization of Protein RINs using NetworKit in the Cloud. CoRR abs/2203.01263 (2022) - [i12]Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR abs/2209.13355 (2022) - 2021
- [c11]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX 2021: 154-168 - [c10]Rick Plachetta, Alexander van der Grinten:
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving. ALENEX 2021: 169-180 - [c9]Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke:
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. SDM 2021: 136-144 - [i11]Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke:
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR abs/2101.06192 (2021) - 2020
- [j2]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Scaling up network centrality computations - A brief overview. it Inf. Technol. 62(3-4): 189-204 (2020) - [c8]Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. ALENEX 2020: 56-69 - [c7]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA 2020: 6:1-6:24 - [c6]Alexander van der Grinten, Henning Meyerhenke:
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. IPDPS 2020: 527-535 - [c5]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. SEA 2020: 4:1-4:15 - [d1]Narek Bojikian, Alexander van der Grinten, Falko Hegerfeld, Laurence Alec Kluge, Stefan Kratsch:
PACE-Challenge-2020-HU-Berlin-Exact-Track. Zenodo, 2020
- [i10]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. CoRR abs/2001.07134 (2020) - [i9]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. CoRR abs/2006.13679 (2020) - [i8]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR abs/2010.15435 (2020)
2010 – 2019
- 2019
- [j1]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12(7): 127 (2019) - [c4]Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke:
Local Search for Group Closeness Maximization on Big Graphs. IEEE BigData 2019: 711-720 - [c3]Alexander van der Grinten, Henning Meyerhenke:
Scaling up Network Centrality Computations *. DATE 2019: 1319-1324 - [c2]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par 2019: 434-447 - [i7]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Parallel Adaptive Sampling with almost no Synchronization. CoRR abs/1903.09422 (2019) - [i6]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics in Network Analysis. CoRR abs/1904.04690 (2019) - [i5]Alexander van der Grinten, Henning Meyerhenke:
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. CoRR abs/1910.11039 (2019) - [i4]Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. CoRR abs/1910.13874 (2019) - [i3]Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke:
Local Search for Group Closeness Maximization on Big Graphs. CoRR abs/1911.03360 (2019) - 2018
- [b1]Alexander van der Grinten:
Design, implementation and evaluation of a distributed CDCL framework. University of Cologne, Germany, 2018 - [c1]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 - [i2]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) - 2013
- [i1]Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer:
Effectiveness of pre- and inprocessing for CDCL-based SAT solving. CoRR abs/1310.4756 (2013)
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-07 21:18 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:
