Therese Biedl
Professor
Cheriton School of Computer Science
University of Waterloo
Canada
Biography
Dr. Therese Biedl is a Professor in the Cheriton School of Computer Science, University of Waterloo, University Avenue West, Waterloo, ON, Canada.
Research Interest
Professor Biedl's research interest is in algorithms, especially for problems that involve graphs and geometry. Her main topic is graph drawing, i.e., how to create (automatically) a nice-looking drawing of a given graph. Professor Biedl specializes on drawings of planar graphs, i.e., graphs that can be drawn without crossings, and develops algorithms that minimize or approximate the area and the height of such drawings. As part of this work, she also studies graph algorithms, especially for planar graphs, as well as approximation algorithms and fixed-parameter tractability. She is also interested in many other problems in computational geometry.
Publications
-
Md. J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. G. Kobourov, and T. Ueckerdt, Computing cartograms with optimal complexity. Discrete & Computational Geometry 50(3):784–810, 2013.
-
T. Biedl, On area-optimal planar graph drawings, International Colloquium on Algorithms, Languages and Programming (ICALP'14), pp. 198-210, 2014.