Alexander van der Grinten

Orcid: 0000-0002-9709-9478

According to our database1, Alexander van der Grinten authored at least 22 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.
ACM J. Exp. Algorithmics, 2022

Algorithms for Large-scale Network Analysis and the NetworKit Toolkit.
CoRR, 2022

A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality.
Proceedings of the 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2022

Interactive Visualization of Protein RINs using NetworKit in the Cloud.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs.
Proceedings of the IEEE International Conference on Cluster Computing, 2022

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
Scaling up network centrality computations - A brief overview.
it Inf. Technol., 2020

High-Quality Hierarchical Process Mapping.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Group Centrality Maximization for Large-scale Graphs.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Guidelines for Experimental Algorithmics in Network Analysis.
CoRR, 2019

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis.
Algorithms, 2019

Parallel Adaptive Sampling with Almost No Synchronization.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Scaling up Network Centrality Computations <sup>*</sup>.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

Local Search for Group Closeness Maximization on Big Graphs.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018
Design, implementation and evaluation of a distributed CDCL framework.
PhD thesis, 2018

2013
Effectiveness of pre- and inprocessing for CDCL-based SAT solving.
CoRR, 2013


  Loading...