[1] 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] Biedl's research is in developing algorithms related to graphs and geometry.
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] Biedl was named a Ross & Muriel Cheriton Faculty Fellow in 2011, a recognition of the reach and importance of her scholarly works.