Student Theses

This is a list of student theses based on our NetworKit tool suite.

  • Michael Wegner: Graphenzeichnen und Distanzgeometrien. Masterarbeit, ongoing.
    Supervisors: H. Meyerhenke, E. Bergamini
  • Maximilian Vogel: Advancing Algorithms and Methodology for Exploratory Network Analysis. Masterarbeit, ongoing.
    Supervisors: C.L. Staudt, G. Schädler (Fak. für Physik), H. Meyerhenke
  • Dominik Kiefer: Fast Maximization of Betweenness and Closeness of a Node. Bachelorarbeit, April 2016.
    Supervisors: E. Bergamini, H. Meyerhenke.
  • Peter Eisenmann: Berechnung kompatibler Pfade in DAGs. Bachelorarbeit, November 2015.
    Supervisors: R. Glantz, H. Meyerhenke
  • Mark Erb: Automatisierte Analyse komplexer Netzwerke. Studienarbeit, October 2015.
    Supervisors: C. Staudt, H. Meyerhenke.
  • Dennis Felsing: Parallele Graphenalgorithmen auf Intel Xeon Phi. Masterarbeit, August 2015.
    Supervisors: M. v. Looz, H. Meyerhenke
  • Patrick Bisenius: Partitioning and Reparatitioning using size-constrained label propagation and NetworKit . Bachelorarbeit, May 2015.
    Supervisors: R. Glantz, H. Meyerhenke
  • Kolja Esders: Link Prediction in Complex Networks. Bachelorarbeit, May 2015.
    Supervisors: E. Bergamini, C. Staudt, H. Meyerhenke.
  • Daniel Hoske: A Fast Combinatorial Solver for Laplacian Matrices. Masterarbeit, December 2014.
    Supervisors: H. Meyerhenke, D. Lukarski
  • Marc Nemes: Extending NetworKit. Bachelorarbeit, December 2014.
    Supervisors: C. Staudt, H. Meyerhenke
  • Gerd Lindner: Complex Network Backbones. Bachelorarbeit, September 2014.
    Supervisors: C. Staudt, M. Hamann, H. Meyerhenke
  • Jannis Koch: Network Analysis on Distributed Systems. Bachelorarbeit, October 2014.
    Supervisors: C. Staudt, H. Meyerhenke
  • Yassine Marrakchi: Selective Community Detection in Complex Networks. Bachelorarbeit, October 2013.
    Supervisors: C. Staudt, H. Meyerhenke.