Henning Meyerhenke

CoRR, 2024

Introducing Total Harmonic Resistance for Graph Robustness Under Edge Deletions.

[BibT_eX]

[DOI]

Lukas Berner

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms✱.

[BibT_eX]

[DOI]

Svetlana Kulagina

Anne Benoit

Proceedings of the 53rd International Conference on Parallel Processing, 2024

2023

Greedy optimization of resistance-based graph robustness with global and local edge insertions.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., December, 2023

Scalable Graph Mining and Learning (Dagstuhl Seminar 23491).

[BibT_eX]

[DOI]

Danai Koutra

Ilya Safro

Fabian Brandt-Tumescheit

Dagstuhl Reports, December, 2023

More Recent Advances in (Hyper)Graph Partitioning.

[BibT_eX]

[DOI]

Ümit V. Çatalyürek

Karen D. Devine

Marcelo Fonseca Faraj

ACM Comput. Surv., December, 2023

Methodology of Algorithm Engineering.

[BibT_eX]

[DOI]

CoRR, 2023

Mapping tree-shaped workflows on systems with different memory sizes and processor speeds.

[BibT_eX]

[DOI]

Svetlana Kulagina

Anne Benoit

Concurr. Comput. Pract. Exp., 2023

2022

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching.

[BibT_eX]

[DOI]

Michal Boron

ACM J. Exp. Algorithmics, 2022

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

[BibT_eX]

[DOI]

Michael Hamann

Manuel Penschuck

CoRR, 2022

An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality.

[BibT_eX]

[DOI]

Geert Custers

Duy Le Thanh

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.

[BibT_eX]

[DOI]

Fabian Brandt-Tumescheit

Leon Franke

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

Mapping Tree-Shaped Workflows on Memory-Heterogeneous Architectures.

[BibT_eX]

[DOI]

Svetlana Kulagina

Anne Benoit

Proceedings of the Euro-Par 2022: Parallel Processing Workshops, 2022

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs.

[BibT_eX]

[DOI]

Geert Custers

Duy Le Thanh

Proceedings of the IEEE International Conference on Cluster Computing, 2022

Network Sparsification via Degree- and Subgraph-based Edge Sampling.

[BibT_eX]

[DOI]

Zhen Su

Jürgen Kurths

Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2022

Faster Greedy Optimization of Resistance-based Graph Robustness.

[BibT_eX]

[DOI]

Robert Kooij

Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2022

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.

[BibT_eX]

[DOI]

Michael Hamann

Manuel Penschuck

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Introduction to GraphBLAS.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

Computing Top-k Closeness Centrality in Fully Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

2021

The Collaborative Research Center FONDA.

[BibT_eX]

[DOI]

Datenbank-Spektrum, 2021

The climatic interdependence of extreme-rainfall events around the globe.

[BibT_eX]

[DOI]

Zhen Su

Jürgen Kurths

CoRR, 2021

New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2021: Parallel Processing, 2021

Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Fully-dynamic Weighted Matching Approximation in Practice.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Scaling up network centrality computations - A brief overview.

[BibT_eX]

[DOI]

it Inf. Technol., 2020

Combined Centrality Measures for an Improved Characterization of Influence Spreadin Social Networks.

[BibT_eX]

[DOI]

Mehmet Simsek

CoRR, 2020

Combined centrality measures for an improved characterization of influence spread in social networks.

[BibT_eX]

[DOI]

Mehmet Simsek

J. Complex Networks, 2020

High-Quality Hierarchical Process Mapping.

[BibT_eX]

[DOI]

Marcelo Fonseca Faraj

Jesper Larsson Träff

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study.

[BibT_eX]

[DOI]

Charilaos Tzovas

Proceedings of the 27th IEEE International Conference on High Performance Computing, 2020

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Group Centrality Maximization for Large-scale Graphs.

[BibT_eX]

[DOI]

Aleksandar Bojchevski

Daniel Zügner

Stephan Günnemann

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Computing top-k Closeness Centrality Faster in Unweighted Graphs.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2019

Guidelines for Experimental Algorithmics in Network Analysis.

[BibT_eX]

[DOI]

CoRR, 2019

diSTruct v1.0: generating biomolecular structures from distance constraints.

[BibT_eX]

[DOI]

Bioinform., 2019

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

[BibT_eX]

[DOI]

Algorithms, 2019

Parallel Adaptive Sampling with Almost No Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Scaling up Network Centrality Computations *.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

Local Search for Group Closeness Maximization on Big Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Drawing Large Graphs by Multilevel Maxent-Stress Optimization.

[BibT_eX]

[DOI]

Martin Nöllenburg

IEEE Trans. Vis. Comput. Graph., 2018

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

Improving the Betweenness Centrality of a Node by Adding Links.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

High-Performance Graph Algorithms (Dagstuhl Seminar 18241).

[BibT_eX]

[DOI]

Richard Peng

Ilya Safro

Dagstuhl Reports, 2018

Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach.

[BibT_eX]

[DOI]

Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Balanced k-means for Parallel Geometric Partitioning.

[BibT_eX]

[DOI]

Charilaos Tzovas

Proceedings of the 47th International Conference on Parallel Processing, 2018

