.jpg)
I am a PhD student at the Algorithm Engineering chair of the Hasso Plattner Institute at the University of Potsdam, Germany.
My lovely PhD supervisor is George Skretas (beware, he does not look like his picture).
graph structure theory and graph algorithms
computational and parameterized complexity
social choice theory
temporal graphs
logic
My current central topic of interest 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. 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 find the fundamental structures and properties of these graphs.
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 aim to gather all literature on research related to temporal graphs and summarize the results. This is—and always will be—work in progress.
See: Temporal Graphs 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 tutor, I was teaching logic (and other courses) for 4 years at TU Berlin and am regularly involved in prepping/teaching courses at HPI.
Email: [email protected]
<aside>
</aside>