New Lower Bounds for Orthogonal Graph Drawings. - Therese C. Biedl (GD, 1995)

Improved Orthogonal Drawings of 3-graphs. - Therese C. Biedl (CCCG, 1996)

Optimal Orthogonal Drawings of Connected Plane Graphs. - Therese C. Biedl (CCCG, 1996)

Optimal Orthogonal Drawings of Triconnected Plane Graphs. - Therese C. Biedl (SWAT, 1996)

Area-Efficient Static and Incremental Graph Drawings. - Therese C. Biedl; Michael Kaufmann 001 (ESA, 1997)

Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (GD, 1997)

On Triangulating Planar Graphs Under the Four-Connectivity Constraint. - Therese Biedl; Goos Kant; Michael Kaufmann 001 (Algorithmica, 1997)

On reconfiguring tree linkages: Trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (CCCG, 1998)

Unfolding some classes of orthogonal polyhedra. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Mark H. Overmars; Joseph O'Rourke; Steve Robbins; Sue Whitesides (CCCG, 1998)

Hiding disks in folded polygons. - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Anna Lubiw; Godfried T. Toussaint (CCCG, 1998)

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). - Pankaj K. Agarwal; Therese Biedl; Sylvain Lazard; Steve Robbins; Subhash Suri; Sue Whitesides (SCG, 1998)

Drawing Planar Partitions I: LL-Drawings and LH-Drawings. - Therese C. Biedl (SCG, 1998)

Three Approaches to 3D-Orthogonal Box-Drawings. - Therese C. Biedl (GD, 1998)

Graph Multidrawing: Finding Nice Drawings Without Defining Nice. - Therese Biedl; Joe Marks; Kathy Ryall; Sue Whitesides (GD, 1998)

Drawing Planar Partitions II: HH-Drawings. - Therese Biedl; Michael Kaufmann 001; Petra Mutzel (WG, 1998)

A better heuristic for orthogonal graph drawings. - Therese Biedl; Goos Kant (Comput. Geom., 1998)

Relating Bends and Size in Orthogonal Graph Drawings. - Therese Biedl (Inf. Process. Lett., 1998)

New Lower Bounds For Orthogonal Drawings. - Therese C. Biedl (J. Graph Algorithms Appl., 1998)

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. - Therese Biedl; Anna Bretscher; Henk Meijer (GD, 1999)

Convexifying Monotone Polygons. - Therese C. Biedl; Erik D. Demaine; Sylvain Lazard; Steven M. Robbins; Michael A. Soss (ISAAC, 1999)

Locked and Unlocked Polygonal Chains in 3D. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Mark H. Overmars; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (SODA, 1999)

Bounds for Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (J. Graph Algorithms Appl., 1999)

1-bend 3-D orthogonal drawings: two open problems solved. - Therese Biedl (CCCG, 2000)

Simplifying Flow Networks. - Therese C. Biedl; Brona Brejová; Tomás Vinar (MFCS, 2000)

The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. - Therese C. Biedl; Brendan Madden; Ioannis G. Tollis (Int. J. Comput. Geom. Appl., 2000)

Graph-Drawing Contest Report. - Therese Biedl; Franz-Josef Brandenburg (GD, 2001)

Orthogonal Drawings with Few Layers. - Therese Biedl; John R. Johansen; Thomas C. Shermer; David R. Wood (GD, 2001)

Linear reductions of maximum matching. - Therese Biedl (SODA, 2001)

The DFS-heuristic for orthogonal graph drawing. - Therese Biedl (Comput. Geom., 2001)

The Complexity of Clickomania - Therese C. Biedl; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Lars Jacobsen; J. Ian Munro (CoRR, 2001)

Locked and Unlocked Polygonal Chains in Three Dimensions. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Mark H. Overmars; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Comput. Geom., 2001)

Efficient Algorithms for Petersen's Matching Theorem. - Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw (J. Algorithms, 2001)

1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. - Therese Biedl (J. Graph Algorithms Appl., 2001)

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Paul Nijjar; Ryuhei Uehara; Ming-wei Wang (CCCG, 2002)

Drawing k2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (CCCG, 2002)

Searching for the center of a circle. - Therese Biedl; Masud Hasan; Joseph Douglas Horton; Alejandro López-Ortiz; Tomás Vinar (CCCG, 2002)

Drawing Outer-Planar Graphs in O(n log n) Area. - Therese Biedl (GD, 2002)

A note on reconfiguring tree linkages: trees can lock. - Therese Biedl; Erik D. Demaine; Martin L. Demaine; Sylvain Lazard; Anna Lubiw; Joseph O'Rourke; Steve Robbins; Ileana Streinu; Godfried T. Toussaint; Sue Whitesides (Discret. Appl. Math., 2002)

Balanced k-colorings. - Therese C. Biedl; Eowyn Cenek; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer; Ming-wei Wang (Discret. Math., 2002)

Curvature-Constrained Shortest Paths in a Convex Polygon. - Pankaj K. Agarwal; Therese Biedl; Sylvain Lazard; Steve Robbins; Subhash Suri; Sue Whitesides (SIAM J. Comput., 2002)

Parallel morphing of trees and cycles. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (CCCG, 2003)

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. - Therese Biedl; Erik D. Demaine; Alexander Golynski; Joseph Douglas Horton; Alejandro López-Ortiz; Guillaume Poirier; Claude-Guy Quimper (ESA, 2003)

Drawing K2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (Inf. Process. Lett., 2003)

Palindrome recognition using a multidimensional tape. - Therese Biedl; Jonathan F. Buss; Erik D. Demaine; Martin L. Demaine; Mohammad Taghi Hajiaghayi; Tomás Vinar (Theor. Comput. Sci., 2003)

When can a graph form an orthogonal polyhedron? - Therese Biedl; Burkay Genç (CCCG, 2004)

Hexagonal Grid Drawings: Algorithms and Lower Bounds. - Shabnam Aziza; Therese Biedl (GD, 2004)

Angles and Lengths in Reconfigurations of Polygons and Polyhedra. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (MFCS, 2004)

Fun-Sort–or the chaos of unordered binary search. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Rudolf Fleischer; Mordecai J. Golin; James A. King; J. Ian Munro (Discret. Appl. Math., 2004)

Tight bounds on maximal and maximum matchings. - Therese Biedl; Erik D. Demaine; Christian A. Duncan; Rudolf Fleischer; Stephen G. Kobourov (Discret. Math., 2004)

Finding hidden independent sets in interval graphs. - Therese Biedl; Brona Brejová; Erik D. Demaine; Angèle M. Hamel; Alejandro López-Ortiz; Tomás Vinar (Theor. Comput. Sci., 2004)

The complexity of domino tiling. - Therese Biedl (CCCG, 2005)

Drawing planar bipartite graphs with small area. - Therese Biedl; Franz-Josef Brandenburg (CCCG, 2005)

Complexity of Octagonal and Rectangular Cartograms. - Therese Biedl; Burkay Genç (CCCG, 2005)

Cross-Stitching Using Little Thread. - Therese Biedl; Joseph Douglas Horton; Alejandro López-Ortiz (CCCG, 2005)

Morphing Polyhedra Preserving Face Normals: A Counterexample. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (CCCG, 2005)

Crossings and Permutations. - Therese Biedl; Franz-Josef Brandenburg; Xiaotie Deng (GD, 2005)

Morphing Planar Graphs While Preserving Edge Directions. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (GD, 2005)

When can a net fold to a polyhedron? - Therese Biedl; Anna Lubiw; Julie Sun (Comput. Geom., 2005)

A note on 3D orthogonal graph drawing. - Therese Biedl; Timothy M. Chan (Discret. Appl. Math., 2005)

Balanced vertex-orderings of graphs. - Therese Biedl; Timothy M. Chan; Yashar Ganjali; Mohammad Taghi Hajiaghayi; David R. Wood (Discret. Appl. Math., 2005)

Bounded-Degree Independent Sets in Planar Graphs. - Therese Biedl; Dana F. Wilkinson (Theory Comput. Syst., 2005)

Partitions of Graphs into Trees. - Therese Biedl; Franz-Josef Brandenburg (GD, 2006)

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. - Therese Biedl; Torsten Thiele; David R. Wood (Algorithmica, 2006)

Polygons Needing Many Flipturns. - Therese Biedl (Discret. Comput. Geom., 2006)

Improved Layouts of the Multigrid Network. - Shabnam Aziza; Therese Biedl (CCCG, 2007)

Realizations of Hexagonal Graph Representations. - Therese Biedl (CCCG, 2007)

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (FSTTCS, 2007)

Cauchy's Theorem and Edge Lengths of Convex Polyhedra. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (WADS, 2007)

Edge-Intersection Graphs of k-Bend Paths in Grids. - Therese Biedl; Michal Stern (COCOON, 2009)

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. - Therese Biedl; Burkay Genç (ESA, 2009)

Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. - Therese Biedl (GD, 2009)

Morphing polyhedra with parallel faces: Counterexamples. - Therese Biedl; Anna Lubiw; Michael J. Spriggs (Comput. Geom., 2009)

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization - Therese Biedl; Stephane Durocher; Holger H. Hoos; Shuang Luan; Jared Saia; Maxwell Young (CoRR, 2009)

On the complexity of crossings in permutations. - Therese Biedl; Franz-Josef Brandenburg; Xiaotie Deng (Discret. Math., 2009)

Sorting with networks of data structures. - Therese Biedl; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; J. Ian Munro (Discret. Appl. Math., 2010)

On edge-intersection graphs of k-bend paths in grids. - Therese Biedl; Michal Stern (Discret. Math. Theor. Comput. Sci., 2010)

Reconstructing hv-convex multi-coloured polyominoes. - Adam Bains; Therese Biedl (Theor. Comput. Sci., 2010)

Drawing some planar graphs with integer edge-lengths. - Therese Biedl (CCCG, 2011)

Guarding polyominoes. - Therese Biedl; Mohammad Tanvir Irfan; Justin Iwerks; Joondong Kim; Joseph S. B. Mitchell (SCG, 2011)

Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. - Soroush Alamdari; Therese Biedl (GD, 2011)

Orthogonal Cartograms with Few Corners Per Face. - Therese Biedl; Lesvia Elena Ruiz Velázquez (WADS, 2011)

Reconstructing orthogonal polyhedra from putative vertex sets. - Therese Biedl; Burkay Genç (Comput. Geom., 2011)

Efficient view point selection for silhouettes of convex polyhedra. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (Comput. Geom., 2011)

Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs. - Therese Biedl (Discret. Comput. Geom., 2011)

Stoker's Theorem for Orthogonal Polyhedra. - Therese Biedl; Burkay Genç (Int. J. Comput. Geom. Appl., 2011)

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (Int. J. Comput. Geom. Appl., 2011)

A note on improving the performance of approximation algorithms for radiation therapy. - Therese Biedl; Stephane Durocher; Holger H. Hoos; Shuang Luan; Jared Saia; Maxwell Young (Inf. Process. Lett., 2011)

Reconstructing polygons from scanner data. - Therese Biedl; Stephane Durocher; Jack Snoeyink (Theor. Comput. Sci., 2011)

The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs. - Terry Anderson; Therese Biedl (FUN, 2012)

Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. - Soroush Alamdari; Therese Biedl (GD, 2012)

Drawing Planar Graphs on Points Inside a Polygon. - Therese Biedl; Peter Floderus (MFCS, 2012)

A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. - Therese Biedl (WAOA, 2012)

The Art Gallery Theorem for Polyominoes. - Therese Biedl; Mohammad Tanvir Irfan; Justin Iwerks; Joondong Kim; Joseph S. B. Mitchell (Discret. Comput. Geom., 2012)

Proportional Contact Representations of Planar Graphs. - Md. Jawaherul Alam; Therese Biedl; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov (J. Graph Algorithms Appl., 2012)

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. - Therese Biedl; Thomas Bläsius; Benjamin Niedermann; Martin Nöllenburg; Roman Prutkin; Ignaz Rutter (GD, 2013)

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. - Therese Biedl; Martin Held; Stefan Huber 001 (ISVD, 2013)

Smart-Grid Electricity Allocation via Strip Packing with Slicing. - Soroush Alamdari; Therese Biedl; Timothy M. Chan; Elyot Grant; Krishnam Raju Jampani; Srinivasan Keshav; Anna Lubiw; Vinayak Pathak (WADS, 2013)

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. - Muhammad Jawaherul Alam; Therese Biedl; Stefan Felsner; Andreas Gerasch; Michael Kaufmann 001; Stephen G. Kobourov (Algorithmica, 2013)

Drawing planar 3-trees with given face areas. - Therese Biedl; Lesvia Elena Ruiz Velázquez (Comput. Geom., 2013)

Transforming planar graph drawings while maintaining height. - Therese Biedl (CoRR, 2013)

Trees and co-trees with constant maximum degree in planar 3-connected graphs. - Therese Biedl (CoRR, 2013)

Dihedral angles and orthogonal polyhedra. - Therese Biedl; Martin Derka; Stephen Kiazyk; Anna Lubiw; Hamideh Vosoughpour (CoRR, 2013)

Faster optimal algorithms for segment minimization with small maximal value. - Therese Biedl; Stephane Durocher; Céline Engelbeen; Samuel Fiorini; Maxwell Young (Discret. Appl. Math., 2013)

Computing Cartograms with Optimal Complexity. - Md. Jawaherul Alam; Therese Biedl; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Torsten Ueckerdt (Discret. Comput. Geom., 2013)

The Point-Set Embeddability Problem for Plane graphs. - Therese Biedl; Martin Vatshelle (Int. J. Comput. Geom. Appl., 2013)

Morphing orthogonal planar graph drawings. - Therese Biedl; Anna Lubiw; Mark Petrick; Michael J. Spriggs (ACM Trans. Algorithms, 2013)

Turning Orthogonally Convex Polyhedra into Orthoballs. - Fidel Barrera-Cruz; Therese Biedl; Martin Derka; Stephen Kiazyk; Anna Lubiw; Hamideh Vosoughpour (CCCG, 2014)

Height-Preserving Transformations of Planar Graph Drawings. - Therese Biedl (GD, 2014)

On Area-Optimal Planar Graph Drawings. - Therese Biedl (ICALP (1), 2014)

Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs. - Therese Biedl (SWAT, 2014)

Orthogonal cartograms with at most 12 corners per face. - Therese Biedl; Lesvia Elena Ruiz Velázquez (Comput. Geom., 2014)

Straightening out planar poly-line drawings. - Therese Biedl (CoRR, 2014)

1-String CZ-Representation of Planar Graphs. - Therese Biedl; Martin Derka (CoRR, 2014)

1-string B1-VPG-representations of planar partial 3-trees and some subclasses. - Therese Biedl; Martin Derka (CCCG, 2015)

1-String B_2-VPG Representation of Planar Graphs. - Therese Biedl; Martin Derka (SoCG, 2015)

Representing Directed Trees as Straight Skeletons. - Oswin Aichholzer; Therese Biedl; Thomas Hackl; Martin Held; Stefan Huber 001; Peter Palfrader; Birgit Vogtenhuber (GD, 2015)

Small-Area Orthogonal Drawings of 3-Connected Graphs. - Therese Biedl; Jens M. Schmidt (GD, 2015)

Triangulating Planar Graphs While Keeping the Pathwidth Small. - Therese Biedl (WG, 2015)

Weighted straight skeletons in the plane. - Therese Biedl; Martin Held; Stefan Huber 001; Dominik Kaaser; Peter Palfrader (Comput. Geom., 2015)

Reprint of: Weighted straight skeletons in the plane. - Therese Biedl; Martin Held; Stefan Huber 001; Dominik Kaaser; Peter Palfrader (Comput. Geom., 2015)

Optimum-width upward drawings of trees I: Rooted pathwidth. - Therese Biedl (CoRR, 2015)

Optimum-width upward order-preserving poly-line drawings of trees. - Therese Biedl (CoRR, 2015)

$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. - Therese Biedl; Martin Derka (CoRR, 2015)

DAG-width of Control Flow Graphs with Applications to Model Checking. - Therese Biedl; Sebastian Fischmeister; Neeraj Kumar 004 (CoRR, 2015)

On triangulating k-outerplanar graphs. - Therese Biedl (Discret. Appl. Math., 2015)

A simple algorithm for computing positively weighted straight skeletons of monotone polygons. - Therese Biedl; Martin Held; Stefan Huber 001; Dominik Kaaser; Peter Palfrader (Inf. Process. Lett., 2015)

Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Saeed Mehrabi 001; Ziting Yu (CCCG, 2016)

Realizing Farthest-Point Voronoi Diagrams. - Therese Biedl; Carsten Grimm; Leonidas Palios; Jonathan Richard Shewchuk; Sander Verdonschot (CCCG, 2016)

Rectangle-of-influence triangulations. - Therese Biedl; Anna Lubiw; Saeed Mehrabi 001; Sander Verdonschot (CCCG, 2016)

On Visibility Representations of Non-Planar Graphs. - Therese Biedl; Giuseppe Liotta; Fabrizio Montecchiani (SoCG, 2016)

On r-Guarding Thin Orthogonal Polygons. - Therese Biedl; Saeed Mehrabi 001 (ISAAC, 2016)

Planar Matchings for Weighted Straight Skeletons. - Therese Biedl; Stefan Huber 001; Peter Palfrader (Int. J. Comput. Geom. Appl., 2016)

The (3, 1)-ordering for 4-connected planar triangulations. - Therese Biedl; Martin Derka (J. Graph Algorithms Appl., 2016)

1-string B2-VPG representation of planar graphs. - Therese Biedl; Martin Derka (J. Comput. Geom., 2016)

Upward Order-Preserving 8-Grid-Drawings of Binary Trees. - Therese Biedl (CCCG, 2017)

Packing Boundary-Anchored Rectangles. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (CCCG, 2017)

On Guarding Orthogonal Polygons with Bounded Treewidth. - Therese Biedl; Saeed Mehrabi 001 (CCCG, 2017)

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. - Therese Biedl; Timothy M. Chan; Martin Derka; Kshitij Jain 001; Anna Lubiw (GD, 2017)

EPG-representations with Small Grid-Size. - Therese Biedl; Martin Derka; Vida Dujmovic; Pat Morin (GD, 2017)

Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. - Therese Biedl; Veronika Irvine (GD, 2017)

Grid-Obstacle Representations with Connections to Staircase Guarding. - Therese Biedl; Saeed Mehrabi 001 (GD, 2017)

On Upward Drawings of Trees on a Given Grid. - Therese Biedl; Debajyoti Mondal (GD, 2017)

Order-Preserving 1-String Representations of Planar Graphs. - Therese Biedl; Martin Derka (SOFSEM, 2017)

A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. - Therese Biedl; Philippe Demontigny (WADS, 2017)

Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. - Therese Biedl; Martin Derka (WADS, 2017)

On Guarding Orthogonal Polygons with Sliding Cameras. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour (WALCOM, 2017)

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. - Therese Biedl; Debajyoti Mondal (CoRR, 2017)

4-connected planar graphs are in B3-EPG. - Therese Biedl; Claire Pennarun (CoRR, 2017)

Ideal Drawings of Rooted Trees With Approximately Optimal Width. - Therese Biedl (J. Graph Algorithms Appl., 2017)

Non-aligned Drawings of Planar Graphs. - Therese Biedl; Claire Pennarun (J. Graph Algorithms Appl., 2017)

Integral Unit Bar-Visibility Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Philipp Kindermann; Anurag Murty Naredla; Alexi Turcotte (CCCG, 2018)