Topology-induced Enhancement of Mappings.

[BibT_eX]

[DOI]

Proceedings of the 47th International Conference on Parallel Processing, 2018

Computing Top-k Closeness Centrality in Fully-dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

Scaling up Group Closeness Maximization.

[BibT_eX]

[DOI]

Tanya Gonser

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Parallel Graph Partitioning for Complex Networks.

[BibT_eX]

[DOI]

Peter Sanders

IEEE Trans. Parallel Distributed Syst., 2017

On finding convex cuts in general, bipartite and plane graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Computing Top-k Closeness Centrality in Fully-dynamic Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Generating realistic scaled complex networks.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2017

Faster Betweenness Centrality Updates in Evolving Networks.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Shared Memory Parallel Subgraph Enumeration.

[BibT_eX]

[DOI]

Raphael Kimmig

Darren Strash

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Maxent-Stress Optimization of 3D Biomolecular Models.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Engineering Parallel Algorithms for Community Detection in Massive Networks.

[BibT_eX]

[DOI]

Christian L. Staudt

IEEE Trans. Parallel Distributed Syst., 2016

An empirical comparison of Big Graph frameworks in the context of network analysis.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2016

Structure-preserving sparsification methods for social networks.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2016

NetworKit: A tool suite for large-scale complex network analysis.

[BibT_eX]

[DOI]

Christian L. Staudt

Aleksejs Sazonovs

Netw. Sci., 2016

Tree-Based Coarsening and Partitioning of Complex Networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2016

Approximating Betweenness Centrality in Fully Dynamic Networks.

[BibT_eX]

[DOI]

Internet Math., 2016

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.

[BibT_eX]

[DOI]

Peter Sanders

J. Heuristics, 2016

Correspondences between partitions.

[BibT_eX]

[DOI]

Christian L. Staudt

CoRR, 2016

Engineering a Combinatorial Laplacian Solver: Lessons Learned.

[BibT_eX]

[DOI]

Algorithms, 2016

Better Partitions of Protein Graphs for Subsystem Quantum Chemistry.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver.

[BibT_eX]

[DOI]

Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Generating massive complex networks with hyperbolic geometry faster in practice.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016

Mathematical foundations of the GraphBLAS.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016

Generating Scaled Replicas of Real-World Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

CoRR, 2015

Fast generation of dynamic complex networks with underlying hyperbolic geometry.

[BibT_eX]

[DOI]

CoRR, 2015

n-Level Hypergraph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2015

Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures.

[BibT_eX]

[DOI]

Alexander Noe

Proceedings of the 23rd Euromicro International Conference on Parallel, 2015

Generating Random Hyperbolic Graphs in Subquadratic Time.

[BibT_eX]

[DOI]

Roman Prutkin

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Graphs, Matrices, and the GraphBLAS: Seven Good Reasons.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2015

Fully-Dynamic Approximation of Betweenness Centrality.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Structure-Preserving Sparsification of Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Complex Network Analysis on Distributed Systems: An Empirical Comparison.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Approximating Betweenness Centrality in Large Evolving Networks.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

NetworKit: An Interactive Tool Suite for High-Performance Network Analysis.

[BibT_eX]

[DOI]

Aleksejs Sazonovs

CoRR, 2014

Partitioning Complex Networks via Size-Constrained Clustering.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Detecting communities around seed nodes in complex networks.

[BibT_eX]

[DOI]

Yassine Marrakchi

Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013

PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2013

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2013

Engineering High-Performance Community Detection Heuristics for Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Conference on Parallel Processing, 2013

Topic 12: Theory and Algorithms for Parallel Computation - (Introduction).

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Finding All Convex Cuts of a Plane Graph in Cubic Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning.

[BibT_eX]

[DOI]

Algorithmica, 2012

Scalable Multi-threaded Community Detection in Social Networks.

[BibT_eX]

[DOI]

E. Jason Riedy

David A. Bader

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

Analysis of streaming social networks and graphs on multicore architectures.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Geppino Pucci

Christos D. Zaroliagis

Kieran T. Herley

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Parallel community detection for massive graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

Shape optimizing load balancing for MPI-parallel adaptive numerical simulations.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

Static and Dynamic Aspects of Scientific Collaboration Networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011

Tracking Structure of Streaming Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A distributed diffusive heuristic for clustering a virtual P2P supercomputer.

[BibT_eX]

[DOI]

Joachim Gehweiler

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

On Dynamic Graph Partitioning and Graph Clustering using Diffusion.

[BibT_eX]

[DOI]

Joachim Gehweiler

Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

Realistic Computer Models.

[BibT_eX]

[DOI]

Deepak Ajwani

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

Graph partitioning and disturbed diffusion.

[BibT_eX]

[DOI]

Parallel Comput., 2009

A new diffusion-based multilevel algorithm for computing graph partitions.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2009

Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009

2008

Disturbed diffusive processes for solving partitioning problems on graphs

[BibT_eX]

[DOI]

PhD thesis, 2008

A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2006

Analyzing Disturbed Diffusion on Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A Parallel Shape Optimizing Load Balancer.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005

Constructing higher-order Voronoi diagrams in parallel.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations.

[BibT_eX]

[DOI]