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
- Andrzej Grzesik, Daniel Kráľ, and Samuel Mohr:
Strong modeling limits of graphs with bounded tree-width
- 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
Recent and future events
I am co-organising the next IlKe workshop, which will take place online for obvious reasons.
I like to advertise the Round the World Relay in Combinatorics. This is a getting together of a number of seminars and groups in combinatorics around the world.
You can find a list of all my organised and visited events and conferences here.