Therese Biedl

Therese Biedl is a Professor at the University of Waterloo's Department of Computer Science. Her research focuses on graph drawing, algorithms for planar and near-planar graphs, computational geometry, and theoretical computer science. She holds a Ph.D. from Rutgers University (1997) and a Dipl.-Math from the Technical University of Berlin (1996). Her work emphasizes geometric representations of graphs, algorithm optimization for special graph classes, and visibility representations.

Key research interests include rectangular duals, graph embeddings on surfaces (cylinder/torus), and efficient algorithms for 1-planar graphs. She explores topics such as matching problems in planar graphs, geometric curve separation, and polygon decomposition. Her recent publications (2023–2025) address graph connectivity, visibility layouts, and parameterized complexity in embedded graphs.

Notably, her articles analyze structural properties of graphs (e.g., basis numbers, independence numbers) and geometric constraints (e.g., outer-string representations). While no scientific awards are listed, her contributions to graph theory and algorithm design are substantial. No advising/grant details are provided in the text, but her involvement in conferences like GD 2018 highlights academic engagement.