Rollercoasters and Caterpillars. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (ICALP, 2018)

Partitioning Orthogonal Histograms into Rectangular Boxes. - Therese Biedl; Martin Derka; Veronika Irvine; Anna Lubiw; Debajyoti Mondal; Alexi Turcotte (LATIN, 2018)

On the Size of Outer-String Representations. - Therese Biedl; Ahmad Biniaz; Martin Derka (SWAT, 2018)

Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). - Therese Biedl; Andreas Kerren (CoRR, 2018)

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. - Therese Biedl; Giuseppe Liotta; Fabrizio Montecchiani (Discret. Comput. Geom., 2018)

Reconstructing a Polyhedron between Polygons in Parallel Slices. - Therese Biedl; Pavle Bulatovic; Veronika Irvine; Anna Lubiw; Owen D. Merkel; Anurag Murty Naredla (CCCG, 2019)

Homotopy Height, Grid-Major Height and Graph-Drawing Height. - Therese Biedl; Erin Wolf Chambers; David Eppstein; Arnaud de Mesmay; Tim Ophelders (GD, 2019)

Line and Plane Cover Numbers Revisited. - Therese Biedl; Stefan Felsner; Henk Meijer; Alexander Wolff 001 (GD, 2019)

Finding Tutte Paths in Linear Time. - Therese Biedl; Philipp Kindermann (ICALP, 2019)

Maximum Matchings and Minimum Blocking Sets in varTheta _6 -Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (WG, 2019)

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. - Therese Biedl; Timothy M. Chan; Stephanie Lee; Saeed Mehrabi 001; Fabrizio Montecchiani; Hamideh Vosoughpour; Ziting Yu (Algorithmica, 2019)

Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (CoRR, 2019)

Finding big matchings in planar graphs quickly. - Therese Biedl (CoRR, 2019)

Quasiperiodic bobbin lace patterns. - Veronika Irvine; Therese Biedl; Craig S. Kaplan (CoRR, 2019)

Are highly connected 1-planar graphs Hamiltonian? - Therese Biedl (CoRR, 2019)

Guest Editors' Foreword. - Therese Biedl; Andreas Kerren (J. Graph Algorithms Appl., 2019)

Rollercoasters: Long Sequences without Short Runs. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (SIAM J. Discret. Math., 2019)

Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (MFCS, 2020)

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. - Therese Biedl; Fabian Klute (WG, 2020)

Crossing Number for Graphs with Bounded Pathwidth. - Therese Biedl; Markus Chimani; Martin Derka; Petra Mutzel (Algorithmica, 2020)

Packing boundary-anchored rectangles and squares. - Therese Biedl; Ahmad Biniaz; Anil Maheshwari; Saeed Mehrabi 001 (Comput. Geom., 2020)

On Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Jirí Fiala 001; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (CoRR, 2020)

Building a larger class of graphs for efficient reconfiguration of vertex colouring. - Therese Biedl; Anna Lubiw; Owen D. Merkel (CoRR, 2020)

Segment representations with small resolution. - Therese Biedl (Inf. Process. Lett., 2020)

Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). - Johannes Batzill; Therese Biedl (J. Graph Algorithms Appl., 2020)

Generalized LR-Drawings of Trees. - Therese Biedl; Giuseppe Liotta; Jayson Lynch; Fabrizio Montecchiani (CCCG, 2021)

Distant Representatives for Rectangles in the Plane. - Therese Biedl; Anna Lubiw; Anurag Murty Naredla; Peter Dominik Ralbovsky; Graeme Stroud (ESA, 2021)

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. - Sam Barr; Therese Biedl (ISAAC, 2021)

All Subgraphs of a Wheel Are 5-Coupled-Choosable. - Sam Barr; Therese Biedl (IWOCA, 2021)

Dispersion for Intervals: A Geometric Approach. - Therese Biedl; Anna Lubiw; Anurag Murty Naredla; Peter Dominik Ralbovsky; Graeme Stroud (SOSA, 2021)

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. - Therese Biedl; Saeed Mehrabi 001 (Algorithmica, 2021)

