Alexander van der Grinten

34 papers A 8B 2C 2Journal 17Unranked 3
YearRankTypeTitle / Venue / Authors
2022 B conf
A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks.
SEA
Alexander van der Grinten, Maria Predari, Florian Willich
2022 — ch.
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.
Algorithms for Big Data
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck
2022 J jnl
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit.
CoRR
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck
2022 C conf
An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality.
SBAC-PAD
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
2022 C conf
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs.
CLUSTER
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
2022 J jnl
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs.
CoRR
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
2022 — conf
Interactive Visualization of Protein RINs using NetworKit in the Cloud.
IPDPS Workshops
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
2022 J jnl
Interactive Visualization of Protein RINs using NetworKit in the Cloud.
CoRR
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
2022 J jnl
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.
ACM J. Exp. Algorithmics
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
2021 A conf
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
ALENEX
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
2021 A conf
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
SDM
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
2021 J jnl
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
CoRR
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
2021 A conf
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving.
ALENEX
Rick Plachetta, Alexander van der Grinten
2020 A conf
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.
ESA
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
2020 J jnl
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.
CoRR
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
2020 A conf
Group Centrality Maximization for Large-scale Graphs.
ALENEX
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
2020 J jnl
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
CoRR
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
2020 B conf
High-Quality Hierarchical Process Mapping.
SEA
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
2020 J jnl
High-Quality Hierarchical Process Mapping.
CoRR
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
2020 A conf
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling.
IPDPS
Alexander van der Grinten, Henning Meyerhenke
2020 J jnl
Scaling up network centrality computations - A brief overview.
it Inf. Technol.
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
2019 J jnl
Group Centrality Maximization for Large-scale Graphs.
CoRR
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
2019 J jnl
Guidelines for Experimental Algorithmics in Network Analysis.
CoRR
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
2019 J jnl
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis.
Algorithms
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
2019 — conf
Local Search for Group Closeness Maximization on Big Graphs.
IEEE BigData
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
2019 J jnl
Local Search for Group Closeness Maximization on Big Graphs.
CoRR
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
2019 — conf
Parallel Adaptive Sampling with Almost No Synchronization.
Euro-Par
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
2019 J jnl
Parallel Adaptive Sampling with almost no Synchronization.
CoRR
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
2019 J jnl
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling.
CoRR
Alexander van der Grinten, Henning Meyerhenke
2019 A conf
Scaling up Network Centrality Computations
DATE
Alexander van der Grinten, Henning Meyerhenke
2018 — —
Design, implementation and evaluation of a distributed CDCL framework.
Alexander van der Grinten
2018 A conf
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.
ESA
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
2018 J jnl
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.
CoRR
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
2013 J jnl
Effectiveness of pre- and inprocessing for CDCL-based SAT solving.
CoRR
Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer