Therese Biedl

Q: What Schools Are Affiliated With Therese Biedl

Therese Biedl is affiliated with the following schools: University of Waterloo, Rutgers University

Therese Biedl's AcademicInfluence.com Rankings

Therese Biedl

Computer Science

#9935

World Rank

#10423

Historical Rank

Database

#8777

World Rank

#9215

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Therese Biedl Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Therese Charlotte Biedl is an Austrian computer scientist known for her research in computational geometry and graph drawing. Currently she is a professor at the University of Waterloo in Canada. Education Biedl received her Diploma in Mathematics at the Technical University of Berlin, graduating in 1996 and earned a Ph.D. from Rutgers University in 1997 under the supervision of Endre Boros.

(See a Problem?)

Therese Biedl's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Better Heuristic for Orthogonal Graph Drawings (1994) (214)
Curvature-Constrained Shortest Paths in a Convex Polygon (2002) (84)
Tight bounds on maximal and maximum matchings (2001) (83)
Efficient algorithms for Petersen's matching theorem (1999) (79)
Unfolding some classes of orthogonal polyhedra (1998) (77)
Computing Cartograms with Optimal Complexity (2011) (64)
Area-Efficient Static and Incremental Graph Drawings (1997) (62)
Drawing Planar Graphs Using the Canonical Ordering (1996) (60)
Locked and unlocked polygonal chains in 3D (1998) (55)
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing (1997) (55)
On Triangulating Planar Graphs under the Four-Connectivity Constraint (1994) (54)
Locked and Unlocked Polygonal Chains in Three Dimensions (1999) (44)
On edge-intersection graphs of k-bend paths in grids (2009) (42)
Balanced vertex-orderings of graphs (2005) (41)
Drawing Planar Partitions II: HH-Drawings (1998) (39)
The Complexity of Clickomania (2001) (39)
Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data (2001) (37)
Drawing planar 3-trees with given face areas (2009) (37)
On the complexity of crossings in permutations (2009) (36)
Drawing planar partitions I: LL-drawings and LH-drawings (1998) (35)
A note on reconfiguring tree linkages: trees can lock (2002) (33)
New Lower Bounds for Orthogonal Graph Drawings (1995) (31)
Crossings and Permutations (2005) (31)
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs (2011) (30)
Weighted straight skeletons in the plane (2015) (28)
When can a net fold to a polyhedron (2005) (28)
Reconstructing orthogonal polyhedra from putative vertex sets (2011) (27)
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles (1999) (26)
Drawing Outer-Planar Graphs in O(n log n) Area (2002) (25)
On Visibility Representations of Non-Planar Graphs (2015) (25)
Bounds for Orthogonal 3-D Graph Drawing (1999) (24)
Proportional Contact Representations of Planar Graphs (2011) (24)
Reconstructing polygons from scanner data (2009) (24)
Smart-Grid Electricity Allocation via Strip Packing with Slicing (2013) (24)
Orthogonal Cartograms with Few Corners Per Face (2011) (23)
Optimal Orthogonal Drawings of Triconnected Plane Graphs (1996) (23)
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume (2000) (22)
The point-set embeddability problem for plane graphs (2012) (21)
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations (2011) (21)
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings (2013) (21)
Morphing Planar Graphs While Preserving Edge Directions (2005) (21)
On reconfiguring tree linkages: Trees can lock (1999) (21)
Fun-Sort--or the chaos of unordered binary search (2004) (20)
Graph Multidrawing: Finding Nice Drawings Without Defining Nice (1998) (20)
Complexity of Octagonal and Rectangular Cartograms (2005) (19)
Simplifying Flow Networks (2000) (18)
Three Approaches to 3D-Orthogonal Box-Drawings (1998) (17)
Drawing planar bipartite graphs with small area (2005) (16)
A simple algorithm for computing positively weighted straight skeletons of monotone polygons (2015) (16)
Drawing planar partitions III: Two constrained embedding problems (1998) (16)
Curvature-constrained shortest paths in a convex polygon (extended abstract) (1998) (16)
The Art Gallery Theorem for Polyominoes (2012) (16)
Convexifying Monotone Polygons (1999) (16)
On Guarding Orthogonal Polygons with Sliding Cameras (2016) (15)
Height-Preserving Transformations of Planar Graph Drawings (2014) (15)
Orthogonal 3-D Graph Drawing (1997) (15)
On triangulating k-outerplanar graphs (2013) (14)
1-string B2-VPG representation of planar graphs (2014) (13)
Improved Orthogonal Drawings of 3-graphs (1996) (13)
On r-Guarding Thin Orthogonal Polygons (2016) (13)
Balanced k-colorings (2000) (12)
Palindrome recognition using a multidimensional tape (2003) (12)
Planar Matchings for Weighted Straight Skeletons (2014) (11)
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input (2013) (11)
Guarding polyominoes (2011) (11)
Searching for the center of a circle (2002) (10)
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs (2012) (10)
Partitions of Graphs into Trees (2006) (10)
Crossing Number for Graphs with Bounded Pathwidth (2016) (9)
Relating Bends and Size in Orthogonal Graph Drawings (1998) (9)
The (3, 1)-ordering for 4-connected planar triangulations (2015) (9)
Graph-Drawing Contest Report (2000) (9)
Finding Hidden Independent Sets in Interval Graphs (2003) (9)
The complexity of domino tiling (2005) (9)
Bounded-Degree Independent Sets in Planar Graphs (2002) (8)
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames (2011) (8)
New Lower Bounds For Orthogonal Drawings (1998) (8)
Hiding disks in folded polygons (1998) (8)
Ideal Drawings of Rooted Trees With Approximately Optimal Width (2017) (8)
Efficient view point selection for silhouettes of convex polyhedra (2004) (8)
Minimum Ply Covering of Points with Disks and Squares (2019) (7)
Optimum-width upward drawings of trees (2015) (7)
Drawing K2, n: A lower bound (2003) (7)
Linear reductions of maximum matching (2001) (7)
Hexagonal Grid Drawings: Algorithms and Lower Bounds (2004) (6)
1-string B1-VPG-representations of planar partial 3-trees and some subclasses (2015) (6)
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs (2009) (6)
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs (2012) (6)
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs (2014) (6)
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (2017) (6)
Orthogonal Drawings with Few Layers (2001) (6)
Parallel morphing of trees and cycles (2003) (6)
Cauchy's Theorem and Edge Lengths of Convex Polyhedra (2007) (5)
Polygons Needing Many Flipturns (2006) (5)
1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved (2001) (5)
Partitioning Orthogonal Histograms into Rectangular Boxes (2018) (5)
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs (2018) (5)
Linear-Time Algorithms for Proportional Contact Graph Representations ? (2011) (5)
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs (2016) (5)
Orthogonal graph visualization: the three-phase method with applications (1998) (5)
Angles and Lengths in Reconfigurations of Polygons and Polyhedra (2004) (5)
A note on improving the performance of approximation algorithms for radiation therapy (2011) (5)
Rollercoasters: Long Sequences without Short Runs (2019) (5)
Order-Preserving 1-String Representations of Planar Graphs (2016) (4)
Reconstructing hv-convex multi-coloured polyominoes (2010) (4)
Matchings in 1‐planar graphs with large minimum degree (2019) (4)
Upward Order-Preserving 8-Grid-Drawings of Binary Trees (2017) (4)
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles (2002) (4)
On Area-Optimal Planar Graph Drawings (2014) (4)
Representing Directed Trees as Straight Skeletons (2015) (4)
A note on 3D orthogonal graph drawing (2005) (4)
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections (2007) (4)
Computing Cartograms with Optimal Complexity (2013) (4)
Building a larger class of graphs for efficient reconfiguration of vertex colouring (2020) (4)
Faster optimal algorithms for segment minimization with small maximal value (2011) (4)
Grid-Obstacle Representations with Connections to Staircase Guarding (2017) (4)
On Upward Drawings of Trees on a Given Grid (2017) (4)
Drawing some planar graphs with integer edge-lengths (2011) (3)
Packing Boundary-Anchored Rectangles and Squares (2019) (3)
Ideal Tree-drawings of Approximately Optimal Width (And Small Height) (2015) (3)
A note on 1-planar graphs with minimum degree 7 (2019) (3)
Quasiperiodic bobbin lace patterns (2019) (3)
On Layered Fan-Planar Graph Drawings (2020) (3)
When can a graph form an orthogonal polyhedron? (2004) (3)
EPG-representations with small grid-size (2017) (3)
On the Size of Outer-String Representations (2018) (3)
Non-aligned Drawings of Planar Graphs (2016) (3)
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting (2003) (3)
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0 (2009) (3)
Realizing Farthest-Point Voronoi Diagrams (2016) (3)
Sliding k-Transmitters: Hardness and Approximation (2016) (3)
Drawing Planar Graphs on Points Inside a Polygon (2012) (3)
Small-Area Orthogonal Drawings of 3-Connected Graphs (2015) (2)
Straight Skeletons of Monotone Polygons (2014) (2)
Finding large matchings in 1-planar graphs of minimum degree 3 (2020) (2)
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings (2017) (2)
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections (2011) (2)
Proportional Contact Representations of Planar Graphs Technical Report CS 2011-11 (2011) (2)
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs (2017) (2)
Dispersion for Intervals: A Geometric Approach (2021) (2)
Optimum-width upward drawings of trees I: Rooted pathwidth (2015) (2)
Stoker's Theorem for Orthogonal Polyhedra (2011) (2)
Orthogonal cartograms with at most 12 corners per face (2014) (2)
Segment representations with small resolution (2018) (2)
Finding Tutte paths in linear time (2018) (2)
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation (2019) (2)
Stable Roommates for Weighted Straight Skeletons (2014) (2)
Line and Plane Cover Numbers Revisited (2019) (2)
1-bend 3-D orthogonal drawings: two open problems solved (2000) (2)
Reconstructing Polygons from Embedded Straight Skeletons (2013) (2)
The Art Gallery Theorem for Polyominoes (2012) (2)
On Guarding Orthogonal Polygons with Bounded Treewidth (2017) (2)
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs (2019) (1)
Fixed-Parameter Tractability and Improved Approximations for Segment Minimization (2009) (1)
Bounded-degree independent sets in planar graphs: (Extended abstract) (2002) (1)
DAG-width of Control Flow Graphs with Applications to Model Checking (2015) (1)
Rectangle-of-influence triangulations (2016) (1)
Drawing High-degree Graphs with Small Grid-size Drawing High-degree Graphs with Small Grid-size (1997) (1)
Linear-Time Algorithms for Rectilinear Hole-free Proportional Contact Representations (2011) (1)
1-String CZ-Representation of Planar Graphs (2014) (1)
Homotopy height, grid-major height and graph-drawing height (2019) (1)
Morphing orthogonal planar graph drawings (2006) (1)
Crossing Number for Graphs with Bounded Pathwidth (2020) (1)
Drawing outer-1-planar graphs revisited (2020) (1)
Finding big matchings in planar graphs quickly (2019) (1)
Cross-Stitching Using Little Thread (2005) (1)
Reconfiguration of Non-crossing Spanning Trees (2022) (1)
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations (2013) (1)
Reprint of: Weighted straight skeletons in the plane (2015) (1)
Order-preserving drawings of trees with approximately optimal height (and small width) (2016) (1)
Realizations of Hexagonal Graph Representations (2007) (1)
4-connected planar graphs are in B3-EPG (2017) (1)
Strip Packing with Slicing (2012) (1)
Horton-Strahler number, rooted pathwidth and upward drawings of trees (2021) (1)
Sorting with networks of data structures (2010) (1)
Rollercoasters and Caterpillars (2018) (1)
The DFS-heuristic for orthogonal graph drawing (2001) (1)
Packing Boundary-Anchored Rectangles (2017) (1)
Morphing polyhedra with parallel faces: Counterexamples (2009) (1)
Turning Orthogonally Convex Polyhedra into Orthoballs (2014) (1)
Optimal-area visibility representations of outer-1-plane graphs (2021) (1)
Transforming planar graph drawings while maintaining height (2013) (1)
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest (2021) (1)
Are highly connected 1-planar graphs Hamiltonian? (2019) (1)
Trees and co-trees with constant maximum degree in planar 3-connected graphs (2013) (0)
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs (2012) (0)
On the complexity of embedding in graph products (2023) (0)
Improved Layouts of the Multigrid Network (2007) (0)
All Subgraphs of a Wheel are 5-Coupled-Choosable (2021) (0)
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth (2020) (0)
Reconstructing a Polyhedron between Polygons in Parallel Slices (2020) (0)
Open Problems from Cccg 2002 Kissing Circle Representation (2002) (0)
Visibility Representations of Toroidal and Klein-bottle Graphs (2022) (0)
Morphing Polyhedra Preserving Face Normals: A Counterexample (2005) (0)
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs (2017) (0)
Distant Representatives for Rectangles in the Plane (2021) (0)
Triangulating Planar Graphs While Keeping the Pathwidth Small (2015) (0)
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs (2019) (0)
Dihedral angles and orthogonal polyhedra (2013) (0)
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time (2021) (0)
Drawing Halin-graphs with small height (2020) (0)
EPG-representations with small grid-size (cid:63) (2018) (0)
Improved Approximation Algorithms for Segment Minimization in Intensity Modulated Radiation Therapy (2009) (0)
Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) (2018) (0)
Algorithms and Data Structures (2013) (0)
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation (2018) (0)
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth (2020) (0)
View Point Sele tion for Silhouettes ofConvex Polyhedra ? (2008) (0)
Msn-support Help (2001) (0)
Generalized LR-drawings of trees (2021) (0)
Graph Drawing and Network Visualization (2018) (0)
Guest Editors' Foreword (2019) (0)
Optimum-width upward order-preserving poly-line drawings of trees (2015) (0)
Straightening out planar poly-line drawings (2014) (0)
Integral Unit Bar-Visibility Graphs (2018) (0)
On computing the vertex connectivity of 1-plane graphs (2022) (0)
T . Biedl and P . Kindermann 23 : 3 Hamiltonian paths and Tutte paths (2019) (0)
Rectangle Breaking in Grids (1997) (0)
Large Matchings in Maximal 1-planar graphs (2023) (0)
Drawing complete outer-1-planar graphs in linear area (2022) (0)
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings (2017) (0)

This paper list is powered by the following services:

Other Resources About Therese Biedl

en.wikipedia.org

What Schools Are Affiliated With Therese Biedl?

Therese Biedl is affiliated with the following schools: