Therese Biedl

According to our database, Therese Biedl authored at least 196 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the complexity of embedding in graph products.

Therese Biedl, David Eppstein, Torsten Ueckerdt

CoRR, 2023

Large Matchings in Maximal 1-planar graphs.

Therese Biedl, John Wittnebel

CoRR, 2023

On Computing the Vertex Connectivity of 1-Plane Graphs.

Therese Biedl, Karthik Murali

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Matchings in 1-planar graphs with large minimum degree.

Therese Biedl, John Wittnebel

J. Graph Theory, 2022

Drawing Halin-graphs with small height.

Therese Biedl, Milap Sheth

J. Graph Algorithms Appl., 2022

Drawing outer-1-planar graphs revisited.

Therese Biedl

J. Graph Algorithms Appl., 2022

Horton-Strahler number, rooted pathwidth and upward drawings of trees.

Therese Biedl

Inf. Process. Lett., 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

Visibility Representations of Toroidal and Klein-bottle Graphs.

Therese Biedl

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Drawing complete outer-1-planar graphs in linear area.

Therese Biedl

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

A note on 1-planar graphs with minimum degree 7.

Therese Biedl

Discret. Appl. Math., 2021

Computing the vertex connectivity of a locally maximal 1-plane graph in linear time.

Therese Biedl, Karthik Murali

CoRR, 2021

Minimum ply covering of points with disks and squares.

Therese Biedl, Ahmad Biniaz, Anna Lubiw

Comput. Geom., 2021

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth.

Therese Biedl, Saeed Mehrabi

Algorithmica, 2021

Dispersion for Intervals: A Geometric Approach.

Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

All Subgraphs of a Wheel Are 5-Coupled-Choosable.

Sam Barr, Therese Biedl

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest.

Sam Barr, Therese Biedl

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Optimal-Area Visibility Representations of Outer-1-Plane Graphs.

Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Distant Representatives for Rectangles in the Plane.

Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Generalized LR-Drawings of Trees.

Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width).

Johannes Batzill, Therese Biedl

J. Graph Algorithms Appl., 2020

Segment representations with small resolution.

Therese Biedl

Inf. Process. Lett., 2020

Building a larger class of graphs for efficient reconfiguration of vertex colouring.

Therese Biedl, Anna Lubiw, Owen D. Merkel

CoRR, 2020

On Layered Fan-Planar Graph Drawings.

Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

CoRR, 2020

Packing boundary-anchored rectangles and squares.

Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi

Comput. Geom., 2020

Crossing Number for Graphs with Bounded Pathwidth.

Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel

Algorithmica, 2020

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.

Therese Biedl, Fabian Klute

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Layered Fan-Planar Graph Drawings.

Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

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

Guest Editors' Foreword.

Therese Biedl, Andreas Kerren

J. Graph Algorithms Appl., 2019

Are highly connected 1-planar graphs Hamiltonian?

Therese Biedl

CoRR, 2019

Quasiperiodic bobbin lace patterns.

Veronika Irvine, Therese Biedl, Craig S. Kaplan

CoRR, 2019

Finding big matchings in planar graphs quickly.

Therese Biedl

CoRR, 2019

Maximum Matchings and Minimum Blocking Sets in Θ₆-Graphs.

Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw

CoRR, 2019

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.

Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu

Algorithmica, 2019

Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.

Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Finding Tutte Paths in Linear Time.

Therese Biedl, Philipp Kindermann

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Line and Plane Cover Numbers Revisited.

Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.

Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Reconstructing a Polyhedron between Polygons in Parallel Slices.

Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.

Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani

Discret. Comput. Geom., 2018

Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018).

Therese Biedl, Andreas Kerren

CoRR, 2018

On the Size of Outer-String Representations.

Therese Biedl, Ahmad Biniaz, Martin Derka

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.

Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Rollercoasters and Caterpillars.

Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Integral Unit Bar-Visibility Graphs.

Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Non-aligned Drawings of Planar Graphs.

Therese Biedl, Claire Pennarun

J. Graph Algorithms Appl., 2017

Ideal Drawings of Rooted Trees With Approximately Optimal Width.

Therese Biedl

J. Graph Algorithms Appl., 2017

4-connected planar graphs are in B₃-EPG.

Therese Biedl, Claire Pennarun

CoRR, 2017

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings.

Therese Biedl, Debajyoti Mondal

CoRR, 2017

