Michael Hamann
Michael Hamann
Verified email at kit.edu
Cited by
Cited by
Graph Bisection with Pareto Optimization
M Hamann, B Strasser
Journal of Experimental Algorithmics (JEA) 23 (1), 1.2, 2018
Structure-preserving sparsification of social networks
G Lindner, CL Staudt, M Hamann, H Meyerhenke, D Wagner
2015 IEEE/ACM International Conference on Advances in Social Networks …, 2015
Generating Scaled Replicas of Real-World Complex Networks
CL Staudt, M Hamann, I Safro, A Gutfraind, H Meyerhenke
International Workshop on Complex Networks and their Applications, 17-28, 2016
Structure-preserving sparsification methods for social networks
M Hamann, G Lindner, H Meyerhenke, CL Staudt, D Wagner
Social Network Analysis and Mining 6 (1), 22, 2016
I/O-efficient generation of massive graphs following the LFR benchmark
M Hamann, U Meyer, M Penschuck, H Tran, D Wagner
Journal of Experimental Algorithmics (JEA) 23 (2), 2.5, 2018
Generating realistic scaled complex networks
CL Staudt, M Hamann, A Gutfraind, I Safro, H Meyerhenke
Applied Network Science 2 (1), 36, 2017
Fast quasi-threshold editing
U Brandes, M Hamann, B Strasser, D Wagner
Algorithms-ESA 2015, 251-262, 2015
Two C++ libraries for counting trees on a phylogenetic terrace
R Biczok, P Bozsoky, P Eisenmann, J Ernst, T Ribizel, F Scholz, A Trefzer, ...
Bioinformatics 34 (19), 3399-3401, 2018
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
L Gottesbüren, M Hamann, TN Uhl, D Wagner
Algorithms 12 (9), 196, 2019
Benchmark Generator for Dynamic Overlapping Communities in Networks
N Sengupta, M Hamann, D Wagner
2017 IEEE International Conference on Data Mining (ICDM), 415-424, 2017
Simple Distributed Graph Clustering using Modularity and Map Equation
M Hamann, B Strasser, D Wagner, T Zeitz
arXiv preprint arXiv:1710.09605, 2017
Local Community Detection Based on Small Cliques
M Hamann, E Röhrs, D Wagner
Algorithms 10 (3), 90, 2017
Advanced Flow-Based Multilevel Hypergraph Partitioning
L Gottesbüren, M Hamann, S Schlag, D Wagner
18th International Symposium on Experimental Algorithms (SEA 2020) 160, 11:1 …, 2020
Applying argumentation to structure and visualize multi-dimensional opinion spaces
G Betz, M Hamann, T Mchedlidze, S von Schmettow
Argument & Computation 10 (1), 23-40, 2019
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
L Gottesbüren, M Hamann, D Wagner
arXiv preprint arXiv:1907.02053, 2019
Distributed Graph Clustering Using Modularity and Map Equation
M Hamann, B Strasser, D Wagner, T Zeitz
European Conference on Parallel Processing, 688-702, 2018
Complete hierarchical cut-clustering: A case study on expansion and modularity.
M Hamann, T Hartmann, D Wagner
Graph Partitioning and Graph Clustering 588, 157, 2012
Complete Hierarchical Cut-Clustering: An Analysis of Guarantee and Quality
M Hamann
Karlsruhe Institute of Technology, 2011
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
CJ Carstens, M Hamann, U Meyer, M Penschuck, H Tran, D Wagner
arXiv preprint arXiv:1804.08487, 2018
Hierarchies of predominantly connected communities
M Hamann, T Hartmann, D Wagner
Workshop on Algorithms and Data Structures, 365-377, 2013
The system can't perform the operation now. Try again later.
Articles 1–20