Plain text, RIS, BibTex

2016
J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, et al.
Mathematical foundations of the GraphBLAS
2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, 2016
DOI, RIS, BibTex
C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks
Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30 - December 2, 2016., 2016
DOI, RIS, BibTex
S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016
DOI, RIS, BibTex
E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016
DOI, RIS, BibTex
A. B. c, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz
Recent Advances in Graph Partitioning
Algorithm Engineering - Selected Results and Surveys, 2016
DOI, RIS, BibTex
C. L. Staudt and H. Meyerhenke
Engineering Parallel Algorithms for Community Detection in Massive Networks
IEEE Trans. Parallel Distrib. Syst., 27(1), 2016
DOI, RIS, BibTex
J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke
An empirical comparison of Big Graph frameworks in the context of network analysis
Social Netw. Analys. Mining, 6(1), 2016
DOI, RIS, BibTex
M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner
Structure-preserving sparsification methods for social networks
Social Netw. Analys. Mining, 6(1), 2016
DOI, RIS, BibTex
C. L. Staudt, A. Sazonovs, and H. Meyerhenke
NetworKit: A tool suite for large-scale complex network analysis
Network Science, 4(4), 2016
DOI, RIS, BibTex
R. Glantz, H. Meyerhenke, and C. Schulz
Tree-Based Coarsening and Partitioning of Complex Networks
ACM Journal of Experimental Algorithmics, 21(1), 2016
DOI, RIS, BibTex
E. Bergamini and H. Meyerhenke
Approximating Betweenness Centrality in Fully Dynamic Networks
Internet Mathematics, 12(5), 2016
DOI, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
J. Heuristics, 22(5), 2016
DOI, RIS, BibTex
C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks
CoRR, 160902121, 2016
arXiv eprint, RIS, BibTex
M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke
Better partitions of protein graphs for subsystem quantum chemistry
CoRR, 160603427, 2016
arXiv eprint, RIS, BibTex
M. von Looz, M. Özdayi, S. Laue, and H. Meyerhenke
Generating massive complex networks with hyperbolic geometry faster in practice
CoRR, 160609481, 2016
arXiv eprint, RIS, BibTex
J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke
An Empirical Comparison of Big Graph Frameworks in the Context of Network Analysis
CoRR, 160100289, 2016
arXiv eprint, RIS, BibTex
J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, et al.
Mathematical Foundations of the GraphBLAS
CoRR, 160605790, 2016
arXiv eprint, RIS, BibTex
M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner
Structure-Preserving Sparsification Methods for Social Networks
CoRR, 160100286, 2016
arXiv eprint, RIS, BibTex
R. Glantz, C. L. Staudt, and H. Meyerhenke
Correspondences between partitions
CoRR, 160304788, 2016
arXiv eprint, RIS, BibTex
E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
CoRR, 160702955, 2016
arXiv eprint, RIS, BibTex
D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner
Engineering a Combinatorial Laplacian Solver: Lessons Learned
Algorithms, 9(4), 2016
DOI, RIS, BibTex
M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, 2016
DOI, RIS, BibTex
E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016., 2016
DOI, RIS, BibTex
M. von Looz and H. Meyerhenke
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, 2016
DOI, RIS, BibTex
M. von Looz, M. S. Özdayi, S. Laue, and H. Meyerhenke
Generating massive complex networks with hyperbolic geometry faster in practice
2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, 2016
DOI, RIS, BibTex