Institute of Theoretical Informatics, Algorithmics
Search
Institute of Theoretical Informatics, Algorithmics
Institute of Theoretical Informatics, Algorithmics
Institute of Theoretical Informatics, Algorithmics
Group Members
Former Members
Michael Hamann, M.Sc.
Publications

Publications

Book chapters

  1. Recent Advances in Scalable Network Generation.
    In: Massive Graph Analytics, Chapman & Hall/CRC Data Science Series. Chapman & Hall/CRC, 2022.
    Joint work with Manuel Penschuck, Ulrik Brandes, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, and Christian Schulz.
  2. On the Persistence of Strongly Embedded Ties.
    In: Cathleen M. Stützer, Martin Welker, and Marc Egger, editors, Computational Social Science in the Age of Big Data: Concepts, Methodologies, Tools, and Applications, volume 15 of Neue Schriften zur Online-Forschung, pages 213–234. Herbert von Halem Verlag, 2018.
    Joint work with Ulrik Brandes, Mark Ortmann, and Dorothea Wagner.
    [ html ]

Journal articles

  1. Applying argumentation to structure and visualize multi-dimensional opinion spaces.
    Argument & Computation, 10(1):23–40, 2019.
    Joint work with Gregor Betz, Tamara Mchedlidze, and Sophie von Schmettow.
    [ html ]
  2. Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
    Algorithms, 12(9):196, 2019.
    Joint work with Lars Gottesbüren, Tim Niklas Uhl, and Dorothea Wagner.
    [ html | pdf ]
  3. Correspondence between Multilevel Graph Partitions and Tree Decompositions.
    Algorithms, 12(9):198, 2019.
    Joint work with Ben Strasser.
    [ html | pdf ]
  4. Two C++ libraries for counting trees on a phylogenetic terrace.
    Bioinformatics, 34(19):3399–3401, 2018.
    Joint work with Rudolf Biczok, Peter Bozsoky, Peter Eisenmann, Johannes Ernst, Tobias Ribizel, Fedor Scholz, Axel Trefzer, Florian Weber, and Alexandros Stamatakis.
    [ html | pdf ]
  5. I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark.
    ACM Journal of Experimental Algorithmics, 23:2.5:1–2.5:33, 2018.
    Joint work with Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner.
    [ html ]
  6. Graph Bisection with Pareto Optimization.
    ACM Journal of Experimental Algorithmics, 23(1):1.2:1–1.2:34, 2018.
    Joint work with Ben Strasser.
    [ html ]
  7. Local Community Detection Based on Small Cliques.
    Algorithms, 10(3):90, 2017.
    Joint work with Eike Röhrs and Dorothea Wagner.
    [ html | pdf ]
  8. Generating realistic scaled complex networks.
    Applied Network Science, 2(1):36, 2017.
    Joint work with Christian Staudt, Alexander Gutfraind, Ilya Safro, and Henning Meyerhenke.
    [ html | pdf ]
  9. Structure-preserving sparsification methods for social networks.
    Social Network Analysis and Mining, 6(1):22:1–22:22, December 2016.
    Joint work with Gerd Lindner, Henning Meyerhenke, Christian Staudt, and Dorothea Wagner.
    [ html ]

