My name is Samuel Mohr. I recently finished my PhD studies under the supervision of Prof. Matthias Kriesell at Ilmenau University of Technology. As a postdoc at the Faculty of Informatics of Masaryk University, I work in the Laboratory of Discrete Methods and Algorithms (DIMEA) with the group headed by prof. Daniel Kráľ.
My full CV can be found here.
At Masaryk University, I started to work on extremal combinatorics. My current research interests largely focus on the following:
- Limits and Randomness of Combinatorial Objects
- Structural Graph Theory
- Combinatorial Algorithms
- Jacob W Cooper, Daniel Kráľ, Ander Lamaison, and Samuel Mohr:
Quasirandom Latin squares
- Jochen Harant and Samuel Mohr:
New bounds on domination and independence in graphs
- Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, and Olaf Parczyk:
Random perturbation of sparse graphs
Recent and future events
Last autumn, I was co-organising the ITI Online Seminar with prof. Tomáš Kaiser, which was a venue for presenting current research in discrete mathematics and theoretical computer science in the Czech Republic.
Earlier this year, I supported the organisation of the Workshop on Graph Theory & Combinatorics in Thuringia.
You can find a list of all my organised and visited events and conferences here.