Publications

Book chapters

  1. Clustering Evolving Networks.
    In: Algorithm Engineering - Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 280-329. Springer, 2016.
    Joint work with Tanja Hartmann and Andrea Kappes and Dorothea Wagner.
    [ html ]
  2. Benchmarking for graph clustering and partitioning.
    In: Encyclopedia of Social Network Analysis and Mining, pages 73-82. Springer, 2013.
    Joint work with David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, and Andrea Kappes, and Dorothea Wagner.

Journal articles

  1. Experiments on Density-Constrained Graph Clustering.
    ACM Journal of Experimental Algorithmics, 19:1.6:1.1-1.6:1.31, September 2014.
    Joint work with Robert Görke and Andrea Kappes and Dorothea Wagner.
    [ html ]
  2. Dynamic Graph Clustering Combining Modularity and Smoothness.
    ACM Journal of Experimental Algorithmics, 18(1):1.5:1.1-1.5:1.29, April 2013.
    Joint work with Robert Görke, Pascal Maillard, Christian Staudt, and Dorothea Wagner.
    [ html ]
  3. Identifikation von Clustern in Graphen.
    Informatik Spektrum, 36(2):144-152, 2013.
    Joint work with Tanja Hartmann and Andrea Kappes and Dorothea Wagner.
    [ html ]
  4. The Shortcut Problem - Complexity and Algorithms.
    Journal of Graph Algorithms and Applications, 16(2):447-481, 2012.
    Joint work with Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, and Dorothea Wagner.
    [ html ]

Conference articles

  1. Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
    In: Proceedings of the 2015 SIAM International Conference on Data Mining, pages 100-108. SIAM, 2015.
    Joint work with Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, and Tanja Hartmann, and Dorothea Wagner.
    [ html ]
  2. Graph Clustering with Surprise: Complexity and Exact Solutions.
    In: Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'14), volume 8327 of Lecture Notes in Computer Science, pages 223-234. Springer, 2014.
    Joint work with Tobias Fleck and Andrea Kappes and Dorothea Wagner.
  3. An Efficient Generator for Clustered Dynamic Random Networks.
    In: Proceedings of the 1st Mediterranean Conference on Algorithms, pages 219-233. Springer, 2012.
    Joint work with Robert Görke, Roland Kluge, Christian Staudt, and Dorothea Wagner.
  4. Experiments on Density-Constrained Graph Clustering.
    In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12), pages 1-15. SIAM, 2012.
    Joint work with Robert Görke and Dorothea Wagner.
    [ html | pdf ]
  5. Static and Dynamic Aspects of Scientific Collaboration Networks.
    In: Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pages 522-526. IEEE Computer Society, 2012.
    Joint work with Christian Staudt, Henning Meyerhenke, Robert Görke, and Dorothea Wagner.
  6. Density-Constrained Graph Clustering.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of Lecture Notes in Computer Science, pages 679-690. Springer, 2011.
    Joint work with Robert Görke and Dorothea Wagner.
    [ html ]

Dissertation

  1. Engineering Graph Clustering Algorithms.
    PhD thesis, Fakultät für Informatik, Karlsruher Institut für Technologie (KIT), 2015.
    [ html ]

Master's Thesis

  1. Heuristic Algorithms for the Shortcut Problem.
    Master's thesis, Karlsruhe Institute of Technology (KIT), July 2009.
    [ pdf ]

Technical reports

  1. Clustering Evolving Networks.
    Technical Report arXiv:1401.3516, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2014.
    To appear in LNCS Volume on Algorithm Engineering, Lasse Kliemann and Peter Sanders (eds.).
    Joint work with Tanja Hartmann and Andrea Kappes and Dorothea Wagner.
    [ html ]
  2. Graph Clustering with Surprise: Complexity and Exact Solutions.
    Technical Report arXiv:1310.60, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2013.
    Joint work with Tobias Fleck and Andrea Kappes and Dorothea Wagner.
    [ html ]
  3. An Efficient Generator for Clustered Dynamic Random Networks.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2012.
    Karlsruhe Reports in Informatics 2012,17.
    Joint work with Robert Görke, Roland Kluge, Christian Staudt, and Dorothea Wagner.
    [ html | pdf ]
  4. Static and Dynamic Aspects of Scientific Collaboration Networks.
    Technical Report 2012-11, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2012.
    Joint work with Christian Staudt, Henning Meyerhenke, Robert Görke, and Dorothea Wagner.
    [ html ]
  5. Dynamic Graph Clustering Combining Modularity and Smoothness.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Karlsruhe Reports in Informatics 2011-11 (and invitational submission to a Special Issue of the ACM Journal on Experimental Algorithmics).
    Joint work with Robert Görke, Pascal Maillard, Christian Staudt, and Dorothea Wagner.
    [ html | pdf ]
  6. Density-Constrained Graph Clustering.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Karlsruhe Reports in Informatics 2011-17.
    Joint work with Robert Görke and Dorothea Wagner.
    [ html | pdf ]
  7. The Shortcut Problem - Complexity and Algorithms .
    Technical Report 2010-17, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2010.
    Joint work with Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, and Dorothea Wagner.
    [ html ]