External Links

Teaching

Lectures and Seminars:

Stockholm University

Lectures
Algorithm and Data Structures (WS 23/23)
Algorithm and Complexity (WS 20/21, SS 21, 22, 23)
Computational Biology (WS 21/22, 22/23, 23/24)
BSc Coordinator (DA6007 - Datalogi) (since 2021)


University of Leeds

Lectures
Computer Processors (WS 19/20)

Seminars
Algorithms and Data Structures I (SS 20)


University of Greifswald

Lectures
Combinatorics (SS 19)
Efficient Algorithms and Data Structures (WS 18/19, 19/20)
Graph Theory (WS 17/18, 19/20)
Discrete Optimization (WS 15/16, 16/17, SS 18)
Bioinformatics (SS 15, 16, 17)
Software Engineering (SS 18)

Seminars
FUN with Algorithms (WS 18/19)
Mathematical Phylogeny (SS 17)
Products of Graphs and Hypergraphs (SS 16, 19)


Saarland University

Lectures
Discrete Comput. Biology (WS 11/12, 12/13, 13/14, 14/15)
Bioinformatics Lecture Series (WS 11/12, 12/13, 13/14, 14/15)

Seminars
Efficient Algorithms for RNA molecules (SS 11, 12, WS 11/12)
Bioinf. Approaches for Cancer Research (SS 11, 12, WS 11/12)
Selected Topics in Molecular Docking (SS 11, 12)
Modelling and Analyzing Biological Networks (SS 12)


University of Leipzig

Lectures
Phenotypespace and Approximate Graph Products
Mathematics in Bioinformatics (WS 07/08, 08/09)
Graph Theory (SS 07, 08)

Seminars
Algorithms and Data Structures (WS 08/09, 10/11)


Supervision of Students

Current Students:

  1. Carsten R. Seemann (PhD CompSci) Median Graphs
  2. Anna Lindeberg (PhD Math) Explicit Modular Decomposition

Former Students:

PhD Thesis
  1. David Schaller (PhD - with highest honor)
    Gene Family Histories: Theory and Algorithms
    (supervision together with P.F.Stadler)
    22. Oct. 2021
  2. Nikolai Nøjgaard (PhD - with highest honor)
    Graph Theoretical Problems in the Life Sciences
    (cotutelle with Southern Denmark University; Daniel Merkle)
    17. July 2020
  3. Nicolas Wiesecke (PhD - with highest honor)
    From Homologous Genes to Phylogenetic Species Trees
    (supervision together with Martin Middendorf)
    01. Sept. 2017
MSc and Diploma Thesis
  1. Anna Lindeberg (MSc Mathematics)
    The Structure of Primitive Edge-Colored Graphs: A Galled Tree Perspective
    02. Aug. 2023
    [work has been extended and published as a joint paper]
  2. Svenja Fischer (MSc Biomathematics)
    About a generalization of median graphs
    15. Jan. 2023
  3. Linda Knuever (MSc Biomathematics)
    On balance of phylogenetic networks
    09. March 2021
    [work has been extended and published as a joint paper]
  4. Carmen Bruckmann (MSc Biomathematics)
    Median graph-Like Relations
    23. Aug. 2019
    [work has been extended and published as a joint paper]
  5. Carsten Seemann (MSc Mathematics)
    Generalized Fitch Graphs
    24. Aug. 2018
    [work has been extended and published as a joint paper]
  6. Anne Schuetz (MSc Biomathematics)
    Spanning Tree Based Edge-Vitality of Graphs
    20. Aug. 2018
  7. Sebastian Brinkop (MSc Biomathematics)
    Local Factorization Algorithms for Strong Products of Directed Graphs
    28. May 2018
  8. Paul Klemm (MSc Mathematics)
    How Much Information is Provided by Induced P4's for the Characterization of Orthology Data?
    23. Feb. 2018
  9. John Anders (MSc Bioinformatics - Co-supervision with P.F. Stadler)
    Fitch's Xenology Relation
    26. June 2017
    [work has been extended and published as a joint paper]
  10. Sebastian Luersen (MSc Mathematics)
    Approximate Cartesian Products of Digraphs
    26. Aug. 2016
  11. Maria Hartmann (MSc Mathematics)
    Design of Methods to Align NMR-Spectra
    13. June 2016
  12. Kevin Gitzhofer (MSc Bioinformatics)
    Heuristic approaches for the reconstruction of minimally resolved phylogenetic trees
    31. Aug. 2015
  13. Adrian Fritz (MSc Bioinformatics)
    A Heuristic for Cograph-Editing
    30. June 2015
    [work has been extended and published as a joint paper]
  14. Tilen Marc (MSc Mathematics)
    Infinite median graphs - Co-supervision with Sandi Klavzar
    15. Aug. 2014
  15. Manuel Noll (MSc Computer Science)
    On Several Strong Hypergraph Products - Existence and Computation of Unique Prime Factor Decomposition
    02. Dec. 2013
    [work has been extended and published as a joint paper]
  16. Lydia Gringmann (Diplom Mathematics)
    Hypergraph Products
    08. Feb. 2010
    [work has been extended and published as a joint paper]
