![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael Hamann
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c17]Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. Euro-Par 2022: 301-316 - [c16]Thomas Bläsius
, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - [p3]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p2]Eugenio Angriman, Alexander van der Grinten
, Michael Hamann, Henning Meyerhenke
, Manuel Penschuck
:
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. Algorithms for Big Data 2022: 3-20 - [p1]Ulrik Brandes
, Michael Hamann
, Luise Häuser, Dorothea Wagner
:
Skeleton-Based Clustering by Quasi-Threshold Editing. Algorithms for Big Data 2022: 134-151 - [i16]Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR abs/2209.13355 (2022) - 2021
- [b1]Michael Hamann:
Scalable Community Detection. Karlsruhe Institute of Technology, Germany, 2021 - [c15]Thomas Bläsius
, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - [c14]Thomas Bläsius
, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - [i15]Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. CoRR abs/2112.12704 (2021) - 2020
- [c13]Lars Gottesbüren
, Michael Hamann
, Philipp Schoch, Ben Strasser
, Dorothea Wagner
, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. SEA 2020: 10:1-10:14 - [c12]Lars Gottesbüren, Michael Hamann
, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. SEA 2020: 11:1-11:15 - [i14]Manuel Penschuck
, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i13]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. CoRR abs/2003.12110 (2020) - [i12]Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. CoRR abs/2003.14317 (2020)
2010 – 2019
- 2019
- [j9]Lars Gottesbüren
, Michael Hamann
, Tim Niklas Uhl
, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 12(9): 196 (2019) - [j8]Michael Hamann
, Ben Strasser:
Correspondence between Multilevel Graph Partitions and Tree Decompositions. Algorithms 12(9): 198 (2019) - [j7]Gregor Betz, Michael Hamann
, Tamara Mchedlidze
, Sophie von Schmettow:
Applying argumentation to structure and visualize multi-dimensional opinion spaces. Argument Comput. 10(1): 23-40 (2019) - [c11]Lars Gottesbüren
, Michael Hamann
, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. ESA 2019: 52:1-52:17 - [i11]Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. CoRR abs/1906.11811 (2019) - [i10]Lars Gottesbüren, Michael Hamann, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. CoRR abs/1907.02053 (2019) - 2018
- [j6]Rudolf Biczok, Peter Bozsoky, Peter Eisenmann, Johannes Ernst, Tobias Ribizel
, Fedor Scholz, Axel Trefzer, Florian Weber, Michael Hamann
, Alexandros Stamatakis:
Two C++ libraries for counting trees on a phylogenetic terrace. Bioinform. 34(19): 3399-3401 (2018) - [j5]Michael Hamann
, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. ACM J. Exp. Algorithmics 23 (2018) - [j4]Michael Hamann
, Ben Strasser:
Graph Bisection with Pareto Optimization. ACM J. Exp. Algorithmics 23 (2018) - [c10]Corrie Jacobien Carstens, Michael Hamann
, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA 2018: 11:1-11:15 - [c9]Michael Hamann
, Ben Strasser, Dorothea Wagner, Tim Zeitz
:
Distributed Graph Clustering Using Modularity and Map Equation. Euro-Par 2018: 688-702 - [i9]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck
, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR abs/1804.08487 (2018) - 2017
- [j3]Michael Hamann
, Eike Röhrs, Dorothea Wagner:
Local Community Detection Based on Small Cliques. Algorithms 10(3): 90 (2017) - [j2]Christian L. Staudt, Michael Hamann
, Alexander Gutfraind, Ilya Safro
, Henning Meyerhenke
:
Generating realistic scaled complex networks. Appl. Netw. Sci. 2: 36 (2017) - [c8]Michael Hamann
, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX 2017: 58-72 - [c7]Neha Sengupta, Michael Hamann
, Dorothea Wagner:
Benchmark Generator for Dynamic Overlapping Communities in Networks. ICDM 2017: 415-424 - [i8]Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz
:
Simple Distributed Graph Clustering using Modularity and Map Equation. CoRR abs/1710.09605 (2017) - 2016
- [j1]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) - [c6]Michael Hamann
, Ben Strasser:
Graph Bisection with Pareto-Optimization. ALENEX 2016: 90-102 - [c5]Christian L. Staudt, Michael Hamann
, Ilya Safro
, Alexander Gutfraind, Henning Meyerhenke
:
Generating Scaled Replicas of Real-World Complex Networks. COMPLEX NETWORKS 2016: 17-28 - [i7]Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner:
Structure-Preserving Sparsification Methods for Social Networks. CoRR abs/1601.00286 (2016) - [i6]Michael Hamann, Ulrich Meyer, Manuel Penschuck
, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR abs/1604.08738 (2016) - [i5]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
- [c4]Gerd Lindner, Christian L. Staudt, Michael Hamann
, Henning Meyerhenke
, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. ASONAM 2015: 448-454 - [c3]Ulrik Brandes, Michael Hamann
, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. ESA 2015: 251-262 - [i4]Michael Hamann, Ben Strasser:
Graph Bisection with Pareto-Optimization. CoRR abs/1504.03812 (2015) - [i3]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. CoRR abs/1504.07379 (2015) - [i2]Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. CoRR abs/1505.00564 (2015) - 2013
- [c2]Michael Hamann
, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. WADS 2013: 365-377 - [i1]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. CoRR abs/1305.0757 (2013) - 2012
- [c1]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Complete hierarchical cut-clustering: A case study on expansion and modularity. Graph Partitioning and Graph Clustering 2012: 157-170
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint