A triangulated random graph

Hi! I’m Anna, a PhD student in computational mathematics at Stockholm University. My scientific interests can briefly be summarized as:

Graph theory and other discrete structures with an algorithmic focus; often motivated by genetic data and the study of evolution .

On this page, you can find my online-CV, a list of my written works and some other things about me. It’s currently a bit rough around the edges – but I’ll get there!

I’m currently thinking about

  • Efficient algorithms on graphs guided by modular decomposition trees
  • What information of a rooted network can be recovered from information concerning the leaves only (least common ancestors, common descendants, etc…)