Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTherese Biedl
Therese C. Biedl
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c126]Therese Biedl, Karthik Murali:
On Computing the Vertex Connectivity of 1-Plane Graphs. ICALP 2023: 23:1-23:16- [i71]Therese Biedl, John Wittnebel:
Large Matchings in Maximal 1-planar graphs. CoRR abs/2301.01394 (2023) - [i70]Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CoRR abs/2303.17028 (2023) - 2022
- [j69]Therese Biedl
:
Horton-Strahler number, rooted pathwidth and upward drawings of trees. Inf. Process. Lett. 175: 106230 (2022) - [j68]Therese Biedl:
Drawing outer-1-planar graphs revisited. J. Graph Algorithms Appl. 26(1): 59-73 (2022) - [j67]Therese Biedl, Milap Sheth:
Drawing Halin-graphs with small height. J. Graph Algorithms Appl. 26(1): 473-502 (2022) - [j66]Therese Biedl, John Wittnebel:
Matchings in 1-planar graphs with large minimum degree. J. Graph Theory 99(2): 217-230 (2022) - [c125]Therese Biedl:
Drawing complete outer-1-planar graphs in linear area. CCCG 2022: 48-54 - [c124]Therese Biedl:
Visibility Representations of Toroidal and Klein-bottle Graphs. GD 2022: 404-417 - [i69]Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - [i68]Therese Biedl:
Visibility Representations of Toroidal and Klein-bottle Graphs. CoRR abs/2209.00576 (2022) - [i67]Therese Biedl, Karthik Murali:
On computing the vertex connectivity of 1-plane graphs. CoRR abs/2212.06782 (2022) - 2021
- [j65]Therese Biedl, Saeed Mehrabi:
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. Algorithmica 83(2): 641-666 (2021) - [j64]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum ply covering of points with disks and squares. Comput. Geom. 94: 101712 (2021) - [j63]Therese Biedl:
A note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 289: 230-232 (2021) - [c123]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-Drawings of Trees. CCCG 2021: 78-88 - [c122]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. ESA 2021: 17:1-17:18 - [c121]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD 2021: 287-303 - [c120]Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ISAAC 2021: 16:1-16:15 - [c119]Sam Barr, Therese Biedl:
All Subgraphs of a Wheel Are 5-Coupled-Choosable. IWOCA 2021: 78-91 - [c118]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Dispersion for Intervals: A Geometric Approach. SOSA 2021: 37-44 - [i66]Sam Barr, Therese Biedl:
All Subgraphs of a Wheel are 5-Coupled-Choosable. CoRR abs/2102.02918 (2021) - [i65]Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. CoRR abs/2104.12286 (2021) - [i64]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-drawings of trees. CoRR abs/2105.06992 (2021) - [i63]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. CoRR abs/2108.07751 (2021) - [i62]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-area visibility representations of outer-1-plane graphs. CoRR abs/2108.11768 (2021) - [i61]Therese Biedl, Karthik Murali:
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. CoRR abs/2112.06306 (2021) - 2020
- [j62]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82(2): 355-384 (2020) - [j61]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing boundary-anchored rectangles and squares. Comput. Geom. 88: 101610 (2020) - [j60]Therese Biedl:
Segment representations with small resolution. Inf. Process. Lett. 153 (2020) - [j59]Johannes Batzill, Therese Biedl:
Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). J. Graph Algorithms Appl. 24(1): 1-19 (2020) - [c117]Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c116]Therese Biedl, Fabian Klute:
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG 2020: 248-260 - [i60]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i59]Therese Biedl, Fabian Klute:
Finding large matchings in 1-planar graphs of minimum degree 3. CoRR abs/2002.11818 (2020) - [i58]Therese Biedl, Anna Lubiw, Owen D. Merkel:
Building a larger class of graphs for efficient reconfiguration of vertex colouring. CoRR abs/2003.01818 (2020) - [i57]Therese Biedl, Milap Sheth:
Drawing Halin-graphs with small height. CoRR abs/2003.14413 (2020) - [i56]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CoRR abs/2004.05946 (2020) - [i55]Therese Biedl:
Drawing outer-1-planar graphs revisited. CoRR abs/2009.07106 (2020)
2010 – 2019
- 2019
- [j58]Therese 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): 69-97 (2019) - [j57]Therese Biedl, Andreas Kerren:
Guest Editors' Foreword. J. Graph Algorithms Appl. 23(3): 459-461 (2019) - [j56]Therese 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): 845-861 (2019) - [c115]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019: 139-145 - [c114]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CCCG 2019: 226-235 - [c113]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. GD 2019: 409-415 - [c112]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - [c111]Therese Biedl, Philipp Kindermann:
Finding Tutte Paths in Linear Time. ICALP 2019: 23:1-23:14 - [c110]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG 2019: 258-270 - [i54]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. CoRR abs/1901.01476 (2019) - [i53]Therese Biedl:
Finding big matchings in planar graphs quickly. CoRR abs/1902.07812 (2019) - [i52]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CoRR abs/1905.00790 (2019) - [i51]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles and Squares. CoRR abs/1906.11948 (2019) - [i50]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy height, grid-major height and graph-drawing height. CoRR abs/1908.05706 (2019) - [i49]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. CoRR abs/1908.07647 (2019) - [i48]Therese Biedl:
A note on 1-planar graphs with minimum degree 7. CoRR abs/1910.01683 (2019) - [i47]Veronika Irvine, Therese Biedl, Craig S. Kaplan:
Quasiperiodic bobbin lace patterns. CoRR abs/1910.07935 (2019) - [i46]Therese Biedl:
Are highly connected 1-planar graphs Hamiltonian? CoRR abs/1911.02153 (2019) - [i45]Therese Biedl, John Wittnebel:
Matchings in 1-planar graphs with large minimum degree. CoRR abs/1911.04603 (2019) - 2018
- [j55]Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani:
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. Discret. Comput. Geom. 60(2): 345-380 (2018) - [c109]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte:
Integral Unit Bar-Visibility Graphs. CCCG 2018: 230-246 - [c108]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. ICALP 2018: 18:1-18:15 - [c107]Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte:
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN 2018: 146-160 - [c106]Therese Biedl, Ahmad Biniaz, Martin Derka:
On the Size of Outer-String Representations. SWAT 2018: 10:1-10:14 - [e1]Therese Biedl, Andreas Kerren:
Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings. Lecture Notes in Computer Science 11282, Springer 2018, ISBN 978-3-030-04413-8 [contents] - [i44]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. CoRR abs/1801.08565 (2018) - [i43]Therese Biedl, Andreas Kerren:
Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). CoRR abs/1809.03264 (2018) - [i42]Therese Biedl:
Segment representations with small resolution. CoRR abs/1810.07072 (2018) - [i41]Therese Biedl, Philipp Kindermann:
Finding Tutte paths in linear time. CoRR abs/1812.04543 (2018) - 2017
- [j54]Therese Biedl:
Ideal Drawings of Rooted Trees With Approximately Optimal Width. J. Graph Algorithms Appl. 21(4): 631-648 (2017) - [j53]Therese Biedl, Claire Pennarun:
Non-aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. 21(5): 915-937 (2017) - [c105]Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi:
Packing Boundary-Anchored Rectangles. CCCG 2017: 138-143 - [c104]Therese Biedl, Saeed Mehrabi:
On Guarding Orthogonal Polygons with Bounded Treewidth. CCCG 2017: 150-155 - [c103]Therese Biedl:
Upward Order-Preserving 8-Grid-Drawings of Binary Trees. CCCG 2017: 232-237 - [c102]Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. GD 2017: 81-87 - [c101]Therese Biedl, Veronika Irvine:
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. GD 2017: 140-152 - [c100]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with Small Grid-Size. GD 2017: 184-196 - [c99]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD 2017: 305-317 - [c98]Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. GD 2017: 318-325 - [c97]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c96]Therese Biedl, Martin Derka:
Order-Preserving 1-String Representations of Planar Graphs. SOFSEM 2017: 283-294 - [c95]Therese Biedl, Philippe Demontigny:
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. WADS 2017: 145-156 - [c94]Therese Biedl, Martin Derka:
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS 2017: 157-168 - [c93]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM 2017: 54-65 - [i40]Therese Biedl, Philippe Demontigny:
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. CoRR abs/1702.01719 (2017) - [i39]Therese Biedl, Saeed Mehrabi:
On Guarding Orthogonal Polygons with Bounded Treewidth. CoRR abs/1706.02028 (2017) - [i38]Therese Biedl, Saeed Mehrabi:
Grid-Obstacle Representations with Connections to Staircase Guarding. CoRR abs/1708.01903 (2017) - [i37]Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. CoRR abs/1708.09515 (2017) - [i36]Therese Biedl, Debajyoti Mondal:
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. CoRR abs/1708.09560 (2017) - [i35]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with small grid-size. CoRR abs/1708.09749 (2017) - [i34]Therese Biedl, Veronika Irvine:
Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs. CoRR abs/1708.09778 (2017) - [i33]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR abs/1709.01456 (2017) - [i32]Therese Biedl, Claire Pennarun:
4-connected planar graphs are in B3-EPG. CoRR abs/1710.04583 (2017) - 2016
- [j52]Therese Biedl, Stefan Huber, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. Int. J. Comput. Geom. Appl. 26(3-4): 211- (2016) - [j51]Therese Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. 20(2): 347-362 (2016) - [j50]Therese Biedl, Martin Derka:
1-string B2-VPG representation of planar graphs. J. Comput. Geom. 7(2): 191-215 (2016) - [c92]Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot:
Realizing Farthest-Point Voronoi Diagrams. CCCG 2016: 48-56 - [c91]Therese Biedl, Saeed Mehrabi, Ziting Yu:
Sliding k-Transmitters: Hardness and Approximation. CCCG 2016: 63-68 - [c90]Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot:
Rectangle-of-influence triangulations. CCCG 2016: 237-243 - [c89]Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani:
On Visibility Representations of Non-Planar Graphs. SoCG 2016: 19:1-19:16 - [c88]Therese Biedl, Claire Pennarun:
Non-aligned Drawings of Planar Graphs. GD 2016: 131-143 - [c87]Therese Biedl, Saeed Mehrabi:
On r-Guarding Thin Orthogonal Polygons. ISAAC 2016: 17:1-17:13 - [i31]Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. CoRR abs/1604.07099 (2016) - [i30]Therese Biedl, Saeed Mehrabi:
On r-Guarding Thin Orthogonal Polygons. CoRR abs/1604.07100 (2016) - [i29]Therese Biedl, Claire Pennarun:
Non-aligned drawings of planar graphs. CoRR abs/1606.02220 (2016) - [i28]Johannes Batzill, Therese Biedl:
Order-preserving drawings of trees with approximately optimal height (and small width). CoRR abs/1606.02233 (2016) - [i27]Therese Biedl, Saeed Mehrabi, Ziting Yu:
Sliding k-Transmitters: Hardness and Approximation. CoRR abs/1607.07364 (2016) - [i26]Therese Biedl, Martin Derka:
Order-preserving 1-string representations of planar graphs. CoRR abs/1609.08132 (2016) - [i25]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs With Bounded Pathwidth. CoRR abs/1612.03854 (2016) - [i24]Martin Derka, Therese Biedl:
Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs. CoRR abs/1612.07276 (2016) - 2015
- [j49]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Weighted straight skeletons in the plane. Comput. Geom. 48(2): 120-133 (2015) - [j48]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Reprint of: Weighted straight skeletons in the plane. Comput. Geom. 48(5): 429-442 (2015) - [j47]Therese Biedl:
On triangulating k-outerplanar graphs. Discret. Appl. Math. 181: 275-279 (2015) - [j46]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Inf. Process. Lett. 115(2): 243-247 (2015) - [c86]Therese Biedl, Martin Derka:
1-string B1-VPG-representations of planar partial 3-trees and some subclasses. CCCG 2015 - [c85]Therese Biedl, Martin Derka:
1-String B_2-VPG Representation of Planar Graphs. SoCG 2015: 141-155 - [c84]Therese Biedl, Jens M. Schmidt:
Small-Area Orthogonal Drawings of 3-Connected Graphs. GD 2015: 153-165 - [c83]Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber:
Representing Directed Trees as Straight Skeletons. GD 2015: 335-347 - [c82]Therese Biedl:
Triangulating Planar Graphs While Keeping the Pathwidth Small. WG 2015: 425-439 - [i23]Therese Biedl:
Optimum-width upward drawings of trees I: Rooted pathwidth. CoRR abs/1502.02753 (2015) - [i22]Therese Biedl, Sebastian Fischmeister, Neeraj Kumar:
DAG-width of Control Flow Graphs with Applications to Model Checking. CoRR abs/1503.00793 (2015) - [i21]Therese Biedl:
Triangulating planar graphs while keeping the pathwidth small. CoRR abs/1505.04235 (2015) - [i20]Therese Biedl:
Optimum-width upward order-preserving poly-line drawings of trees. CoRR abs/1506.02096 (2015) - [i19]Therese Biedl, Martin Derka:
$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. CoRR abs/1506.07246 (2015) - [i18]Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber:
Representing Directed Trees as Straight Skeletons. CoRR abs/1508.01076 (2015) - [i17]Therese Biedl, Jens M. Schmidt:
Small-Area Orthogonal Drawings of 3-Connected Graphs. CoRR abs/1510.02322 (2015) - [i16]Therese Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. CoRR abs/1511.00873 (2015) - [i15]Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani:
On Visibility Representations of Non-planar Graphs. CoRR abs/1511.08592 (2015) - 2014
- [j45]Therese Biedl, Lesvia Elena Ruiz Velázquez:
Orthogonal cartograms with at most 12 corners per face. Comput. Geom. 47(2): 282-294 (2014) - [c81]Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Turning Orthogonally Convex Polyhedra into Orthoballs. CCCG 2014 - [c80]Therese Biedl:
Height-Preserving Transformations of Planar Graph Drawings. GD 2014: 380-391 - [c79]