| Therese Biedl | |
| Nationality: | Austrian |
| Alma Mater: | Rutgers University |
| Known For: | Computational geometry, planar graphs |
| Awards: | Ross & Muriel Cheriton Faculty Fellow, 2011 |
| Website: | https://cs.uwaterloo.ca/~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]
Biedl received her Diploma in Mathematics at Technische Universität Berlin, graduating in 1996and earned a Ph.D. from Rutgers University in 1997 under the supervision of Endre Boros.[1] [2]
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. With Alam, Felsner, Gerasch, Kaufmann, and Kobourov, Biedl found provably optimal linear time algorithms for proportional contact representation of a maximal planar graph.
Biedl was named a Ross & Muriel Cheriton Faculty Fellow in 2011, a recognition of the reach and importance of her scholarly works.[3]