<aside>

</aside>

Hi, I’m Michelle.

PhD student · Algorithm Engineering group · HPI, Germany

I study how the timing of connections changes the behaviour of graphs. My research brings together temporal graphs, graph structure, computational complexity, and logic. My PhD supervisor is George Skretas (beware, he does not look like his picture).

Research

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.

I welcome pointers to missing papers, corrections, and contributions. Feel free to reach out!

Beyond temporal graphs

I like to work on any kind of graph structural questions, recently on simultaneous embeddings, and always on graph minor theory or logic.

I also work on social choice theory – most prominently single winner voting methods, e.g., the River Method.

Publications & talks

My papers and research projects are collected at Research. Presentations, visits, and other travels are listed under Talks, Research Visits, and Seminars.

Teaching & Supervision

I am very passionate about logic and proof writing, as well as teaching (both in a university context and in regards to research presentations). I love to make these concepts easy to understand, which is why I put a lot of effort into my research presentations.

At TU Berlin, I tutored logic (4 semester), discrete structures (3 semesters), formal languages and automata (1 semester), and logical methods of computer science (1 semester) over 4 years at TU Berlin. At HPI, I help prepare and teach bachelor’s and master’s courses as well as the Vorkurs. Some of this resulted in teaching resources which can be found here.

Contact

Email: [email protected]

Research interests

• Graph structure and algorithms
• Computational and parameterized complexity
• Temporal graphs
• Logic
• Social choice

Background

I am in the fourth year of my PhD.

I studied Mathematics (bachelor) and then Computer Science (master) at TU Berlin before joining HPI for my PhD. Along the way, graph structure theory, logic, teaching, and social choice shaped my research interests.

• The longer story

Beyond research

Swimming, dancing, and strength training are a big part of my life. My favourite colour is orange. 🧡

• A few more personal details

<aside>

I value respectful, inclusive spaces and do not tolerate discrimination 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 projects and supervision

pages:

Talks, Research Visits, and Seminars

Resources

Research