Therese C. Biedl

ORCID

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 117

Top Venues

CoRR

Graph Drawing

CCCG

J. Graph Algorithms Appl.

Publications

Therese C. Biedl
Drawing outer-1-planar graphs revisited. J. Graph Algorithms Appl. 26 (1) (2022)
Therese C. Biedl, John Wittnebel
Matchings in 1-planar graphs with large minimum degree. J. Graph Theory 99 (2) (2022)
Therese C. Biedl
Horton-Strahler number, rooted pathwidth and upward drawings of trees. Inf. Process. Lett. 175 (2022)
Therese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
Dispersion for Intervals: A Geometric Approach. SOSA (2021)
Sam Barr, Therese C. Biedl
All Subgraphs of a Wheel Are 5-Coupled-Choosable. IWOCA (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-area visibility representations of outer-1-plane graphs. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-drawings of trees. CoRR (2021)
Therese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
Distant Representatives for Rectangles in the Plane. ESA (2021)
Therese C. Biedl, Saeed Mehrabi
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. Algorithmica 83 (2) (2021)
Sam Barr, Therese C. Biedl
All Subgraphs of a Wheel are 5-Coupled-Choosable. CoRR (2021)
Therese C. Biedl
A note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 289 (2021)
Therese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
Distant Representatives for Rectangles in the Plane. CoRR (2021)
Sam Barr, Therese C. Biedl
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. CoRR (2021)
Sam Barr, Therese C. Biedl
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ISAAC (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-Drawings of Trees. CCCG (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Graph Drawing (2021)
Therese C. Biedl, Karthik Murali
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. CoRR (2021)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum ply covering of points with disks and squares. Comput. Geom. 94 (2021)
Johannes Batzill, Therese C. Biedl
Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). J. Graph Algorithms Appl. 24 (1) (2020)
Therese C. Biedl, Anna Lubiw, Owen D. Merkel
Building a larger class of graphs for efficient reconfiguration of vertex colouring. CoRR (2020)
Therese C. Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
Layered Fan-Planar Graph Drawings. MFCS (2020)
Therese C. Biedl
Segment representations with small resolution. Inf. Process. Lett. 153 (2020)
Therese C. Biedl, Milap Sheth
Drawing Halin-graphs with small height. CoRR (2020)
Therese C. Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
Reconstructing a Polyhedron between Polygons in Parallel Slices. CoRR (2020)
Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82 (2) (2020)
Therese C. Biedl, Fabian Klute
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG (2020)
Therese C. Biedl, Fabian Klute
Finding large matchings in 1-planar graphs of minimum degree 3. CoRR (2020)
Therese C. Biedl
Drawing outer-1-planar graphs revisited. CoRR (2020)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing boundary-anchored rectangles and squares. Comput. Geom. 88 (2020)
Therese C. Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
On Layered Fan-Planar Graph Drawings. CoRR (2020)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy Height, Grid-Major Height and Graph-Drawing Height. Graph Drawing (2019)
Therese C. Biedl, Philipp Kindermann
Finding Tutte Paths in Linear Time. ICALP (2019)
Veronika Irvine, Therese C. Biedl, Craig S. Kaplan
Quasiperiodic bobbin lace patterns. CoRR (2019)
Therese C. Biedl
Are highly connected 1-planar graphs Hamiltonian? CoRR (2019)
Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica 81 (1) (2019)
Therese C. Biedl, Andreas Kerren
Guest Editors' Foreword. J. Graph Algorithms Appl. 23 (3) (2019)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. CoRR (2019)
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
Homotopy height, grid-major height and graph-drawing height. CoRR (2019)
Therese C. Biedl
A note on 1-planar graphs with minimum degree 7. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing Boundary-Anchored Rectangles and Squares. CoRR (2019)
Therese C. Biedl, John Wittnebel
Matchings in 1-planar graphs with large minimum degree. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum Ply Covering of Points with Disks and Squares. CCCG (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG (2019)
Therese C. Biedl, Ahmad Biniaz, Anna Lubiw
Minimum Ply Covering of Points with Disks and Squares. CoRR (2019)
Therese C. Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG (2019)
Therese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
Line and Plane Cover Numbers Revisited. Graph Drawing (2019)
Therese C. Biedl
Finding big matchings in planar graphs quickly. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
-Graphs. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33 (2) (2019)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters and Caterpillars. ICALP (2018)
Therese C. Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN (2018)
Therese C. Biedl, Ahmad Biniaz, Martin Derka
On the Size of Outer-String Representations. SWAT (2018)
Therese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
Rollercoasters and Caterpillars. CoRR (2018)
Therese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. Discret. Comput. Geom. 60 (2) (2018)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte
Integral Unit Bar-Visibility Graphs. CCCG (2018)
Therese C. Biedl, Andreas Kerren
Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). CoRR (2018)
Therese C. Biedl, Philipp Kindermann
Finding Tutte paths in linear time. CoRR (2018)
Therese C. Biedl
Segment representations with small resolution. CoRR (2018)
Therese C. Biedl
Ideal Drawings of Rooted Trees With Approximately Optimal Width. J. Graph Algorithms Appl. 21 (4) (2017)
Therese C. Biedl, Claire Pennarun
Non-aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 21 (5) (2017)
Therese C. Biedl, Saeed Mehrabi
Grid-Obstacle Representations with Connections to Staircase Guarding. CoRR (2017)
Therese C. Biedl, Veronika Irvine
Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs. CoRR (2017)
Therese C. Biedl, Martin Derka, Vida Dujmovic, Pat Morin
EPG-representations with small grid-size. CoRR (2017)
Therese C. Biedl, Martin Derka
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS (2017)
Therese C. Biedl, Veronika Irvine
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. Graph Drawing (2017)
Therese C. Biedl, Saeed Mehrabi
Grid-Obstacle Representations with Connections to Staircase Guarding. Graph Drawing (2017)
Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM (2017)
Therese C. Biedl, Saeed Mehrabi
On Guarding Orthogonal Polygons with Bounded Treewidth. CCCG (2017)
Therese C. Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR (2017)
Therese C. Biedl, Philippe Demontigny
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. WADS (2017)
Therese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
Packing Boundary-Anchored Rectangles. CCCG (2017)
Therese C. Biedl, Martin Derka, Vida Dujmovic, Pat Morin
EPG-representations with Small Grid-Size. Graph Drawing (2017)
Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC (2017)
Therese C. Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. Graph Drawing (2017)
Therese C. Biedl, Debajyoti Mondal
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. CoRR (2017)
Therese C. Biedl, Martin Derka
Order-Preserving 1-String Representations of Planar Graphs. SOFSEM (2017)
Therese C. Biedl
Upward Order-Preserving 8-Grid-Drawings of Binary Trees. CCCG (2017)
Therese C. Biedl, Debajyoti Mondal
On Upward Drawings of Trees on a Given Grid. Graph Drawing (2017)
Therese C. Biedl, Claire Pennarun
-EPG. CoRR (2017)
Therese C. Biedl, Saeed Mehrabi
On Guarding Orthogonal Polygons with Bounded Treewidth. CoRR (2017)
Therese C. Biedl, Debajyoti Mondal
On Upward Drawings of Trees on a Given Grid. CoRR (2017)
Therese C. Biedl, Philippe Demontigny
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. CoRR (2017)
Therese C. Biedl, Martin Derka
-VPG representation of planar graphs. J. Comput. Geom. 7 (2) (2016)
Therese C. Biedl, Claire Pennarun
Non-aligned Drawings of Planar Graphs. Graph Drawing (2016)
Therese C. Biedl, Saeed Mehrabi, Ziting Yu
Sliding k-Transmitters: Hardness and Approximation. CoRR (2016)
Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
On Guarding Orthogonal Polygons with Sliding Cameras. CoRR (2016)
Johannes Batzill, Therese C. Biedl
Order-preserving drawings of trees with approximately optimal height (and small width). CoRR (2016)
Therese C. Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot
Realizing Farthest-Point Voronoi Diagrams. CCCG (2016)
Therese C. Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot
Rectangle-of-influence triangulations. CCCG (2016)
Martin Derka, Therese C. Biedl
Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs. CoRR (2016)
Therese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani
On Visibility Representations of Non-Planar Graphs. SoCG (2016)
Therese C. Biedl, Claire Pennarun
Non-aligned drawings of planar graphs. CoRR (2016)
Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel
Crossing Number for Graphs With Bounded Pathwidth. CoRR (2016)
Therese C. Biedl, Saeed Mehrabi
On r-Guarding Thin Orthogonal Polygons. CoRR (2016)
Therese C. Biedl, Stefan Huber, Peter Palfrader
Planar Matchings for Weighted Straight Skeletons. Int. J. Comput. Geom. Appl. 26 (3-4) (2016)
Therese C. Biedl, Saeed Mehrabi, Ziting Yu
Sliding k-Transmitters: Hardness and Approximation. CCCG (2016)
Therese C. Biedl, Martin Derka
The (3, 1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. 20 (2) (2016)
Therese C. Biedl, Martin Derka
Order-preserving 1-string representations of planar graphs. CoRR (2016)
Therese C. Biedl, Saeed Mehrabi
On r-Guarding Thin Orthogonal Polygons. ISAAC (2016)
Therese C. Biedl
Triangulating planar graphs while keeping the pathwidth small. CoRR (2015)

Therese C. Biedl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Therese C. Biedl