J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, A. Lumsdaine, H. Meyerhenke, S. McMillan, C. Yang, J. D. Owens, M. Zalewski, T. G. Mattson, and J. E. Moreira. {M}athematical foundations of the {G}raph{B}LA{S. 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, 2016.

C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke. {G}enerating {S}caled {R}eplicas of {R}eal-{W}orld {C}omplex {N}etworks. 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.

S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz. k-way {H}ypergraph {P}artitioning via n-{L}evel {R}ecursive {B}isection. Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016.

E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016.

A. B. c, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz. {R}ecent {A}dvances in {G}raph {P}artitioning. Algorithm Engineering - Selected Results and Surveys, 2016.

C. L. Staudt and H. Meyerhenke. {E}ngineering {P}arallel {A}lgorithms for {C}ommunity {D}etection in {M}assive {N}etworks. IEEE Trans. Parallel Distrib. Syst., volume 27, issue 1, 2016.

J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke. {A}n empirical comparison of {B}ig {G}raph frameworks in the context of network analysis. Social Netw. Analys. Mining, volume 6, issue 1, 2016.

M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner. {S}tructure-preserving sparsification methods for social networks. Social Netw. Analys. Mining, volume 6, issue 1, 2016.

C. L. Staudt, A. Sazonovs, and H. Meyerhenke. {N}etwor{K}it: {A} tool suite for large-scale complex network analysis. Network Science, volume 4, issue 4, 2016.

R. Glantz, H. Meyerhenke, and C. Schulz. {T}ree-{B}ased {C}oarsening and {P}artitioning of {C}omplex {N}etworks. ACM Journal of Experimental Algorithmics, volume 21, issue 1, 2016.

E. Bergamini and H. Meyerhenke. {A}pproximating {B}etweenness {C}entrality in {F}ully {D}ynamic {N}etworks. Internet Mathematics, volume 12, issue 5, 2016.

H. Meyerhenke, P. Sanders, and C. Schulz. {P}artitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J. Heuristics, volume 22, issue 5, 2016.

C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke. {G}enerating {S}caled {R}eplicas of {R}eal-{W}orld {C}omplex {N}etworks. CoRR, volume 160902121, 2016.

M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke. {B}etter partitions of protein graphs for subsystem quantum chemistry. CoRR, volume 160603427, 2016.

M. von Looz, M. Özdayi, S. Laue, and H. Meyerhenke. {G}enerating massive complex networks with hyperbolic geometry faster in practice. CoRR, volume 160609481, 2016.

J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke. {A}n {E}mpirical {C}omparison of {B}ig {G}raph {F}rameworks in the {C}ontext of {N}etwork {A}nalysis. CoRR, volume 160100289, 2016.

J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, A. Lumsdaine, H. Meyerhenke, S. McMillan, J. E. Moreira, J. D. Owens, C. Yang, M. Zalewski, and T. G. Mattson. M}athematical {F}oundations of the {G}raph{B}LA{S. CoRR, volume 160605790, 2016.

M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner. {S}tructure-{P}reserving {S}parsification {M}ethods for {S}ocial {N}etworks. CoRR, volume 160100286, 2016.

R. Glantz, C. L. Staudt, and H. Meyerhenke. {C}orrespondences between partitions. CoRR, volume 160304788, 2016.

E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke. {E}stimating {C}urrent-{F}low {C}loseness {C}entrality with a {M}ultigrid {L}aplacian {S}olver. CoRR, volume 160702955, 2016.

D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner. {E}ngineering a {C}ombinatorial {L}aplacian {S}olver: {L}essons {L}earned. Algorithms, volume 9, issue 4, 2016.

M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke. {B}etter {P}artitions of {P}rotein {G}raphs for {S}ubsystem {Q}uantum {C}hemistry. Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, 2016.

E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke. {E}stimating {C}urrent-{F}low {C}loseness {C}entrality with a {M}ultigrid {L}aplacian {S}olver. 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016., 2016.

M. von Looz and H. Meyerhenke. {Q}uerying {P}robabilistic {N}eighborhoods in {S}patial {D}ata {S}ets {E}fficiently. Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, 2016.

M. von Looz, M. S. Özdayi, S. Laue, and H. Meyerhenke. {G}enerating 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.