On Guarding Orthogonal Polygons with Sliding Cameras.

Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour

Proceedings of the WALCOM: Algorithms and Computation, 2017

Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs.

Therese Biedl, Martin Derka

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.

Therese Biedl, Philippe Demontigny

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Order-Preserving 1-String Representations of Planar Graphs.

Therese Biedl, Martin Derka

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

On Upward Drawings of Trees on a Given Grid.

Therese Biedl, Debajyoti Mondal

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Grid-Obstacle Representations with Connections to Staircase Guarding.

Therese Biedl, Saeed Mehrabi

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs.

Therese Biedl, Veronika Irvine

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

EPG-representations with Small Grid-Size.

Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.

Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Guarding Orthogonal Polygons with Bounded Treewidth.

Therese Biedl, Saeed Mehrabi

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Packing Boundary-Anchored Rectangles.

Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Upward Order-Preserving 8-Grid-Drawings of Binary Trees.

Therese Biedl

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

1-string B₂-VPG representation of planar graphs.

Therese Biedl, Martin Derka

J. Comput. Geom., 2016

The (3, 1)-ordering for 4-connected planar triangulations.

Therese Biedl, Martin Derka

J. Graph Algorithms Appl., 2016

Planar Matchings for Weighted Straight Skeletons.

Therese Biedl, Stefan Huber, Peter Palfrader

Int. J. Comput. Geom. Appl., 2016

On r-Guarding Thin Orthogonal Polygons.

Therese Biedl, Saeed Mehrabi

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On Visibility Representations of Non-Planar Graphs.

Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Rectangle-of-influence triangulations.

Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Realizing Farthest-Point Voronoi Diagrams.

Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Sliding k-Transmitters: Hardness and Approximation.

Therese Biedl, Saeed Mehrabi, Ziting Yu

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

A simple algorithm for computing positively weighted straight skeletons of monotone polygons.

Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader

Inf. Process. Lett., 2015

On triangulating k-outerplanar graphs.

Therese Biedl

Discret. Appl. Math., 2015

DAG-width of Control Flow Graphs with Applications to Model Checking.

Therese Biedl, Sebastian Fischmeister, Neeraj Kumar

CoRR, 2015

$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses.

Therese Biedl, Martin Derka

CoRR, 2015

Optimum-width upward order-preserving poly-line drawings of trees.

Therese Biedl

CoRR, 2015

Optimum-width upward drawings of trees I: Rooted pathwidth.

Therese Biedl

CoRR, 2015

Reprint of: Weighted straight skeletons in the plane.

Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader

Comput. Geom., 2015

Weighted straight skeletons in the plane.

Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader

Comput. Geom., 2015

Triangulating Planar Graphs While Keeping the Pathwidth Small.

Therese Biedl

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Small-Area Orthogonal Drawings of 3-Connected Graphs.

Therese Biedl, Jens M. Schmidt

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Representing Directed Trees as Straight Skeletons.

Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

1-String B_2-VPG Representation of Planar Graphs.

Therese Biedl, Martin Derka

Proceedings of the 31st International Symposium on Computational Geometry, 2015

1-string B1-VPG-representations of planar partial 3-trees and some subclasses.

Therese Biedl, Martin Derka

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

1-String CZ-Representation of Planar Graphs.

Therese Biedl, Martin Derka

CoRR, 2014

Straightening out planar poly-line drawings.

Therese Biedl

CoRR, 2014

Orthogonal cartograms with at most 12 corners per face.

Therese Biedl, Lesvia Elena Ruiz Velázquez

Comput. Geom., 2014

Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs.

Therese Biedl

Proceedings of the Algorithm Theory - SWAT 2014, 2014

On Area-Optimal Planar Graph Drawings.

Therese Biedl

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Height-Preserving Transformations of Planar Graph Drawings.

Therese Biedl

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Turning Orthogonally Convex Polyhedra into Orthoballs.

Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Morphing orthogonal planar graph drawings.

Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs

ACM Trans. Algorithms, 2013

The Point-Set Embeddability Problem for Plane graphs.

Therese Biedl, Martin Vatshelle

Int. J. Comput. Geom. Appl., 2013

Computing Cartograms with Optimal Complexity.

Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt

Discret. Comput. Geom., 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

Dihedral angles and orthogonal polyhedra.

Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour

CoRR, 2013

Trees and co-trees with constant maximum degree in planar 3-connected graphs.

