activity
20132016
most citedEngineering Parallel Algorithms for Community Detection in Massive Networks

160 citations · 170 across the 6 of their papers we have counts for

collaborators

10 papers

cs.SI2016

Generating realistic scaled complex networks

Christian L. Staudt, Michael Hamann, Alexander Gutfraind +2

Research on generative models is a central project in the emerging field of network science, and it studies how statistical patterns found in real networks could be generated by fo…

cs.DM2016

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

Roland Glantz, Henning Meyerhenke

Let and be finite partitions of the set . Finding good correspondences between the parts of and those of is helpful in…

cs.DC2016★ 1 cited

An Empirical Comparison of Big Graph Frameworks in the Context of Network Analysis

Jannis Koch, Christian L. Staudt, Maximilian Vogel +1

Complex networks are relational data sets commonly represented as graphs. The analysis of their intricate structure is relevant to many areas of science and commerce, and data sets…

cs.SI2016

Structure-Preserving Sparsification Methods for Social Networks

Michael Hamann, Gerd Lindner, Henning Meyerhenke +2

Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different conte…

cs.SI2015★ 1 cited

Structure-Preserving Sparsification of Social Networks

Gerd Lindner, Christian L. Staudt, Michael Hamann +2

Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different conte…

math.DG2015

Fully non-linear elliptic equations on compact Hermitian manifolds

Gábor Székelyhidi

We derive a priori estimates for solutions of a general class of fully non-linear equations on compact Hermitian manifolds. Our method is based on ideas that have been used for dif…

cs.SI2014

Approximating Betweenness Centrality in Large Evolving Networks

Elisabetta Bergamini, Henning Meyerhenke, Christian L. Staudt

Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in lar…

cs.SI2014

NetworKit: A Tool Suite for Large-scale Complex Network Analysis

Christian L. Staudt, Aleksejs Sazonovs, Henning Meyerhenke

We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly…

cs.SI2013★ 8 cited

Static and Dynamic Aspects of Scientific Collaboration Networks

Christian Staudt, Andrea Schumm, Henning Meyerhenke +2

Collaboration networks arise when we map the connections between scientists which are formed through joint publications. These networks thus display the social structure of academi…

cs.DC2013★ 160 cited

Engineering Parallel Algorithms for Community Detection in Massive Networks

Christian L. Staudt, Henning Meyerhenke

The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and…