Hannah Bast

Hannah Bast is a German computer scientist known for her work on routing in transport networks. She works as a professor at the University of Freiburg, where she holds the chair in algorithms and data structures and is dean of studies in the faculty of engineering.[1]

Bast studied at Saarland University, earning bachelor's degrees in mathematics and computer science in 1990, a master's degree in computer science in 1994 under the direction of Torben Hagerup, and a doctorate in 2000. Her dissertation, supervised by Kurt Mehlhorn, was Provably Optimal Scheduling of Similar Tasks.[1][2] She worked as a researcher at the Max Planck Institute for Informatics until 2007, and at Saarland University from 2008 to 2009, before moving to Freiburg in 2009.[1] Bast was program chair for Track B (Engineering and Applications) of the 2018 European Symposium on Algorithms.[3]

With Stefan Funke, Bast won the Heinz Billing Prize for the Advancement of Scientific Computing in 2007 for their work on data structures for shortest path queries.[4]


  1. ^ a b c Curriculum vitae, retrieved
  2. ^ Hannah Bast at the Mathematics Genealogy Project
  3. ^ ESA 2018: Committees, Helsinki Institute for Information Technology, retrieved
  4. ^ "Award Winners", Heinz Billing Prize for the Advancement of Scientific Computing, retrieved

Further reading

External links

  This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.



Connect with defaultLogic
What We've Done
Led Digital Marketing Efforts of Top 500 e-Retailers.
Worked with Top Brands at Leading Agencies.
Successfully Managed Over $50 million in Digital Ad Spend.
Developed Strategies and Processes that Enabled Brands to Grow During an Economic Downturn.
Taught Advanced Internet Marketing Strategies at the graduate level.

Manage research, learning and skills at defaultlogic.com. Create an account using LinkedIn to manage and organize your omni-channel knowledge. defaultlogic.com is like a shopping cart for information -- helping you to save, discuss and share.

  Contact Us