stringtranslate.com

Therese Biedl

Therese Charlotte Biedl is an Austrian computer scientist known for her research in computational geometry and graph drawing. Currently she is a professor at the University of Waterloo in Canada.[1]

Education

Biedl received her Diploma in Mathematics at Technische Universität Berlin, graduating in 1996 and earned a Ph.D. from Rutgers University in 1997 under the supervision of Endre Boros.[1][2][3]

Research

Biedl's research is in developing algorithms related to graphs and geometry. Planar graphs are graphs that can be drawn without crossings. Biedl develops algorithms that minimize or approximate the area and the height of such drawings.[A] With Alam, Felsner, Gerasch, Kaufmann, and Kobourov, Biedl found provably optimal linear time algorithms for proportional contact representation of a maximal planar graph.[C]

Awards

Biedl was named a Ross & Muriel Cheriton Faculty Fellow in 2011, a recognition of the reach and importance of her scholarly works.[4]

Selected publications

References

  1. ^ a b Faculty profile, Univ. of Waterloo, retrieved 2017-12-08.
  2. ^ Therese Biedl at the Mathematics Genealogy Project
  3. ^ Curriculum Vitae, Univ. of Waterloo, retrieved 2017-12-08.
  4. ^ "Ross & Muriel Cheriton Faculty Fellowship | Cheriton School of Computer Science". Cheriton School of Computer Science. 10 February 2017. Retrieved 9 December 2017.

External links