Minimum ply covering of points with disks and squares. - Therese Biedl; Ahmad Biniaz; Anna Lubiw (Comput. Geom., 2021)

Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. - Therese Biedl; Karthik Murali 001 (CoRR, 2021)

A note on 1-planar graphs with minimum degree 7. - Therese Biedl (Discret. Appl. Math., 2021)

Drawing complete outer-1-planar graphs in linear area. - Therese Biedl (CCCG, 2022)

Visibility Representations of Toroidal and Klein-bottle Graphs. - Therese Biedl (GD, 2022)

Reconfiguration of Non-crossing Spanning Trees. - Oswin Aichholzer; Brad Ballinger; Therese Biedl; Mirela Damian; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Josef Tkadlec; Yushi Uno (CoRR, 2022)

Horton-Strahler number, rooted pathwidth and upward drawings of trees. - Therese Biedl (Inf. Process. Lett., 2022)

Drawing outer-1-planar graphs revisited. - Therese Biedl (J. Graph Algorithms Appl., 2022)

Drawing Halin-graphs with small height. - Therese Biedl; Milap Sheth (J. Graph Algorithms Appl., 2022)

Matchings in 1-planar graphs with large minimum degree. - Therese Biedl; John Wittnebel (J. Graph Theory, 2022)

On the complexity of embedding in graph products. - Therese Biedl; David Eppstein; Torsten Ueckerdt (CCCG, 2023)

On Computing the Vertex Connectivity of 1-Plane Graphs. - Therese Biedl; Karthik Murali 001 (ICALP, 2023)

Finding maximum matchings in RDV graphs efficiently. - Therese Biedl; Prashant Gokhale (CCCG, 2024)

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. - Therese Biedl; Prosenjit Bose; Karthik Murali 001 (ESA, 2024)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

Constrained Outer-String Representations. - Therese Biedl; Sabine Cornelsen; Jan Kratochvíl; Ignaz Rutter (GD, 2024)

Morphing Planar Graph Drawings via Orthogonal Box Drawings. - Therese Biedl; Anna Lubiw; Jack Spalding-Jamieson (GD, 2024)

On the Independence Number of 1-Planar Graphs. - Therese Biedl; Prosenjit Bose; Babak Miraftab (SWAT, 2024)

Improved Outerplanarity Bounds for Planar Graphs. - Therese Biedl; Debajyoti Mondal (WG, 2024)

On the d-independence number in 1-planar graphs. - Therese Biedl; Prosenjit Bose; Babak Miraftab (CoRR, 2024)

The basis number of 1-planar graphs. - Saman Bazargani; Therese Biedl; Prosenjit Bose; Anil Maheshwari; Babak Miraftab (CoRR, 2024)

Optimal-area visibility representations of outer-1-plane graphs. - Therese Biedl; Giuseppe Liotta; Jayson Lynch; Fabrizio Montecchiani (J. Comput. Geom., 2024)

Finding a Shortest Curve That Separates Few Objects from Many. - Therese Biedl; Éric Colin de Verdière; Fabrizio Frati; Anna Lubiw; Günter Rote (SoCG, 2025)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. - Therese Biedl; Stephane Durocher; Debajyoti Mondal; Rahnuma Islam Nishat; Bastien Rivier (WALCOM, 2025)

Large matchings in maximal 1-planar graphs. - Therese Biedl; John Wittnebel (Discret. Math., 2025)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter (Discret. Math. Theor. Comput. Sci., 2025)

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited). - Therese Biedl (CoRR, 2025)

Rectangular Duals on the Cylinder and the Torus. - Therese Biedl; Philipp Kindermann; Jonathan Klawitter (CoRR, 2025)

Sweeping x-monotone pseudolines. - Therese Biedl; Erin W. Chambers; Irina Kostitsyna; Günter Rote (CoRR, 2025)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm. - Therese Biedl (CoRR, 2025)