| Publication | Date of Publication | Type |
|---|
Generic network sparsification via hybrid edge sampling
Journal of the Franklin Institute | 2025-02-06 | Paper |
Generic network sparsification via degree- and subgraph-based edge sampling
Information Sciences | 2024-07-23 | Paper |
| Estimating current-flow closeness centrality with a multigrid Laplacian solver | 2024-05-14 | Paper |
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
(available as arXiv preprint) | 2023-02-07 | Paper |
| High-quality hierarchical process mapping | 2023-02-07 | Paper |
Scalable Katz ranking computation in large static and dynamic graphs
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| An MPI-based algorithm for mapping complex networks onto hierarchical architectures | 2022-03-31 | Paper |
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Approximating Betweenness Centrality in Fully Dynamic Networks
Internet Mathematics | 2021-03-26 | Paper |
Group Centrality Maximization for Large-scale Graphs
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Maxent-stress optimization of 3D biomolecular models
(available as arXiv preprint) | 2020-05-27 | Paper |
\(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Approximating betweenness centrality in large evolving networks
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Computing top-\(k\) closeness centrality faster in unweighted graphs
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Scaling up group closeness maximization
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Updating dynamic random hyperbolic graphs in sublinear time
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Engineering a combinatorial Laplacian solver: lessons learned
Algorithms | 2019-03-26 | Paper |
Improving the betweenness centrality of a node by adding links
ACM Journal of Experimental Algorithmics | 2018-11-20 | Paper |
scientific article; zbMATH DE number 6917138 (Why is no real title available?)
(available as arXiv preprint) | 2018-08-13 | Paper |
On finding convex cuts in general, bipartite and plane graphs
Theoretical Computer Science | 2017-09-13 | Paper |
Tree-based coarsening and partitioning of complex networks
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
Journal of Heuristics | 2017-04-28 | Paper |
Drawing large graphs by multilevel maxent-stress optimization
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Querying probabilistic neighborhoods in spatial data sets efficiently
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Generating Random Hyperbolic Graphs in Subquadratic Time
Algorithms and Computation | 2016-01-11 | Paper |
Fully-dynamic approximation of betweenness centrality
Algorithms - ESA 2015 | 2015-11-19 | Paper |
| Disturbed diffusive processes for solving partitioning problems on graphs | 2014-10-11 | Paper |
| Disturbed diffusive processes for solving partitioning problems on graphs | 2014-10-11 | Paper |
| Recent Advances in Graph Partitioning | 2013-11-13 | Paper |
| Parallel community detection for massive graphs | 2013-06-25 | Paper |
| Shape optimizing load balancing for MPI-parallel adaptive numerical simulations | 2013-06-25 | Paper |
Finding all convex cuts of a plane graph in cubic time
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Beyond good partition shapes: an analysis of diffusive graph partitioning
Algorithmica | 2013-01-28 | Paper |
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
Algorithms and Computation | 2010-12-09 | Paper |
Analyzing Disturbed Diffusion on Networks
Algorithms and Computation | 2008-04-24 | Paper |
