Complete hierarchical cut-clustering: A case study on expansion and modularity. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (Graph Partitioning and Graph Clustering, 2012)

Hierarchies of Predominantly Connected Communities. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (WADS, 2013)

Structure-Preserving Sparsification of Social Networks. - Gerd Lindner; Christian L. Staudt; Michael Hamann; Henning Meyerhenke; Dorothea Wagner (ASONAM, 2015)

Fast Quasi-Threshold Editing. - Ulrik Brandes; Michael Hamann; Ben Strasser; Dorothea Wagner (ESA, 2015)

Generating Scaled Replicas of Real-World Complex Networks. - Christian L. Staudt; Michael Hamann; Ilya Safro; Alexander Gutfraind; Henning Meyerhenke (COMPLEX NETWORKS, 2016)

Structure-preserving sparsification methods for social networks. - Michael Hamann; Gerd Lindner; Henning Meyerhenke; Christian L. Staudt; Dorothea Wagner (Soc. Netw. Anal. Min., 2016)

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Dorothea Wagner (ALENEX, 2017)

Benchmark Generator for Dynamic Overlapping Communities in Networks. - Neha Sengupta; Michael Hamann; Dorothea Wagner (ICDM, 2017)

Local Community Detection Based on Small Cliques. - Michael Hamann; Eike Röhrs; Dorothea Wagner (Algorithms, 2017)

Generating realistic scaled complex networks. - Christian L. Staudt; Michael Hamann; Alexander Gutfraind; Ilya Safro; Henning Meyerhenke (Appl. Netw. Sci., 2017)

Simple Distributed Graph Clustering using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (CoRR, 2017)

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. - Corrie Jacobien Carstens; Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ESA, 2018)

Distributed Graph Clustering Using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (Euro-Par, 2018)

Two C++ libraries for counting trees on a phylogenetic terrace. - Rudolf Biczok; Peter Bozsoky; Peter Eisenmann; Johannes Ernst; Tobias Ribizel; Fedor Scholz; Axel Trefzer; Florian Weber; Michael Hamann; Alexandros Stamatakis (Bioinform., 2018)

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ACM J. Exp. Algorithmics, 2018)

Graph Bisection with Pareto Optimization. - Michael Hamann; Ben Strasser (ACM J. Exp. Algorithmics, 2018)

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. - Lars Gottesbüren; Michael Hamann; Dorothea Wagner (ESA, 2019)

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. - Lars Gottesbüren; Michael Hamann; Tim Niklas Uhl; Dorothea Wagner (Algorithms, 2019)

Correspondence between Multilevel Graph Partitions and Tree Decompositions. - Michael Hamann; Ben Strasser (Algorithms, 2019)

Applying argumentation to structure and visualize multi-dimensional opinion spaces. - Gregor Betz; Michael Hamann; Tamara Mchedlidze; Sophie von Schmettow (Argument Comput., 2019)

Engineering Exact Quasi-Threshold Editing. - Lars Gottesbüren; Michael Hamann; Philipp Schoch; Ben Strasser; Dorothea Wagner; Sven Zühlsdorf (SEA, 2020)

Advanced Flow-Based Multilevel Hypergraph Partitioning. - Lars Gottesbüren; Michael Hamann; Sebastian Schlag; Dorothea Wagner (SEA, 2020)

Recent Advances in Scalable Network Generation. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (CoRR, 2020)

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

Scalable Community Detection. - Michael Hamann (2021)

Recent Advances in Scalable Network Generation1. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (Massive Graph Analytics, 2022)

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. - Eugenio Angriman; Alexander van der Grinten; Michael Hamann; Henning Meyerhenke; Manuel Penschuck (Algorithms for Big Data, 2022)

Skeleton-Based Clustering by Quasi-Threshold Editing. - Ulrik Brandes; Michael Hamann; Luise Häuser; Dorothea Wagner (Algorithms for Big Data, 2022)

Deterministic Parallel Hypergraph Partitioning. - Lars Gottesbüren; Michael Hamann (Euro-Par, 2022)

A Branch-And-Bound Algorithm for Cluster Editing. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (SEA, 2022)

Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. - Eugenio Angriman; Alexander van der Grinten; Michael Hamann; Henning Meyerhenke; Manuel Penschuck (CoRR, 2022)