Michael Hamann

Orcid: 0000-0002-6958-4927

According to our database1, Michael Hamann authored at least 32 papers between 2012 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit.
CoRR, 2022

A Branch-And-Bound Algorithm for Cluster Editing.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Deterministic Parallel Hypergraph Partitioning.
Proceedings of the Euro-Par 2022: Parallel Processing, 2022

Skeleton-Based Clustering by Quasi-Threshold Editing.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.
Proceedings of the Massive Graph Analytics, 2022

2021
Scalable Community Detection.
PhD thesis, 2021

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Recent Advances in Scalable Network Generation.
CoRR, 2020

Advanced Flow-Based Multilevel Hypergraph Partitioning.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Engineering Exact Quasi-Threshold Editing.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019
Applying argumentation to structure and visualize multi-dimensional opinion spaces.
Argument Comput., 2019

Correspondence between Multilevel Graph Partitions and Tree Decompositions.
Algorithms, 2019

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
Algorithms, 2019

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Graph Bisection with Pareto Optimization.
ACM J. Exp. Algorithmics, 2018

I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark.
ACM J. Exp. Algorithmics, 2018

Two C++ libraries for counting trees on a phylogenetic terrace.
Bioinform., 2018

Distributed Graph Clustering Using Modularity and Map Equation.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Simple Distributed Graph Clustering using Modularity and Map Equation.
CoRR, 2017

Generating realistic scaled complex networks.
Appl. Netw. Sci., 2017

Local Community Detection Based on Small Cliques.
Algorithms, 2017

Benchmark Generator for Dynamic Overlapping Communities in Networks.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Structure-preserving sparsification methods for social networks.
Soc. Netw. Anal. Min., 2016

Generating Scaled Replicas of Real-World Complex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
Fast Quasi-Threshold Editing.
Proceedings of the Algorithms - ESA 2015, 2015

Structure-Preserving Sparsification of Social Networks.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2013
Hierarchies of Predominantly Connected Communities.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012
Complete hierarchical cut-clustering: A case study on expansion and modularity.
Proceedings of the Graph Partitioning and Graph Clustering, 2012


  Loading...