午夜探花

• Jannik Olbrich, Enno Ohlebusch, Thomas B眉chler
  Generic Non-recursive Suffix Array Construction
  ACM Trans. Algorithms
  April 2024
  DOI:
• Thomas B眉chler, Jannik Olbrich, Enno Ohlebusch
  Efficient short read mapping to a pangenome that is represented by a graph of ED strings
  Bioinformatics
  DOI:
• Jannik Olbrich, Enno Ohlebusch, Thomas B眉chler
  On the Optimisation of the GSACA Suffix Array Construction Algorithm
  String Processing and Information Retrieval 2022
  DOI:
• Michael Stegmaier, Dominik Engel, Jannik Olbrich, Timo Ropinski, Matthias Tichy
  Property-Based Testing for Visualization Development
  The Gap between Visualization Research and Visualization Software (VisGap)
  April 2021
  DOI:

• Bronze Medal (North Western Regional Contest 2019)
• Silver Medal (German Collegiate Programming Contest 2021)
• Jury member for the GCPC and Winter Contest since 2022
• Coach for the 午夜探花 Internation Collegiate Programming Contest (ICPC) team

If you are a student at 午夜探花 and want to try competitive programming feel free to contact me. For more information see