<aside>

</aside>

Hi!

I am a PhD student at the Algorithm Engineering chair of the Hasso-Plattner-Institute (HPI) at the University of Potsdam, Germany. My PhD supervisor is George Skretas (beware, he does not look like his picture).

Short Biography:

I studied Mathematics at TU Berlin with a minor in Computer Science with no particular focus but enjoying the courses on graph theory, combinatorics and logic. For my masters, I switched to Computer Science where I attended the graph structure theory and advanced logic courses by Stephan Kreutzer, tutored a lot of courses and philosophized with Uwe Nestmann about teaching. In my last semester I took a course on Computational Social Choice by Markus Brill and wrote my master thesis on the Margin of Victory for Tournament Solutions supervised by Markus and Jannik Peters. After joining HPI for my PhD with the goal of doing “something with graphs”, I slowly got infected with temporal graphs.

My Research interests include:

• graph structure theory and graph algorithms

• computational and parameterized complexity

• social choice theory

• temporal graphs

• logic

My current research topic are temporal graphs—their structural properties and efficient algorithms for their computational problems.

In temporal graphs, vertices are connected only at specific given points in time – like trains running at scheduled times in a public transportation network or people interacting in a social network. In such graphs, many fundamental properties of classical (static) graphs do not hold, and algorithms which have been at the basis of our understanding of static graphs, fail when applied to temporal graphs. I want to discover the fundamental structures of these graphs.

<aside>

</aside>

Temporal graphs have many names: dynamic networks, time-varying graphs, edge-scheduled networks, to name a few. Because this concept has been studied in many different fields and under multiple names, there are a lot of results being discovered more than once, and knowledge staying hidden under the 'wrong' name. To tackle this issue, I gather all research related to temporal graphs that I can find and summarize the results. This is—obviously—work in progress.

Feel free to reach out if I should add something or you want to share some knowledge.

Apart from temporal graphs, I also work on topics in social choice theory – most prominently single winner voting methods, e.g., the River Method.

I am also very passionate about logic and proof writing, as well as teaching (both in a basic (university) context and in regards to research presentations). As a student, I was a tutor for logic (4 semester), discrete structures (3 semesters), formal languages and automata (1 semester), and logical methods of computer science (1 semester) over a span of 4 years at TU Berlin. I am also regularly involved in prepping/teaching bachelor and master courses at HPI. Some of this resulted in teaching resources which can be found here.

Contact

Email: [email protected]

Publications

Other fun facts about me

• I was a competitive swimmer for over 10 years and the https://www.berlinerhaie.de/ are my second family
• I was a competitive latin dancer for ~6 years and I still love dancing in every form including latin, ballroom, salsa, and west coast swing
• I do weight lifting and functional training
• my favourite colour is orange 🧡
• for many many years I have been wearing a Garmin watch, specifically the Garmin Fenix (currently 7S solar)

<aside>

I do not tolerate any kind of discrimination (especially racism), unjustified disrespect, or bullying!

To quote a very famous rabbit named Klopfer: “Wenn man nichts nettes zu sagen hat, soll man den Mund halten.” (en: if you can’t say something nice, don’t say anything at all.”)

</aside>

Student Supervision

I have supervised a few student in the last years:

Misc

• A podcast recommendation for longterm physical health and knowledge around exercise and nutrition: Mind Pump
• I recently enjoyed playing this turn-based RPG: Clair Obscure - Expedition 33