Therese Biedl

CoRR, 2013

Transforming planar graph drawings while maintaining height.

Therese Biedl

CoRR, 2013

Drawing planar 3-trees with given face areas.

Therese Biedl, Lesvia Elena Ruiz Velázquez

Comput. Geom., 2013

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.

Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov

Algorithmica, 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

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input.

Therese Biedl, Martin Held, Stefan Huber

Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

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

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Proportional Contact Representations of Planar Graphs.

Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov

J. Graph Algorithms Appl., 2012

The Art Gallery Theorem for Polyominoes.

Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell

Discret. Comput. Geom., 2012

A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs.

Therese Biedl

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Drawing Planar Graphs on Points Inside a Polygon.

Therese Biedl, Peter Floderus

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs.

Soroush Alamdari, Therese Biedl

Proceedings of the Graph Drawing - 20th International Symposium, 2012

The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs.

Terry Anderson, Therese Biedl

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Reconstructing polygons from scanner data.

Therese Biedl, Stephane Durocher, Jack Snoeyink

Theor. Comput. Sci., 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 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

Stoker's Theorem for Orthogonal Polyhedra.

Therese Biedl, Burkay Genç

Int. J. Comput. Geom. Appl., 2011

Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs.

Therese Biedl

Discret. Comput. Geom., 2011

Efficient view point selection for silhouettes of convex polyhedra.

Therese Biedl, Masud Hasan, Alejandro López-Ortiz

Comput. Geom., 2011

Reconstructing orthogonal polyhedra from putative vertex sets.

Therese Biedl, Burkay Genç

Comput. Geom., 2011

Orthogonal Cartograms with Few Corners Per Face.

Therese Biedl, Lesvia Elena Ruiz Velázquez

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames.

Soroush Alamdari, Therese Biedl

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Guarding polyominoes.

Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Drawing some planar graphs with integer edge-lengths.

Therese Biedl

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Reconstructing hv-convex multi-coloured polyominoes.

Adam Bains, Therese Biedl

Theor. Comput. Sci., 2010

On edge-intersection graphs of k-bend paths in grids.

Therese Biedl, Michal Stern

Discret. Math. Theor. Comput. Sci., 2010

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

2009

On the complexity of crossings in permutations.

Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng

Discret. Math., 2009

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization

Therese C. Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young

CoRR, 2009

Morphing polyhedra with parallel faces: Counterexamples.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Comput. Geom., 2009

Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.

Therese C. Biedl

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.

Therese C. Biedl, Burkay Genç

Proceedings of the Algorithms, 2009

Edge-Intersection Graphs of <i>k</i>-Bend Paths in Grids.

Therese C. Biedl, Michal Stern

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2007

Cauchy's Theorem and Edge Lengths of Convex Polyhedra.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.

Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Realizations of Hexagonal Graph Representations.

Therese C. Biedl

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Improved Layouts of the Multigrid Network.

Shabnam Aziza, Therese C. Biedl

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Polygons Needing Many Flipturns.

Therese C. Biedl

Discret. Comput. Geom., 2006

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume.

Therese C. Biedl, Torsten Thiele, David R. Wood

Algorithmica, 2006

Partitions of Graphs into Trees.

Therese C. Biedl, Franz-Josef Brandenburg

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Bounded-Degree Independent Sets in Planar Graphs.

Therese C. Biedl, Dana F. Wilkinson

Theory Comput. Syst., 2005

Balanced vertex-orderings of graphs.

Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood

Discret. Appl. Math., 2005

A note on 3D orthogonal graph drawing.

Therese C. Biedl, Timothy M. Chan

Discret. Appl. Math., 2005

When can a net fold to a polyhedron?

Therese C. Biedl, Anna Lubiw, Julie Sun

Comput. Geom., 2005

Morphing Planar Graphs While Preserving Edge Directions.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Crossings and Permutations.

Therese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Morphing Polyhedra Preserving Face Normals: A Counterexample.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Cross-Stitching Using Little Thread.

Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Complexity of Octagonal and Rectangular Cartograms.

Therese C. Biedl, Burkay Genç

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Drawing planar bipartite graphs with small area.

Therese C. Biedl, Franz-Josef Brandenburg

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

The complexity of domino tiling.

Therese C. Biedl

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Finding hidden independent sets in interval graphs.

Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar

Theor. Comput. Sci., 2004

