Michelle Doering

Research Interests

I study basic properties of graphs and other structures. 
 

My main topic of interest at the moment are temporal graphs - also called dynamic networks, time-varying, edge-scheduled networks, etc. These graphs have vertices which are connected only at specific, given points in time (e.g., train networks). In such graphs, many fundamental properties of static graphs do not hold and classical algorithms which we have known for decades, fail.
I want to find the fundamental structures and properties of these graphs. To that end, I study how algorithmic problems differ on temporal graphs from their counterpart on static graphs, and what impact design choices have on properties like connectivity, reachability, ...
 

Since these temporal graphs have been studied by researchers in many fields and under multiple names, there are a lot of instances of results being discovered again and again. To tackle this problem, I have the goal to gather all literature and summarize it in a notion page. This is still very much in progress. So far, only the temporal graph literature list is online and can be found at temporalgraph.notion.site. The link for the summary pages will be made available soon.
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 voting methods (social choice theory, game theory) and am very passionate about logic and proof writing, as well as teaching.

If you wanna have a chat - send me an email.

Teaching

In my opinion it is our responsibility to make knowledge accessible and nuture the next generation alongside doing research. I am always keen to improve my presentation, supervision and teaching skills.
 

Student Supervision

• Gerome, bachelor thesis on short cut sets in temporal graphs, winter term 2024/2025
• Master project on multiple traveling salesperson problem, winter term 2024/2025
• Jannes, bachelor thesis on the River voting method with parallel universe tiebreaking, summer term 2024 (he found a cool algorithm for a usually NP-hard problem)
   
• Ben, master thesis on temporal graph discovery using infections, winter term 2023/2024 (he is now an awesome PhD student at CWI)

Teaching @ HPI

• Master seminar with topics on algorithms and participatory budgeting, winter term 2024/2025
• Parameterized Algorithms, summer term 2024
• Bachelor seminar with topics on graph structure theory and social choice, winter term 2023/2024
• Algorithmic Problem Solving, winter term 2022/23

Teaching @ TU Berlin

• Logic, winter term 2019/20, 2020/2021, 2021/22 and 2022/23
• Discrete Structures, summer term 2020, 2021 and 2022
• Formal Languages and Automata, summer term 2022
• Logical Methods in Computer Science, summer term 2021
• Video series about the Lambda Cube

Education

Publications

2025

•  

  Deligkas, Argyrios; Döring, Michelle; Eiben, Eduard; Goldsmith, Tiger-Lily; Skretas, George; Tennigkeit, Georg How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs 2025

  [ ] [ ] [ Download ]

2023

•  

  Bilò, Davide; Bilò, Vittorio; Döring, Michelle; Lenzner, Pascal; Molitor, Louise; Schmidt, Jonas Schelling Games with Continuous TypesInternational Joint Conference on Artificial Intelligence (IJCAI) 2023: 2520–2527

  [ ] [ ] [ URL ] [ DOI ] [ Download ]

•  

  Doering, Michelle; Peters, Jannik Margin of Victory for Weighted Tournament SolutionsAutonomous Agents and Multi-Agent Systems (AAMAS) 2023: 1716–1724

  [ ] [ ] [ URL ] [ Download ]

•  

  Deligkas, Argyrios; Eiben, Eduard; Goldsmith, Tiger-Lily; Skretas, George Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed SourceAutonomous Agents and Multi-Agent Systems (AAMAS) 2023: 2222–2230

  [ ] [ ] [ URL ] [ Download ]