Publikationen / Publications
A. van der Grinten, G. Custers, D. L. Thanh, and H. Meyerhenke. Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs. CoRR, volume 220208808, 2022. E. Angriman, F. Brandt-Tumescheit, L. Franke, A. van der Grinten, and H. Meyerhenke. Interactive Visualization of Protein RINs using NetworKit in the Cloud. CoRR, volume 220301263, 2022. E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, pages 32-44, 2021. J. Bader, L. Thamsen, S. Kulagina, J. Will, H. Meyerhenke, and O. Kao. Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters. 2021 {IEEE} International Conference on Big Data (Big Data), Orlando, FL, USA, December 15-18, 2021, IEEE, pages 65-75, 2021. M. Predari, C. Tzovas, C. Schulz, and H. Meyerhenke. An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Euro-Par 2021: Parallel Processing - 27th International Conference on Parallel and Distributed Computing, Lisbon, Portugal, September 1-3, 2021, Proceedings, Springer, volume 12820, pages 167-182, 2021. E. Angriman, R. Becker, G. D'Angelo, H. Gilbert, A. van der Grinten, and H. Meyerhenke. Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021, SIAM, 2021. A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke. New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. Proceedings of the 2021 {SIAM} International Conference on Data Mining, {SDM} 2021, Virtual Event, April 29 - May 1, 2021, SIAM, 2021. A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke. New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR, volume 210106192, 2021. E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. CoRR, volume 210413098, 2021. M. Predari, C. Tzovas, C. Schulz, and H. Meyerhenke. An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. CoRR, volume 210702539, 2021. Z. Su, H. Meyerhenke, and J. Kurths. The climatic interdependence of extreme-rainfall events around the globe. CoRR, volume 211103471, 2021. J. Bader, L. Thamsen, S. Kulagina, J. Will, H. Meyerhenke, and O. Kao. Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters. CoRR, volume 211105167, 2021. E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, 2021. U. Leser, M. Hilbrich, C. Draxl, P. Eisert, L. Grunske, P. Hostert, D. Kainmüller, O. Kao, B. Kehr, T. Kehrer, C. Koch, V. Markl, H. Meyerhenke, T. Rabl, A. Reinefeld, K. Reinert, K. Ritter, B. Scheuermann, F. Schintke, N. Schweikardt, and M. Weidlich. The Collaborative Research Center {FONDA}. Datenbank-Spektrum, volume 21, issue 3, 2021. A. van der Grinten and H. Meyerhenke. Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Orleans, LA, USA, May 18-22, 2020, IEEE, 2020. E. Angriman, M. Predari, A. van der Grinten, and H. Meyerhenke. Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, volume 173, 2020. A. van der Grinten, E. Angriman, and H. Meyerhenke. Scaling up network centrality computations - {A} brief overview. it Inf. Technol., volume 62, issue 34, 2020. C. Tzovas, M. Predari, and H. Meyerhenke. Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. 27th {IEEE} International Conference on High Performance Computing, Data, and Analytics, HiPC 2020, Pune, India, December 16-19, 2020, IEEE, 2020. E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke. {G}roup {C}entrality {M}aximization for {L}arge-scale {G}raphs. Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, SIAM, 2020. M. F. Faraj, A. van der Grinten, H. Meyerhenke, J. L. Träff, and C. Schulz. {H}igh-{Q}uality {H}ierarchical {P}rocess {M}apping. CoRR, volume 200107134, 2020. M. Simsek and H. Meyerhenke. {C}ombined {C}entrality {M}easures for an {I}mproved {C}haracterization of {I}nfluence {S}preadin {S}ocial {N}etworks. CoRR, volume 200305254, 2020. E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing top-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. TKDD, volume 13, issue 5, 2019. A. van der Grinten, E. Angriman, and H. Meyerhenke. Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par 2019: Parallel Processing - 25th International Conference on Parallel and Distributed Computing, Göttingen, Germany, August 26-30, 2019, Proceedings, Springer, volume 11725, 2019. S. G. Kobourov and H. Meyerhenke. Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, {ALENEX} 2019, San Diego, CA, USA, January 7-8, 2019. SIAM, 2019. E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas. {G}uidelines for {E}xperimental {A}lgorithmics: {A} Case {S}tudy in {N}etwork {A}nalysis. Algorithms, volume 12, issue 7, 2019. O. Taubert, I. Reinartz, H. Meyerhenke, and A. Schug. di{S}Truct v1.0: generating biomolecular structures from distance constraints. Bioinform., volume 35, issue 24, 2019. E. Angriman, A. van der Grinten, and H. Meyerhenke. {L}ocal {S}earch for {G}roup {C}loseness {M}aximization on {B}ig {G}raphs. 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, December 9-12, 2019, IEEE, 2019. A. van der Grinten and H. Meyerhenke. {S}caling up {N}etwork {C}entrality {C}omputations. Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, March 25-29, 2019, IEEE, 2019. A. van der Grinten, E. Angriman, and H. Meyerhenke. Parallel Adaptive Sampling with almost no Synchronization. CoRR, volume 190309422, 2019. E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas. Guidelines for Experimental Algorithmics in Network Analysis. CoRR, volume 190404690, 2019. A. van der Grinten and H. Meyerhenke. Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. CoRR, volume 191011039, 2019. E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke. Group Centrality Maximization for Large-scale Graphs. CoRR, volume 191013874, 2019. D. A. Bader, A. Kappes, H. Meyerhenke, P. Sanders, C. Schulz, and D. Wagner. Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining, 2nd Edition, Springer, 2018. P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018. H. Meyerhenke, M. Nöllenburg, and C. Schulz. {D}rawing {L}arge {G}raphs by {M}ultilevel {M}axent-{S}tress {O}ptimization. IEEE Trans. Vis. Comput. Graph., volume 24, issue 5, 2018. M. von Looz and H. Meyerhenke. {U}pdating {D}ynamic {R}andom {H}yperbolic {G}raphs in {S}ublinear {T}ime. ACM Journal of Experimental Algorithmics, volume 23, 2018. E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj. {I}mproving the {B}etweenness {C}entrality of a {N}ode by {A}dding {L}inks. ACM Journal of Experimental Algorithmics, volume 23, 2018. H. Meyerhenke, R. Peng, and I. Safro. {H}igh-{P}erformance {G}raph {A}lgorithms ({D}agstuhl {S}eminar 18241). Dagstuhl Reports, volume 8, issue 6, 2018. A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke. {S}calable {K}atz {R}anking {C}omputation in {L}arge {S}tatic and {D}ynamic {G}raphs. CoRR, volume 180703847, 2018. M. von Looz, C. Tzovas, and H. Meyerhenke. {B}alanced k-means for {P}arallel {G}eometric {P}artitioning. CoRR, volume 180501208, 2018. R. Glantz, M. Predari, and H. Meyerhenke. {T}opology-induced {E}nhancement of {M}appings. CoRR, volume 180407131, 2018. M. von Looz and H. Meyerhenke. {U}pdating {D}ynamic {R}andom {H}yperbolic {G}raphs in {S}ublinear {T}ime. CoRR, volume 180203297, 2018. R. Glantz and H. Meyerhenke. {M}any-to-many {C}orrespondences between {P}artitions: {I}ntroducing a {C}ut-based {A}pproach. Proceedings of the 2018 SIAM International Conference on Data Mining, SDM 2018, May 3-5, 2018, San Diego Marriott Mission Valley, San Diego, CA, USA., 2018. M. von Looz, C. Tzovas, and H. Meyerhenke. {B}alanced k-means for {P}arallel {G}eometric {P}artitioning. Proceedings of the 47th International Conference on Parallel Processing, ICPP 2018, Eugene, OR, USA, August 13-16, 2018, 2018. R. Glantz, M. Predari, and H. Meyerhenke. {T}opology-induced {E}nhancement of {M}appings. Proceedings of the 47th International Conference on Parallel Processing, ICPP 2018, Eugene, OR, USA, August 13-16, 2018, 2018. A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke. {S}calable {K}atz {R}anking {C}omputation in {L}arge {S}tatic and {D}ynamic {G}raphs. 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018. E. Bergamini, T. Gonser, and H. Meyerhenke. {S}caling up {G}roup {C}loseness {M}aximization. Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018. H. Meyerhenke, P. Sanders, and C. Schulz. {P}arallel {G}raph {P}artitioning for {C}omplex {N}etworks. IEEE Trans. Parallel Distrib. Syst., volume 28, issue 9, 2017. R. Glantz and H. Meyerhenke. {O}n finding convex cuts in general, bipartite and plane graphs. Theor. Comput. Sci., volume 695, 2017. M. Wegner, O. Taubert, A. Schug, and H. Meyerhenke. {M}axent-{S}tress {O}ptimization of 3{D} Biomolecular {M}odels. CoRR, volume 170606805, 2017. R. Kimmig, H. Meyerhenke, and D. Strash. {S}hared {M}emory {P}arallel {S}ubgraph {E}numeration. CoRR, volume 170509358, 2017. E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe. {F}aster {B}etweenness {C}entrality {U}pdates in {E}volving {N}etworks. CoRR, volume 170408592, 2017. E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj. {I}mproving the betweenness centrality of a node by adding links. CoRR, volume 170205284, 2017. E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing top-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. CoRR, volume 170401077, 2017. E. Bergamini, T. Gonser, and H. Meyerhenke. {S}caling up {G}roup {C}loseness {M}aximization. CoRR, volume 171001144, 2017. P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. CoRR, volume 171001143, 2017. C. L. Staudt, M. Hamann, A. Gutfraind, I. Safro, and H. Meyerhenke. {G}enerating realistic scaled complex networks. Applied Network Science, volume 2, 2017. E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe. {F}aster {B}etweenness {C}entrality {U}pdates in {E}volving {N}etworks. 16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, 2017. R. Kimmig, H. Meyerhenke, and D. Strash. {S}hared {M}emory {P}arallel {S}ubgraph {E}numeration. 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2017, Orlando / Buena Vista, FL, USA, May 29 - June 2, 2017, 2017. M. Wegner, O. Taubert, A. Schug, and H. Meyerhenke. {M}axent-{S}tress {O}ptimization of 3{D} Biomolecular {M}odels. 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017. 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. J. Kepner, D. A. Bader, A. B. c, J. R. Gilbert, T. G. Mattson, and H. Meyerhenke. {G}raphs, {M}atrices, and the {G}raph{B}LA{S}: {S}even {G}ood {R}easons. Proceedings of the International Conference on Computational Science, ICCS 2015, Computational Science at the Gates of Nature, Reykjavik, Iceland, 1-3 June, 2015, 2014, 2015. 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. CoRR, volume 151103137, 2015. H. Meyerhenke, M. Nöllenburg, and C. Schulz. {D}rawing {L}arge {G}raphs by {M}ultilevel {M}axent-{S}tress {O}ptimization. CoRR, volume 150604383, 2015. M. von Looz, C. L. Staudt, H. Meyerhenke, and R. Prutkin. {F}ast generation of dynamic complex networks with underlying hyperbolic geometry. CoRR, volume 150103545, 2015. M. von Looz and H. Meyerhenke. {Q}uerying {P}robabilistic {N}eighborhoods in {S}patial {D}ata {S}ets {E}fficiently. CoRR, volume 150901990, 2015. G. Lindner, C. L. Staudt, M. Hamann, H. Meyerhenke, and D. Wagner. {S}tructure-{P}reserving {S}parsification of {S}ocial {N}etworks. CoRR, volume 150500564, 2015. J. Kepner, D. A. Bader, A. B. c, J. R. Gilbert, T. G. Mattson, and H. Meyerhenke. {G}raphs, {M}atrices, and the {G}raph{B}LA{S}: {S}even {G}ood {R}easons. CoRR, volume 150401039, 2015. D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner. {I}s {N}early-linear the same in {T}heory and {P}ractice? {A} Case {S}tudy with a {C}ombinatorial {L}aplacian {S}olver. CoRR, volume 150207888, 2015. V. Henne, H. Meyerhenke, P. Sanders, S. Schlag, and C. Schulz. n-{L}evel {H}ypergraph {P}artitioning. CoRR, volume 150500693, 2015. E. Bergamini and H. Meyerhenke. {A}pproximating {B}etweenness {C}entrality in {F}ully-dynamic {N}etworks. CoRR, volume 151007971, 2015. E. Bergamini and H. Meyerhenke. {F}ully-dynamic {A}pproximation of {B}etweenness {C}entrality. CoRR, volume 150407091, 2015. D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner. {I}s {N}early-linear the {S}ame in {T}heory and {P}ractice? {A} Case {S}tudy with a {C}ombinatorial {L}aplacian {S}olver. Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings, 2015. R. Glantz, H. Meyerhenke, and A. Noe. {A}lgorithms for {M}apping {P}arallel {P}rocesses onto {G}rid and {T}orus {A}rchitectures. 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2015, Turku, Finland, March 4-6, 2015, 2015. M. von Looz, H. Meyerhenke, and R. Prutkin. {G}enerating {R}andom {H}yperbolic {G}raphs in {S}ubquadratic {T}ime. Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, 2015. H. Meyerhenke, P. Sanders, and C. Schulz. {P}arallel {G}raph {P}artitioning for {C}omplex {N}etworks. 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 2015. H. Meyerhenke, M. Nöllenburg, and C. Schulz. {D}rawing {L}arge {G}raphs by {M}ultilevel {M}axent-{S}tress {O}ptimization. Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, 2015. E. Bergamini and H. Meyerhenke. {F}ully-{D}ynamic {A}pproximation of {B}etweenness {C}entrality. Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 2015. G. Lindner, C. L. Staudt, M. Hamann, H. Meyerhenke, and D. Wagner. {S}tructure-{P}reserving {S}parsification of {S}ocial {N}etworks. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25 - 28, 2015, 2015. J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke. {C}omplex {N}etwork {A}nalysis on {D}istributed {S}ystems: {A}n {E}mpirical {C}omparison. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25 - 28, 2015, 2015. E. Bergamini, H. Meyerhenke, and C. Staudt. {A}pproximating {B}etweenness {C}entrality in {L}arge {E}volving {N}etworks. Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, 2015. D. A. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes, and D. Wagner. {B}enchmarking for {G}raph {C}lustering and {P}artitioning. Encyclopedia of Social Network Analysis and Mining, 2014. U. C. Meyer, H. Meyerhenke, A. Pinar, and I. Safro. {H}igh-performance {G}raph {A}lgorithms and {A}pplications in {C}omputational {S}cience ({D}agstuhl {S}eminar 14461). Dagstuhl Reports, volume 4, issue 11, 2014. C. Staudt, A. Sazonovs, and H. Meyerhenke. {N}etwor{K}it: {A}n {I}nteractive {T}ool {S}uite for {H}igh-{P}erformance {N}etwork {A}nalysis. CoRR, volume 14033005, 2014. H. Meyerhenke, P. Sanders, and C. Schulz. {P}arallel {G}raph {P}artitioning for {C}omplex {N}etworks. CoRR, volume 14044797, 2014. H. Meyerhenke, P. Sanders, and C. Schulz. {P}artitioning {C}omplex {N}etworks via {S}ize-constrained {C}lustering. CoRR, volume 14023281, 2014. R. Glantz, H. Meyerhenke, and C. Schulz. {T}ree-based {C}oarsening and {P}artitioning of {C}omplex {N}etworks. CoRR, volume 14022782, 2014. R. Glantz, H. Meyerhenke, and A. Noe. {A}lgorithms for {M}apping {P}arallel {P}rocesses onto {G}rid and {T}orus {A}rchitectures. CoRR, volume 14110921, 2014. E. Bergamini, H. Meyerhenke, and C. Staudt. {A}pproximating {B}etweenness {C}entrality in {L}arge {E}volving {N}etworks. CoRR, volume 14096241, 2014. H. Meyerhenke, P. Sanders, and C. Schulz. {P}artitioning {C}omplex {N}etworks via {S}ize-{C}onstrained {C}lustering. Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, 2014. R. Glantz, H. Meyerhenke, and C. Schulz. {T}ree-{B}ased {C}oarsening and {P}artitioning of {C}omplex {N}etworks. Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, 2014. C. Staudt, Y. Marrakchi, and H. Meyerhenke. {D}etecting communities around seed nodes in complex networks. 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30, 2014, 2014. D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner. {G}raph {P}artitioning and {G}raph {C}lustering, 10th {D}IM{A}CS {I}mplementation {C}hallenge {W}orkshop, {G}eorgia {I}nstitute of {T}echnology, {A}tlanta, {G}A, {U}SA, {F}ebruary 13-14, 2012. {P}roceedings. American Mathematical Society, volume 588, 2013. X. Liu, P. R. Pande, H. Meyerhenke, and D. A. Bader. P{A}SQ{U}AL: {P}arallel {T}echniques for {N}ext {G}eneration {G}enome {S}equence {A}ssembly. IEEE Trans. Parallel Distrib. Syst., volume 24, issue 5, 2013. C. Staudt, A. Schumm, H. Meyerhenke, R. Görke, and D. Wagner. {S}tatic and {D}ynamic {A}spects of {S}cientific {C}ollaboration {N}etworks. CoRR, volume 13065268, 2013. A. B. c, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz. {R}ecent {A}dvances in {G}raph {P}artitioning. CoRR, volume 13113144, 2013. C. Staudt and H. Meyerhenke. {E}ngineering {H}igh-{P}erformance {C}ommunity {D}etection {H}euristics for {M}assive {G}raphs. CoRR, volume 13044453, 2013. R. Glantz and H. Meyerhenke. {F}inding all {C}onvex {C}uts of a {P}lane {G}raph in {C}ubic {T}ime. CoRR, volume 13034349, 2013. C. Staudt and H. Meyerhenke. {E}ngineering {H}igh-{P}erformance {C}ommunity {D}etection {H}euristics for {M}assive {G}raphs. 42nd International Conference on Parallel Processing, ICPP 2013, Lyon, France, October 1-4, 2013, 2013. G. F. Italiano, H. Meyerhenke, G. E. Blelloch, and P. Tsigas. {T}opic 12: {T}heory and {A}lgorithms for {P}arallel {C}omputation - ({I}ntroduction). Euro-Par 2013 Parallel Processing - 19th International Conference, Aachen, Germany, August 26-30, 2013. Proceedings, 2013. R. Glantz and H. Meyerhenke. {F}inding {A}ll {C}onvex {C}uts of a {P}lane {G}raph in {C}ubic {T}ime. Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, 2013. E. J. Riedy, D. A. Bader, and H. Meyerhenke. {S}calable {M}ulti-threaded {C}ommunity {D}etection in {S}ocial {N}etworks. 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, IPDPS 2012, Shanghai, China, May 21-25, 2012, 2012. H. Meyerhenke and T. Sauerwald. {B}eyond {G}ood {P}artition {S}hapes: {A}n {A}nalysis of {D}iffusive {G}raph {P}artitioning. Algorithmica, volume 64, issue 3, 2012. E. J. Riedy, H. Meyerhenke, D. A. Bader, D. Ediger, and T. G. Mattson. {A}nalysis of streaming social networks and graphs on multicore architectures. 2012 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2012, Kyoto, Japan, March 25-30, 2012, 2012. G. Pucci, C. D. Zaroliagis, K. T. Herley, and H. Meyerhenke. {T}opic 12: {T}heory and {A}lgorithms for {P}arallel {C}omputation. Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 2012. E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader. {P}arallel community detection for massive graphs. Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings, 2012. H. Meyerhenke. {S}hape optimizing load balancing for {M}PI-parallel adaptive numerical simulations. Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings, 2012. C. Staudt, A. Schumm, H. Meyerhenke, R. Görke, and D. Wagner. {S}tatic and {D}ynamic {A}spects of {S}cientific {C}ollaboration {N}etworks. International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012, Istanbul, Turkey, 26-29 August 2012, 2012. E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader. {P}arallel {C}ommunity {D}etection for {M}assive {G}raphs. Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part I, 2011. D. Ediger, E. J. Riedy, D. A. Bader, and H. Meyerhenke. {T}racking {S}tructure of {S}treaming {S}ocial {N}etworks. 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings, 2011. H. Meyerhenke. {B}eyond {G}ood {S}hapes: {D}iffusion-{B}ased {G}raph {P}artitioning {I}s {R}elaxed {C}ut {O}ptimization. Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, 2010. J. Gehweiler and H. Meyerhenke. {A} distributed diffusive heuristic for clustering a virtual {P}2P supercomputer. 24th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19-23 April 2010 - Workshop Proceedings, 2010. H. Meyerhenke and J. Gehweiler. {O}n {D}ynamic {G}raph {P}artitioning and {G}raph {C}lustering using {D}iffusion. Algorithm Engineering, 27.06. - 02.07.2010, 2010. D. Ajwani and H. Meyerhenke. {R}ealistic {C}omputer {M}odels. Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010. H. Meyerhenke, B. Monien, and S. Schamberger. {G}raph partitioning and disturbed diffusion. Parallel Computing, volume 35, issue 1011, 2009. H. Meyerhenke, B. Monien, and T. Sauerwald. {A} new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distrib. Comput., volume 69, issue 9, 2009. H. Meyerhenke. {D}ynamic {L}oad {B}alancing for {P}arallel {N}umerical {S}imulations {B}ased on {R}epartitioning with {D}isturbed {D}iffusion. 15th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2009, Shenzhen, China, December 8-11, 2009, 2009. H. Meyerhenke, B. Monien, and T. Sauerwald. {A} new diffusion-based multilevel algorithm for computing graph partitions of very high quality. 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, 2008. H. Meyerhenke and T. Sauerwald. {A}nalyzing {D}isturbed {D}iffusion on {N}etworks. Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, 2006. H. Meyerhenke, B. Monien, and S. Schamberger. {A}ccelerating shape optimizing load balancing for parallel {F}EM simulations by algebraic multigrid. 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006. H. Meyerhenke and S. Schamberger. {A} Parallel {S}hape {O}ptimizing {L}oad {B}alancer. Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, 2006. H. Meyerhenke. {C}onstructing higher-order {V}oronoi diagrams in parallel. (Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, 2005. H. Meyerhenke and S. Schamberger. {B}alancing {P}arallel {A}daptive {F}EM {C}omputations by {S}olving {S}ystems of {L}inear {E}quations. Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, 2005.