Thérèse Biedl

University of Waterloo — Canada

Computer Science · Physical Sciences

25h-index2.3kcitations279works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(220), Advanced Graph Theory Research(98), Digital Image Processing Techniques(64), Graph Theory and Algorithms(26), Data Management and Algorithms(24)

Publications279 total

On the d-independence number in 1-planar graphs
Graphs and Combinatorics·2025
On computing vertex connectivity of 1-planar graphs
Algorithmica·2025
The Price of Upwardness
Discrete Mathematics & Theoretical Computer Science·2025Open Access
Rectangular Duals on the Cylinder and the Torus
arXiv (Cornell University)·2025Open Access
Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
arXiv (Cornell University)·2025Open Access
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
Lecture notes in computer science·2025· 1 cited
Improved Outerplanarity Bounds for Planar Graphs
Lecture notes in computer science·2025
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
arXiv (Cornell University)·2025Open Access
The basis number of 1-planar graphs
arXiv (Cornell University)·2024Open Access
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
arXiv (Cornell University)·2024Open Access
On the $d$-independence number in 1-planar graphs
arXiv (Cornell University)·2024Open Access
Large matchings in maximal 1-planar graphs
Discrete Mathematics·2024Open Access
Improved Outerplanarity Bounds for Planar Graphs
arXiv (Cornell University)·2024Open Access
Finding maximum matchings in RDV graphs efficiently
arXiv (Cornell University)·2024Open Access
Morphing Planar Graph Drawings via Orthogonal Box Drawings
arXiv (Cornell University)·2024Open Access
The Price of Upwardness
arXiv (Cornell University)·2024Open Access
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
arXiv (Cornell University)·2024· 1 citedOpen Access
On the Complexity of Embedding in Graph Products
arXiv (Cornell University)·2023Open Access
Large Matchings in Maximal 1-planar graphs
arXiv (Cornell University)·2023Open Access
Visibility Representations of Toroidal and Klein-bottle Graphs
Lecture notes in computer science·2023· 1 cited
page 1 of 14Next →

Frequent Co-authors

Anna Lubiw(9), Erik D. Demaine(8), Sue Whitesides(8), Michael Kaufmann(7), Sylvain Lazard(5), Martin L. Demaine(5), Stephen Kobourov(4), Steve Robbins(4), Joseph O’Rourke(4), Goos Kant(3), Rudolf Fleischer(3), Stefan Felsner(3), Timothy M. Chan(3), Ileana Streinu(3), Godfried Toussaint(3), Subhash Suri(2), Md. Jawaherul Alam(2), Torsten Ueckerdt(2), Martin Held(2), Stefan Huber(2)