Statistics
Publications
41
Citations
1.3K
H-Index
20
Active since
1997
Thérèse Biedl is an author at University of Waterloo specializing in computing, computer science, and computational geometry.
Publications per year
1997–2016
41
41
A better heuristic for orthogonal graph drawings
Thérèse Biedl, Goos Kant · Computational Geometry · 1998 · 171 citations
Tight bounds on maximal and maximum matchings
Thérèse Biedl, Erik D. Demaine, Christian A. Duncan et al. · Discrete Mathematics · 2004 · 84 citations
Curvature-Constrained Shortest Paths in a Convex Polygon
Pankaj Agarwal, Thérèse Biedl, Sylvain Lazard et al. · SIAM Journal on Computing · 2002 · 78 citations · Full text
Efficient Algorithms for Petersen's Matching Theorem
Thérèse Biedl, Prosenjit Bose, Erik D. Demaine et al. · Journal of Algorithms · 2001 · 70 citations
Unfolding some classes of orthogonal polyhedra.
Thérèse Biedl, Erik D. Demaine, Martin L. Demaine et al. · 1998 · 68 citations
1–5 of 41