Tight bounds on maximal and maximum matchings.

Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov

Discret. Math., 2004

Fun-Sort--or the chaos of unordered binary search.

Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro

Discret. Appl. Math., 2004

Angles and Lengths in Reconfigurations of Polygons and Polyhedra.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Hexagonal Grid Drawings: Algorithms and Lower Bounds.

Shabnam Aziza, Therese C. Biedl

Proceedings of the Graph Drawing, 12th International Symposium, 2004

When can a graph form an orthogonal polyhedron?

Therese C. Biedl, Burkay Genç

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Palindrome recognition using a multidimensional tape.

Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar

Theor. Comput. Sci., 2003

Drawing K_{2, n}: A lower bound.

Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz

Inf. Process. Lett., 2003

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.

Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper

Proceedings of the Algorithms, 2003

Parallel morphing of trees and cycles.

Therese C. Biedl, Anna Lubiw, Michael J. Spriggs

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Curvature-Constrained Shortest Paths in a Convex Polygon.

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides

SIAM J. Comput., 2002

Balanced <i>k</i>-colorings.

Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang

Discret. Math., 2002

A note on reconfiguring tree linkages: trees can lock.

Therese C. 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

Drawing Outer-Planar Graphs in O(n log n) Area.

Therese C. Biedl

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Searching for the center of a circle.

Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Drawing <i>k</i>₂, <i>n</i>: A lower bound.

Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.

Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved.

Therese C. Biedl

J. Graph Algorithms Appl., 2001

Efficient Algorithms for Petersen's Matching Theorem.

Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw

J. Algorithms, 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

Therese C. 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

The Complexity of Clickomania

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro

CoRR, 2001

The DFS-heuristic for orthogonal graph drawing.

Therese C. Biedl

Comput. Geom., 2001

Linear reductions of maximum matching.

Therese C. Biedl

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Orthogonal Drawings with Few Layers.

Therese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graph-Drawing Contest Report.

Therese C. Biedl, Franz-Josef Brandenburg

Proceedings of the Graph Drawing, 9th International Symposium, 2001

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

Simplifying Flow Networks.

Therese C. Biedl, Brona Brejová, Tomás Vinar

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1-bend 3-D orthogonal drawings: two open problems solved.

Therese C. Biedl

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Bounds for Orthogonal 3-D Graph Drawing.

Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath

J. Graph Algorithms Appl., 1999

Locked and Unlocked Polygonal Chains in 3D.

Therese C. 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

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Convexifying Monotone Polygons.

Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles.

Therese C. Biedl, Anna Bretscher, Henk Meijer

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

New Lower Bounds For Orthogonal Drawings.

Therese C. Biedl

J. Graph Algorithms Appl., 1998

Relating Bends and Size in Orthogonal Graph Drawings.

Therese C. Biedl

Inf. Process. Lett., 1998

A better heuristic for orthogonal graph drawings.

Therese C. Biedl, Goos Kant

Comput. Geom., 1998

Drawing Planar Partitions II: HH-Drawings.

Therese C. Biedl, Michael Kaufmann, Petra Mutzel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Graph Multidrawing: Finding Nice Drawings Without Defining Nice.

Therese C. Biedl, Joe Marks, Kathy Ryall, Sue Whitesides

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Three Approaches to 3D-Orthogonal Box-Drawings.

Therese C. Biedl

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Drawing Planar Partitions I: LL-Drawings and LH-Drawings.

Therese C. Biedl

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract).

Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Hiding disks in folded polygons.

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Unfolding some classes of orthogonal polyhedra.

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.

Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

On Triangulating Planar Graphs Under the Four-Connectivity Constraint.

Therese C. Biedl, Goos Kant, Michael Kaufmann

Algorithmica, 1997

Orthogonal 3-D Graph Drawing.

Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Area-Efficient Static and Incremental Graph Drawings.

Therese C. Biedl, Michael Kaufmann

Proceedings of the Algorithms, 1997

1996

Optimal Orthogonal Drawings of Triconnected Plane Graphs.

Therese C. Biedl

Proceedings of the Algorithm Theory, 1996

Optimal Orthogonal Drawings of Connected Plane Graphs.

Therese C. Biedl

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Improved Orthogonal Drawings of 3-graphs.

Therese C. Biedl

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

New Lower Bounds for Orthogonal Graph Drawings.

Therese C. Biedl

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995