Theoretical Computer Science / Theoretische Informatik

Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]

User Tools

Site Tools


staff:alumni

Alumni

Former group members

Name~~~~~~~~~~~~~~ Role Comment
Dominik Potulski HiWi 2023-2024
Dr. Niklas Troost PhD student 2017–2023, "Approximation Algorithms for Multistage Subgraph Problems"
Levin Nemesch HiWi 2021–2023
Mirko H. Wagner HiWi 2015–2023
Dr. Alexander Nover PhD student* 2017–2022, "Cut Problems on Graphs"
Dr. Martin Gronemann PostDoc 2020–2021
Jöran Schierbaum HiWi 2017–2021
Dr. Tilo Wiedera PhD student 2015-2020, "Computing Measures of Non-Planarity"
Max Ilsen HiWi 2016–2020
Hendrik Brückler HiWi 2019–2020
Sven Klecker HiWi 2016–2019
Dr. Ivo Hedtke PhD student 2014-2017, "Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms"
Michal Kotrbčík, PhD Visiting Researcher March-June 2015
Dr. Robert Zeranski PhD student 2012-2014, "Satisfiability Characterizations of Upward Planarity Problems" (Uni Jena)
Matthias Woste PhD student 2010-2011, (Uni Jena)

* co-advised with Martina Juhnke-Kubitzke, Discrete Mathematics, Institute of Mathematics.

Former students

Name~~~~~~~~~~~~~~ Degree Topic
Henning Jasper Master, 2023 "Exact Minimum Weight Spanners via Column Generation"
Jo Sanders Master, 2023 "Exploring the Complexity of Multistage Spanning Tree Problems"
Joshua Sangmeister Master, 2023 "An Implementation of the Blossom Algorithm for Minimum Weight Perfect Matchings within the Open Graph Algorithms and Data Structures Framework"
Benedikte Lechtermann Master, 2023 "Zentralitätsmaße für Gruppen in sozialen Netzwerken: Entwicklung und Vergleich"
Levin Nemesch Master, 2023 "Engineering the First Polynomial Delay Solver for Tri-Objective Linear Programming"
Mirko H. Wagner Master, 2023 "On ILP formulations for the Fan- and Quasi-Planar Crossing Number"
Tim Hartmann Master, 2022 "Speeding Things Up: Parallel Algorithms for the Spanner Problem"
Thomas Klein Master, 2022 "Applied Algorithms for the Planar Separator Theorem"
Finn Stutzenstein Master, 2021 "Spanner Approximations in Practice"
Henning Jasper Bachelor, 2021 "Complexity of the Multiobjective Spanner Problem"
Justus Bruckamp Master, 2021 "Das Steinerbaum-Polytop: Einfachheit, Simplizialität und die Charakterisierung der Kanten" (co-advised with Martina Juhnke-Kubitzke)
Jan-Niklas Buckow Master, 2021 "Approximationsalgorithmen für das Knotenfärbungsproblem in Graphen"
Jöran Schierbaum Bachelor, 2020 "Implementing Matching Algorithms for the OGDF"
Mirko H. Wagner Bachelor, 2020 "ILP Formulations for the Longest Induced Path Problem"
Justus Bruckamp Bachelor, 2020 "Einfachheit und Simplizialität des Steinerbaumpolytops für Bäume und Kreise" (co-advised with Martina Juhnke-Kubitzke)
Levin Nemesch Bachelor, 2020 "Performance Differences between Label Setting and Correcting Algorithms in Multi-Objective Shortest Path Problems" (advised by Fritz Bökler and Frank Hilker)
Simon Veltel Master, 2019 "Bad-Case Generierung für Graphen-Approximationsprobleme"
Gianna-May Schüller Bachelor, 2019 "Implementation einer Heuristik für Maximum Edge Clique Partition"
David Rolfes Bachelor, 2018 "Evaluation eines Algorithmus zur Berechnung minimaler 2-kantenzusammenhängender spannender Teilgraphen in subquadratischer Zeit"
Sven Klecker Bachelor, 2017 "Praktische Erprobung von Parsons-Puzzles und Selbsttests in der Lehre" (co-advised with Michael Brinkmeier)
Max Ilsen Bachelor, 2017 "Energy-Based Layout Algorithms for Graphs with Large Nodes"
Maria Seidens Bachelor, 2015 "Labeling in energebasierten Graphenzeichnungen"
Tilo Wiedera Master, 2015 "Extracting Proofs for Crossing Numbers"
Fabrice Stellmacher Wissenschaftl. Hausarbeit (Staatsprüfung/Lehramt, ≈Master), 2013 "Beschleunigte QU-Optimierung zum Testen von Aufwärtsplanarität" (Uni Jena)
Kerstin Goessner Bachelor, 2012 "Ein zerlegungsbasierter Aufwärtsplanaritätstest" (Uni Jena)
staff/alumni.txt · Last modified: 2024/04/05 14:15 by chimani