Conference articles

  1. Engineering Exact Quasi-Threshold Editing.
    In: Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of Leibniz International Proceedings in Informatics, pages 10:1–10:14, June 2020.
    Joint work with Lars Gottesbüren, Philipp Schoch, Ben Strasser, Dorothea Wagner, and Sven Zühlsdorf.
    [ html | pdf ]
  2. Advanced Flow-Based Multilevel Hypergraph Partitioning.
    In: Proceedings of the 18th International Symposium on Experimental Algorithms (SEA'20), volume 160 of Leibniz International Proceedings in Informatics, pages 11:1–11:15, June 2020.
    Joint work with Lars Gottesbüren, Sebastian Schlag, and Dorothea Wagner.
    [ html | pdf ]
  3. Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
    In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of Leibniz International Proceedings in Informatics, pages 52:1–52:17, September 2019.
    Joint work with Lars Gottesbüren and Dorothea Wagner.
    [ html ]
  4. Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
    In: Proceedings of the 26th Annual European Symposium on Algorithms (ESA'18), Leibniz International Proceedings in Informatics, pages 11:1–11:15, 2018.
    Joint work with Corrie Jacobien Carstens, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner.
    [ html | pdf ]
  5. Distributed Graph Clustering Using Modularity and Map Equation.
    In: Proceedings of the 24th International Conference on Parallel Processing (Euro-Par 2018), volume 11014 of Lecture Notes in Computer Science, pages 688–702. Springer, 2018.
    Joint work with Ben Strasser, Dorothea Wagner, and Tim Zeitz.
    [ html ]
  6. I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
    In: Proceedings of the 19th Meeting on Algorithm Engineering and Experiments (ALENEX'17), pages 58–72. SIAM, 2017.
    Joint work with Ulrich Meyer, Manuel Penschuck, and Dorothea Wagner.
    [ html ]
  7. Benchmark Generator for Dynamic Overlapping Communities in Networks.
    In: Proceedings of the 2017 IEEE International Conference on Data Mining, pages 415–424. IEEE Computer Society, 2017.
    Joint work with Neha Sengupta and Dorothea Wagner.
    [ html | pdf ]
  8. Graph Bisection with Pareto-Optimization.
    In: Proceedings of the 18th Meeting on Algorithm Engineering and Experiments (ALENEX'16), pages 90–102. SIAM, 2016.
    Joint work with Ben Strasser.
  9. Generating Scaled Replicas of Real-World Complex Networks.
    In: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), volume 693 of Studies in Computational Intelligence, pages 17–28. Springer, 2016.
    Joint work with Christian Staudt, Ilya Safro, Alexander Gutfraind, and Henning Meyerhenke.
    [ html ]
  10. Fast Quasi-Threshold Editing.
    In: Proceedings of the 23rd Annual European Symposium on Algorithms (ESA'15), volume 9294 of Lecture Notes in Computer Science, pages 251–262. Springer, 2015.
    Joint work with Ulrik Brandes, Ben Strasser, and Dorothea Wagner.
  11. Structure-Preserving Sparsification of Social Networks.
    In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE, 2015.
    Joint work with Gerd Lindner, Christian Staudt, Henning Meyerhenke, and Dorothea Wagner.
  12. Complete Hierarchical Cut-Clustering: A Case Study on Expansion and Modularity.
    In: Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge, volume 588 of DIMACS Book, pages 157–170. American Mathematical Society, 2013.
    Joint work with Tanja Hartmann and Dorothea Wagner.
    [ html ]
  13. Hierarchies of Predominantly Connected Communities.
    In: Algorithms and Data Structures, 13th International Symposium (WADS'13), volume 8037 of Lecture Notes in Computer Science, pages 365–377. Springer, 2013.
    Full version available at http://arxiv.org/abs/1305.0757.
    Joint work with Tanja Hartmann and Dorothea Wagner.
    [ html ]

Dissertation

  1. Scalable Community Detection.
    PhD thesis, Karlsruhe Institute of Technology, 2021.
    [ html | pdf ]

Master's Thesis

  1. Experiments on Simmelian Backbones for Clustering Social Networks.
    Master's thesis, Department of Informatics, Karlsruhe Institute of Technology (KIT), June 2014.
    [ pdf ]
  2. Complete hierarchical Cut-Clustering: An Analysis of Guarantee and Quality.
    Bachelor's thesis, Department of Informatics, Karlsruhe Institute of Technology (KIT), November 2011.
    [ pdf ]

Technical reports

  1. Engineering Exact Quasi-Threshold Editing.
    Technical report, arXiv, 2020.
    Joint work with Lars Gottesbüren, Philipp Schoch, Ben Strasser, Dorothea Wagner, and Sven Zühlsdorf.
    [ html ]
  2. Advanced Flow-Based Multilevel Hypergraph Partitioning.
    Technical report, arXiv, 2020.
    Joint work with Lars Gottesbüren, Sebastian Schlag, and Dorothea Wagner.
    [ html ]
  3. Recent Advances in Scalable Network Generation.
    Technical report, arXiv, 2020.
    Joint work with Manuel Penschuck, Ulrik Brandes, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, and Christian Schulz.
    [ html ]
  4. Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
    Technical report, arXiv, 2019.
    Joint work with Lars Gottesbüren, Tim Niklas Uhl, and Dorothea Wagner.
    [ html ]
  5. Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
    Technical report, arXiv, 2019.
    Joint work with Lars Gottesbüren and Dorothea Wagner.
    [ html ]
  6. Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
    Technical report, arXiv e-prints, 2018.
    Joint work with Corrie Jacobien Carstens, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner.
    [ html ]
  7. Distributed Graph Clustering using Modularity and Map Equation.
    Technical report, arXiv, 2017.
    arXiv:1710.09605 [cs.DS].
    Joint work with Ben Strasser, Dorothea Wagner, and Tim Zeitz.
    [ html | pdf ]
  8. Structure-Preserving Sparsification Methods for Social Networks.
    Technical report, arXiv e-prints, 2016.
    Joint work with Gerd Lindner, Henning Meyerhenke, Christian Staudt, and Dorothea Wagner.
    [ html ]
  9. I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
    Technical report, arXiv, 2016.
    arXiv:1604.08738v2.
    Joint work with Ulrich Meyer, Manuel Penschuck, and Dorothea Wagner.
    [ html ]
  10. Generating realistic scaled complex networks.
    Technical report, arXiv e-prints, 2016.
    Joint work with Christian Staudt, Alexander Gutfraind, Ilya Safro, and Henning Meyerhenke.
    [ html | pdf ]
  11. Fast Quasi-Threshold Editing.
    Technical report, arXiv e-prints, 2015.
    Joint work with Ulrik Brandes, Ben Strasser, and Dorothea Wagner.
    [ html ]
  12. Graph Bisection with Pareto-Optimization.
    Technical report, ArXiv e-prints, 2015.
    Joint work with Ben Strasser.
    [ html ]
  13. Structure-Preserving Sparsification of Social Networks.
    Technical report, arXiv e-prints, 2015.
    Joint work with Gerd Lindner, Christian Staudt, Henning Meyerhenke, and Dorothea Wagner.
    [ html ]
  14. Hierarchies of Predominantly Connected Communities.
    Technical Report arXiv:1305.0757, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2013.
    Full version of conference paper at WADS'13.
    Joint work with Tanja Hartmann and Dorothea Wagner.
    [ html ]