BSc Thesis
  1. Anton Alfonsson (BSc CompSci)
    Isomorphism testing of level-1 networks in linear time using the AHU algorithm
    29. Aug. 2024
  2. Timothy Lindquist Marongiu (BSc CompSci)
    Cograph editing through rooted triple consistency heuristics
    29. Aug. 2024
  3. Tom Alexander Hessler (BSc CompSci)
    Heuristic vs. ILP: Destroying forbidden subgraphs. An application to GaTEx Graphs
    29. Aug. 2024
  4. Emanuel Berggren (BSc CompSci)
    Graph coloring using modular decomposition
    01. Aug. 2023
  5. Oliver Tryding (BSc CompSci)
    Python algorithms for hardwired clustering systems
    22. May 2022
  6. Daniel Westerlund (BSc CompSci)
    Designing and Implementing a Median Graph-Generating Algorithm through Convex Expansion
    22. May 2022
  7. Fredrik Eklind (BSc CompSci)
    Generating Level-k Phylogenetic Networks
    22. May 2022
  8. Mohammed Habib (BSc Math)
    Later-Divergence-Time Graphs
    27. Aug. 2021
  9. Nicolai Moerdrup (BSc Computer Science)
    Complete Edge-Colored Permutation Graphs
    28. May 2021
  10. Anna Lindeberg (BSc Computer Science)
    Maximum matchings in Graph Products
    27. May 2021
  11. Nicola Doering (BSc BioMathematics)
    Algorithms for the "Reciprocal Best Match" Problem
    04. Feb. 2020
  12. Mira Michel (BSc BioMathematics)
    Combinining Orthology- and Fitch-Relations
    21. Aug. 2019
    [work has been extended and published as a joint paper]
  13. Linda Knuever (BSc BioMathematics)
    Fitch Graphen
    22. March 2018
  14. Lars Berling (BSc BioMathematics)
    A Comparison of Triple Based Heuristics for Supertree Reconstruction
    13. March 2018
  15. Fynn Marlin Leitow (BSc Mathematics)
    Heuristics and Exact Algorithms for the Di-Cograph Editing Problem
    01. Feb. 2018
  16. Casten Seemann (BSc Mathematics)
    Splits and Triples in rooted Trees and the Closure of Representative Triple Sets
    24. March 2017
    [work has been extended and published as a joint paper]
  17. Felix Becker (BSc Mathematics)
    Efficient Primfactor-Decomposition of Cartesian Product Graphs
    14. Feb. 2017
  18. Anica Hoppe (BSc BioMathematics)
    On the relationship between phylogenetic trees on four leaves and estimated orthology relations
    29. Nov. 2016
  19. Sonja Tuerpitz (BSc BioMathematics)
    On the reconstruction of slightly disturbed symbolic ultrametrics
    29. Nov. 2016
  20. Jan Oldenburg (BSc Mathematics)
    Protein Design with Machine Learning Methods
    9. Aug 2016
  21. Jannik Luxenburg (BSc Bioinformatics)
    Efficient Generation and Structural Analysis of RNA-Phenotype Spaces
    20. Aug. 2015
  22. Christian Brossette (BSc Bioinformatics)
    Effcient Algorithms for the Densest-k Subgraph problem
    26. June 2014
  23. Kevin Gitzhofer (BSc Bioinformatics)
    New Results in Finding Species Trees
    27. June 2013
  24. Miriam Bah (BSc Bioinformatics)
    Measuring the relevance of topology in networks for finding deregulated subgraphs
    30. Oct. 2012
  25. Sarah Berkemer (BSc Bioinformatics)
    Cograph Editing: An Approach to Adjust the Orthology Relation for the Reconstruction of Phylogenetic Trees
    12. Aug. 2012
    [work has been extended and published as a joint paper]
  26. Anna Feldmann (BSc Bioinformatics)
    Retrieving optimally discriminative Subnetwork Markers to predict response to Chemotherapy using a Color-coding Technique
    13. April 2012