| Graph bisection with pareto optimization M Hamann, B Strasser Journal of Experimental Algorithmics (JEA) 23, 1-34, 2018 | 78 | 2018 |
| Structure-preserving sparsification of social networks G Lindner, CL Staudt, M Hamann, H Meyerhenke, D Wagner Proceedings of the 2015 IEEE/ACM International conference on advances in …, 2015 | 56 | 2015 |
| 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 | 47 | 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 | 35 | 2018 |
| 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 | 25 | 2020 |
| Generating realistic scaled complex networks CL Staudt, M Hamann, A Gutfraind, I Safro, H Meyerhenke Applied network science 2, 1-29, 2017 | 24 | 2017 |
| Local Community Detection Based on Small Cliques M Hamann, E Röhrs, D Wagner Algorithms 10 (3), 90, 2017 | 23 | 2017 |
| Fast quasi-threshold editing U Brandes, M Hamann, B Strasser, D Wagner Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 23 | 2015 |
| Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies L Gottesbüren, M Hamann, TN Uhl, D Wagner Algorithms 12 (9), 196, 2019 | 21 | 2019 |
| Generating scaled replicas of real-world complex networks CL Staudt, M Hamann, I Safro, A Gutfraind, H Meyerhenke Complex Networks & Their Applications V: Proceedings of the 5th …, 2017 | 21 | 2017 |
| Recent Advances in Scalable Network Generation M Penschuck, U Brandes, M Hamann, S Lamm, U Meyer, I Safro, ... arXiv preprint arXiv:2003.00736, 2020 | 20 | 2020 |
| Algorithms for large-scale network analysis and the networkit toolkit E Angriman, A van der Grinten, M Hamann, H Meyerhenke, M Penschuck Algorithms for Big Data: DFG Priority Program 1736, 3-20, 2023 | 18 | 2023 |
| 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 | 17 | 2018 |
| Distributed graph clustering using modularity and map equation M Hamann, B Strasser, D Wagner, T Zeitz Euro-Par 2018: Parallel Processing: 24th International Conference on …, 2018 | 16* | 2018 |
| Engineering Exact Quasi-Threshold Editing L Gottesbüren, M Hamann, P Schoch, B Strasser, D Wagner, S Zühlsdorf 18th International Symposium on Experimental Algorithms (SEA 2020) 160, 10:1 …, 2020 | 14 | 2020 |
| 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 | 14 | 2018 |
| Distributed graph clustering using modularity and map equation M Hamann, B Strasser, D Wagner, T Zeitz Euro-Par 2018: Parallel Processing: 24th International Conference on …, 2018 | 13 | 2018 |
| 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 | 13 | 2017 |
| Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm L Gottesbüren, M Hamann, D Wagner arXiv preprint arXiv:1907.02053, 2019 | 12 | 2019 |
| A Branch-And-Bound Algorithm for Cluster Editing T Bläsius, P Fischbeck, L Gottesbüren, M Hamann, T Heuer, J Spinner, ... 20th International Symposium on Experimental Algorithms (SEA 2022), 2022 | 11 | 2022 |
