Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDHenning Meyerhenke
Person information
- affiliation: Humboldt-Universität zu Berlin, Germany
- affiliation (former): University of Cologne, Department of Computer Science, Germany
- affiliation (former): Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
- affiliation (former): University of Paderborn, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c58]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX 2021: 154-168- [i54]Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke:
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR abs/2101.06192 (2021) - 2020
- [j23]Mehmet Simsek, Henning Meyerhenke:
Combined centrality measures for an improved characterization of influence spread in social networks. J. Complex Networks 8(1) (2020) - [j22]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Scaling up network centrality computations - A brief overview. it Inf. Technol. 62(3-4): 189-204 (2020) - [c57]Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. ALENEX 2020: 56-69 - [c56]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA 2020: 6:1-6:24 - [c55]Alexander van der Grinten, Henning Meyerhenke:
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. IPDPS 2020: 527-535 - [c54]Marcelo Fonseca Faraj
, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. SEA 2020: 4:1-4:15 - [i53]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. CoRR abs/2001.07134 (2020) - [i52]Mehmet Simsek, Henning Meyerhenke:
Combined Centrality Measures for an Improved Characterization of Influence Spreadin Social Networks. CoRR abs/2003.05254 (2020) - [i51]Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. CoRR abs/2006.13679 (2020) - [i50]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR abs/2010.15435 (2020) - [i49]Charilaos Tzovas, Maria Predari, Henning Meyerhenke:
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. CoRR abs/2011.01814 (2020)
2010 – 2019
- 2019
- [j21]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12(7): 127 (2019) - [j20]Oskar Taubert, Ines Reinartz, Henning Meyerhenke, Alexander Schug:
diSTruct v1.0: generating biomolecular structures from distance constraints. Bioinform. 35(24): 5337-5338 (2019) - [j19]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - [c53]Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke:
Local Search for Group Closeness Maximization on Big Graphs. IEEE BigData 2019: 711-720 - [c52]Alexander van der Grinten, Henning Meyerhenke:
Scaling up Network Centrality Computations *. DATE 2019: 1319-1324 - [c51]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par 2019: 434-447 - [e2]Stephen G. Kobourov, Henning Meyerhenke:
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. SIAM 2019 [contents] - [i48]Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke:
Parallel Adaptive Sampling with almost no Synchronization. CoRR abs/1903.09422 (2019) - [i47]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics in Network Analysis. CoRR abs/1904.04690 (2019) - [i46]Alexander van der Grinten, Henning Meyerhenke:
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. CoRR abs/1910.11039 (2019) - [i45]Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. CoRR abs/1910.13874 (2019) - [i44]Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke:
Local Search for Group Closeness Maximization on Big Graphs. CoRR abs/1911.03360 (2019) - 2018
- [j18]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018) - [j17]Moritz von Looz, Henning Meyerhenke:
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. ACM J. Exp. Algorithmics 23 (2018) - [j16]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Trans. Vis. Comput. Graph. 24(5): 1814-1827 (2018) - [c50]Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. ALENEX 2018: 21-35 - [c49]Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke:
Scaling up Group Closeness Maximization. ALENEX 2018: 209-222 - [c48]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ESA 2018: 42:1-42:14 - [c47]Roland Glantz, Maria Predari, Henning Meyerhenke:
Topology-induced Enhancement of Mappings. ICPP 2018: 9:1-9:10 - [c46]Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke:
Balanced k-means for Parallel Geometric Partitioning. ICPP 2018: 52:1-52:10 - [c45]Roland Glantz, Henning Meyerhenke:
Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach. SDM 2018: 1-9 - [r2]David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [i43]Moritz von Looz, Henning Meyerhenke:
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. CoRR abs/1802.03297 (2018) - [i42]Roland Glantz, Maria Predari, Henning Meyerhenke:
Topology-induced Enhancement of Mappings. CoRR abs/1804.07131 (2018) - [i41]Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke:
Balanced k-means for Parallel Geometric Partitioning. CoRR abs/1805.01208 (2018) - [i40]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. CoRR abs/1807.03847 (2018) - [i39]Henning Meyerhenke, Richard Peng, Ilya Safro:
High-Performance Graph Algorithms (Dagstuhl Seminar 18241). Dagstuhl Reports 8(6): 19-39 (2018) - 2017
- [j15]Christian L. Staudt, Michael Hamann, Alexander Gutfraind, Ilya Safro, Henning Meyerhenke:
Generating realistic scaled complex networks. Appl. Netw. Sci. 2: 36 (2017) - [j14]Roland Glantz, Henning Meyerhenke:
On finding convex cuts in general, bipartite and plane graphs. Theor. Comput. Sci. 695: 54-73 (2017) - [j13]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. IEEE Trans. Parallel Distributed Syst. 28(9): 2625-2638 (2017) - [c44]Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke:
Maxent-Stress Optimization of 3D Biomolecular Models. ESA 2017: 70:1-70:15 - [c43]Raphael Kimmig, Henning Meyerhenke, Darren Strash:
Shared Memory Parallel Subgraph Enumeration. IPDPS Workshops 2017: 519-529 - [c42]Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. SEA 2017: 23:1-23:16 - [i38]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i37]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - [i36]Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe:
Faster Betweenness Centrality Updates in Evolving Networks. CoRR abs/1704.08592 (2017) - [i35]Raphael Kimmig, Henning Meyerhenke, Darren Strash:
Shared Memory Parallel Subgraph Enumeration. CoRR abs/1705.09358 (2017) - [i34]Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke:
Maxent-Stress Optimization of 3D Biomolecular Models. CoRR abs/1706.06805 (2017) - [i33]Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. CoRR abs/1710.01143 (2017) - [i32]Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke:
Scaling up Group Closeness Maximization. CoRR abs/1710.01144 (2017) - 2016
- [j12]Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner:
Engineering a Combinatorial Laplacian Solver: Lessons Learned. Algorithms 9(4): 72 (2016) - [j11]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J. Heuristics 22(5): 759-782 (2016) - [j10]Elisabetta Bergamini, Henning Meyerhenke:
Approximating Betweenness Centrality in Fully Dynamic Networks. Internet Math. 12(5): 281-314 (2016) - [j9]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. ACM J. Exp. Algorithmics 21(1): 1.6:1-1.6:20 (2016) - [j8]Christian L. Staudt, Aleksejs Sazonovs, Henning Meyerhenke:
NetworKit: A tool suite for large-scale complex network analysis. Netw. Sci. 4(4): 508-530 (2016) - [j7]Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner:
Structure-preserving sparsification methods for social networks. Soc. Netw. Anal. Min. 6(1): 22:1-22:22 (2016) - [j6]Jannis Koch, Christian L. Staudt, Maximilian Vogel, Henning Meyerhenke:
An empirical comparison of Big Graph frameworks in the context of network analysis. Soc. Netw. Anal. Min. 6(1): 84:1-84:20 (2016) - [j5]Christian L. Staudt, Henning Meyerhenke:
Engineering Parallel Algorithms for Community Detection in Massive Networks. IEEE Trans. Parallel Distributed Syst. 27(1): 171-184 (2016) - [c41]Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz:
k-way Hypergraph Partitioning via n-Level Recursive Bisection. ALENEX 2016: 53-67 - [c40]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c39]Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, Henning Meyerhenke:
Generating Scaled Replicas of Real-World Complex Networks. COMPLEX NETWORKS 2016: 17-28 - [c38]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, Carl Yang, John D. Owens, Marcin Zalewski, Timothy G. Mattson, José E. Moreira:
Mathematical foundations of the GraphBLAS. HPEC 2016: 1-9 - [c37]Moritz von Looz, Mustafa Safa Özdayi, Sören Laue, Henning Meyerhenke:
Generating massive complex networks with hyperbolic geometry faster in practice. HPEC 2016: 1-6 - [c36]Moritz von Looz, Henning Meyerhenke:
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. IWOCA 2016: 449-460 - [c35]Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke:
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CSC 2016: 1-12 - [c34]Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke:
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry. SEA 2016: 353-368 - [p1]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. Algorithm Engineering 2016: 117-158 - [i31]Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner:
Structure-Preserving Sparsification Methods for Social Networks. CoRR abs/1601.00286 (2016) - [i30]Jannis Koch, Christian L. Staudt, Maximilian Vogel, Henning Meyerhenke:
An Empirical Comparison of Big Graph Frameworks in the Context of Network Analysis. CoRR abs/1601.00289 (2016) - [i29]Roland Glantz, Christian L. Staudt, Henning Meyerhenke:
Correspondences between partitions. CoRR abs/1603.04788 (2016) - [i28]Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke:
Better partitions of protein graphs for subsystem quantum chemistry. CoRR abs/1606.03427 (2016) - [i27]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José E. Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy G. Mattson:
Mathematical Foundations of the GraphBLAS. CoRR abs/1606.05790 (2016) - [i26]Moritz von Looz, Mustafa Özdayi, Sören Laue, Henning Meyerhenke:
Generating massive complex networks with hyperbolic geometry faster in practice. CoRR abs/1606.09481 (2016) - [i25]Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke:
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CoRR abs/1607.02955 (2016) - [i24]Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, Henning Meyerhenke:
Generating Scaled Replicas of Real-World Complex Networks. CoRR abs/1609.02121 (2016) - 2015
- [c33]Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. ALENEX 2015: 133-146 - [c32]Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. ASONAM 2015: 448-454 - [c31]Jannis Koch, Christian L. Staudt, Maximilian Vogel, Henning Meyerhenke:
Complex Network Analysis on Distributed Systems: An Empirical Comparison. ASONAM 2015: 1169-1176 - [c30]Elisabetta Bergamini, Henning Meyerhenke:
Fully-Dynamic Approximation of Betweenness Centrality. ESA 2015: 155-166 - [c29]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. Graph Drawing 2015: 30-43 - [c28]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. ICCS 2015: 2453-2462 - [c27]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. IPDPS 2015: 1055-1064 - [c26]Moritz von Looz, Henning Meyerhenke, Roman Prutkin:
Generating Random Hyperbolic Graphs in Subquadratic Time. ISAAC 2015: 467-478 - [c25]Roland Glantz, Henning Meyerhenke, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. PDP 2015: 236-243 - [c24]Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner:
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver. SEA 2015: 205-218 - [i23]Moritz von Looz, Christian L. Staudt, Henning Meyerhenke, Roman Prutkin:
Fast generation of dynamic complex networks with underlying hyperbolic geometry. CoRR abs/1501.03545 (2015) - [i22]Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner:
Is Nearly-linear the same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver. CoRR abs/1502.07888 (2015) - [i21]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. CoRR abs/1504.01039 (2015) - [i20]Elisabetta Bergamini, Henning Meyerhenke:
Fully-dynamic Approximation of Betweenness Centrality. CoRR abs/1504.07091 (2015) - [i19]Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. CoRR abs/1505.00564 (2015) - [i18]Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz:
n-Level Hypergraph Partitioning. CoRR abs/1505.00693 (2015) - [i17]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. CoRR abs/1506.04383 (2015) - [i16]Moritz von Looz, Henning Meyerhenke:
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. CoRR abs/1509.01990 (2015) - [i15]Elisabetta Bergamini, Henning Meyerhenke:
Approximating Betweenness Centrality in Fully-dynamic Networks. CoRR abs/1510.07971 (2015) - [i14]Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz:
k-way Hypergraph Partitioning via n-Level Recursive Bisection. CoRR abs/1511.03137 (2015) - 2014
- [c23]Christian Staudt, Yassine Marrakchi, Henning Meyerhenke:
Detecting communities around seed nodes in complex networks. IEEE BigData 2014: 62-69 - [c22]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning Complex Networks via Size-Constrained Clustering. SEA 2014: 351-363 - [c21]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. SEA 2014: 364-375 - [r1]David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining 2014: 73-82 - [i13]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-based Coarsening and Partitioning of Complex Networks. CoRR abs/1402.2782 (2014) - [i12]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning Complex Networks via Size-constrained Clustering. CoRR abs/1402.3281 (2014) - [i11]Christian Staudt, Aleksejs Sazonovs, Henning Meyerhenke:
NetworKit: An Interactive Tool Suite for High-Performance Network Analysis. CoRR abs/1403.3005 (2014) - [i10]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. CoRR abs/1404.4797 (2014) - [i9]Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. CoRR abs/1409.6241 (2014) - [i8]Roland Glantz, Henning Meyerhenke, Alexander Noe:
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures. CoRR abs/1411.0921 (2014) - [i7]Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, Ilya Safro:
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). Dagstuhl Reports 4(11): 40-58 (2014) - 2013
- [j4]Xing Liu, Pushkar R. Pande, Henning Meyerhenke, David A. Bader:
PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly. IEEE Trans. Parallel Distributed Syst. 24(5): 977-986 (2013) - [c20]Roland Glantz, Henning Meyerhenke:
Finding All Convex Cuts of a Plane Graph in Cubic Time. CIAC 2013: 246-263 - [c19]Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas:
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par 2013: 645-646 - [c18]Christian Staudt, Henning Meyerhenke:
Engineering High-Performance Community Detection Heuristics for Massive Graphs. ICPP 2013: 180-189 - [e1]David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner:
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings. Contemporary Mathematics 588, American Mathematical Society 2013, ISBN 978-0-8218-9038-7 [contents] - [i6]Roland Glantz, Henning Meyerhenke:
Finding all Convex Cuts of a Plane Graph in Cubic Time. CoRR abs/1303.4349 (2013) - [i5]Christian Staudt, Henning Meyerhenke:
Engineering High-Performance Community Detection Heuristics for Massive Graphs. CoRR abs/1304.4453 (2013) - [i4]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner:
Static and Dynamic Aspects of Scientific Collaboration Networks. CoRR abs/1306.5268 (2013) - [i3]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. CoRR abs/1311.3144 (2013) - 2012
- [j3]Henning Meyerhenke, Thomas Sauerwald:
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. Algorithmica 64(3): 329-361 (2012) - [c17]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner:
Static and Dynamic Aspects of Scientific Collaboration Networks. ASONAM 2012: 522-526 - [c16]Henning Meyerhenke:
Shape optimizing load balancing for MPI-parallel adaptive numerical simulations. Graph Partitioning and Graph Clustering 2012: 67-82 - [c15]E. Jason Riedy, Henning Meyerhenke, David Ediger, David A. Bader:
Parallel community detection for massive graphs. Graph Partitioning and Graph Clustering 2012: 207-222 - [c14]Geppino Pucci, Christos D. Zaroliagis, Kieran T. Herley, Henning Meyerhenke:
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2012: 674-675 - [c13]E. Jason Riedy, Henning Meyerhenke, David A. Bader, David Ediger, Timothy G. Mattson:
Analysis of streaming social networks and graphs on multicore architectures. ICASSP 2012: 5337-5340 - [c12]E. Jason Riedy, David A. Bader, Henning Meyerhenke:
Scalable Multi-threaded Community Detection in Social Networks. IPDPS Workshops 2012: 1619-1628 - 2011
- [c11]