Organisation of conferences and seminars
06/2021 | Round the World Relay in Combinatorics, online around the world. A number of seminars and groups around the world are getting together for a Round the World Relay in Combinatorics. Each site will host a talk, and everyone is welcome! The special occasion of the Brno DIMEA and FORMELA seminar as part of the relay is co-organised by myself and prof. Dan Kráľ.. Here is the seminar webpage. |
06/2021 | IlKe goes online, online in Ilmenau. The ILKE-workshops are a series of workshops aiming to strengthen the collaboration between the graph theory groups of Univerzita Pavla Jozefa Šafárika v Košiciach and Technische Universität Ilmenau. It is co-organised by myself and RNDr. Mária Maceková, PhD.. Here is the workshop webpage. |
2020 | ITI Online Seminar, online in Czech Republic. The ITI Online Seminar is a venue for presenting current research in discrete mathematics and theoretical computer science in the Czech Republic. It is co-organised by myself and prof. Tomáš Kaiser. Here is the seminar webpage. |
07/2020 | Workshop on Graph Theory & Combinatorics in Thuringia, online in Ilmenau. This conference is the second workshop within a series of meetings organized by the Karlsruhe Institute of Technology, the Technical University of Ilmenau, and the Ulm University. As a local organiser, it was my responsibility to ensure that the event ran successfully online. Here is the conference webpage. |
Visited conferences
09/2021 | European conference on combinatorics, graph theory and applications, Barcelona resp. online. Talk: “Strong modeling limits of graphs with bounded tree-width” |
12/2020 | Bringing Young Mathematicians Together (BYMAT), Valencia resp. online. Talk: “Rooted Structures in Graphs” |
08/2020 | Czech-Slovak Conference Graphs, Brno, Czech Republic. Talk: “Rooted Structures in Graphs” |
12/2019 | Operator Theory and Kreĭn Spaces, Vienna, Austria. Talk: “Eigenvalues of Graphs” |
11/2019 | Colloquium on Combinatorics, Paderborn, Germany. Talk: “X-minors and X-spanning subgraphs” |
10/2019 | Bordeaux Graph Workshop, Bordeaux, France. Extended abstract and talk: “On the Circumference of 3-Connected Maximal 1-Planar Graphs” |
09/2019 | Cycles & Colourings, Nový Smokovec, High Tatras, Slovakia. Talk: “On Uniquely Colourable Graphs” |
08/2019 | European conference on combinatorics, graph theory and applications, Bratislava, Slovakia. Extended abstract and talk: “Cycles through a set of specified vertices of a planar graph” |
08/2019 | Ghent Graph Theory Workshop on Structure and Algorithms, Ghent, Belgium. Invited contributed talk: “X-minors and X-spanning subgraphs” |
07/2019 | Cologne-Twente Workshop on Graphs & Combinatorial Optimization, Enschede, Netherlands. Extended abstract and talk: “On Uniquely Colourable Graphs” |
06/2019 | Czech-Slovak Conference Graphs, Čingov, Slovak Paradise, Slovakia. Talk: “Hamiltonicity of 1-planar graphs” |
05/2019 | Canadian Discrete and Algorithmic Mathematics Conference, Vancouver, Canada. Talk: “Kempe Chains and Rooted Minors” |
11/2018 | Colloquium on Combinatorics, Paderborn, Germany. Talk: “Kempe Chains and Rooted Minors” |
07/2018 | Building Bridges II, Budapest, Hungary. Poster: “On Selkow’s Bound on the Independence Number of Graphs” |
07/2018 | International Colloquium on Graph Theory and Combinatorics, Lyon, France. |
09/2018 | Cycles & Colourings, Nový Smokovec, High Tatras, Slovakia. Talk: “Kempe Chains and Rooted Minors” |
11/2017 | Colloquium on Combinatorics, Paderborn, Germany. Talk: “On Selkow’s Bound on the Independence Number of Graphs” |
09/2017 | Cycles & Colourings, Nový Smokovec, High Tatras, Slovakia. Talk: “Longer Cycles In Essentially 4-Connected Planar Graphs” |
09/2014 | Cycles & Colourings, Nový Smokovec, High Tatras, Slovakia. Talk: “Quadratic Forms on Graphs and Maximum Weighted Subgraphs” |
Great Researchers
During the last few years in academia, I had the pleasure of meeting a bunch of great people and researchers around the world. I very much enjoyed our scientific and non-scientific discussions.
To boost their visibility on Google, allow me to list but a few of them below:
- Dan Kráľ (postdoc supervisor)
- Florian Pfender (postdoc supervisor)
- Matthias Kriesell (PhD supervisor (does not like webpages and emails))
- Jochen Harant (Bachelor's and Master's supervisor (link shows his doctor honoris causa ceremony))
- Vilas Winstein (had the idea of listing friends on the webpage)
- Frederik Garbe (is always up for discussions)
- Ander Lamaison (knows all facts)
- Théo Pierron (the French guy in the Czech Republic)
- Jan Volec (expert for every IT question)
- Chris Cox (the Mathematicaster)