Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

Michelle Luise Döring

Chair for Algorithm Engineering
Hasso Plattner Institute

Office: K-2.09/10
Email: Michelle.Doering(at)hpi.de

Research Interests

Mathematician who fell in love with more applied theory.

Exploiting structure and hidden identities; whenever different groups of objects somehow correspond to another -> I am interested. I enjoy using graphs or funny pictures to visualize complex and abstract problems.
Still a bit green behind my researcher ears, but so far my interests include, but are not limited to

  • Graph (Structure) Theory and Algorithms
  • Social Choice Theory
  • Game Theory
  • (maybe a little bit) randomness
  • Logic and Proofs

I am keen to broaden my resarch horizon, so if you have something interesting - hit me up.

Teaching

Making knowledge accessible and good teaching are very important to me. I am always interested in improving my presenting and teaching skills.

As Teaching Assistant

At TU Berlin

Education

Since 2022Ph.D. student at the chair for Algorithm Engineering, HPI Potsdam 
2019 - 2022Master of Science in Computer Science
Technische Universität Berlin, Berlin
Thesis: “Margin of Victory for Weighted Tournament Solutions”
2012 - 2017Bachelor of Science in Mathematics (minor in computer science)
Technische Universität Berlin, Berlin
Thesis: “Flip Graphs, Topological Drawings and Separable Permutations”

 

Publications

[ 2023 ]

2023 [ nach oben ]

  • Schelling Games with Cont... - Download
    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
     
  • Doering, Michelle; Peters, Jannik Margin of Victory for Weighted Tournament SolutionsAutonomous Agents and Multi-Agent Systems (AAMAS) 2023: 1716–1724
     
  • Being an Influencer is Ha... - 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