default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTherese Biedl
Therese C. Biedl
Person information
- affiliation: University of Waterloo, Cheriton School of Computer Science, Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j70]Therese Biedl
, John Wittnebel:
Large matchings in maximal 1-planar graphs. Discret. Math. 348(2): 114288 (2025)- 2024
- [c132]Therese Biedl, Prosenjit Bose, Karthik Murali:
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. ESA 2024: 24:1-24:15 - [c131]Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter:
Constrained Outer-String Representations. GD 2024: 10:1-10:18 - [c130]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c129]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. GD 2024: 40:1-40:16 - [c128]Therese Biedl, Prosenjit Bose, Babak Miraftab:
On the Independence Number of 1-Planar Graphs. SWAT 2024: 13:1-13:13 - [i76]Therese Biedl, Prashant Gokhale:
Finding maximum matchings in RDV graphs efficiently. CoRR abs/2406.03632 (2024) - [i75]Therese Biedl, Prosenjit Bose, Karthik Murali:
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. CoRR abs/2407.00586 (2024) - [i74]Therese Biedl, Debajyoti Mondal:
Improved Outerplanarity Bounds for Planar Graphs. CoRR abs/2407.04282 (2024) - [i73]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i72]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. CoRR abs/2409.04074 (2024) - 2023
- [c127]Therese Biedl, David Eppstein, Torsten Ueckerdt:
On the complexity of embedding in graph products. CCCG 2023: 77-88 - [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]Therese Biedl:
On Area-Optimal Planar Graph Drawings. ICALP (1) 2014: 198-210 - [c78]Therese Biedl, Stefan Huber, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. ISAAC 2014: 117-127 - [c77]Therese Biedl:
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs. SWAT 2014: 62-73 - [i14]Therese Biedl:
Straightening out planar poly-line drawings. CoRR abs/1404.5892 (2014) - [i13]Therese Biedl, Martin Derka:
1-String CZ-Representation of Planar Graphs. CoRR abs/1409.5816 (2014) - [i12]Therese Biedl, Martin Derka:
$1$-String $B_2$-VPG Representation of Planar Graphs. CoRR abs/1411.7277 (2014) - 2013
- [j44]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Algorithmica 67(1): 3-22 (2013) - [j43]Therese Biedl, Lesvia Elena Ruiz Velázquez:
Drawing planar 3-trees with given face areas. Comput. Geom. 46(3): 276-285 (2013) - [j42]Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster optimal algorithms for segment minimization with small maximal value. Discret. Appl. Math. 161(3): 317-329 (2013) - [j41]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. 50(3): 784-810 (2013) - [j40]Therese Biedl, Martin Vatshelle:
The Point-Set Embeddability Problem for Plane graphs. Int. J. Comput. Geom. Appl. 23(4-5): 357-396 (2013) - [j39]Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs:
Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4): 29:1-29:24 (2013) - [c76]Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
Weighted Straight Skeletons In The Plane. CCCG 2013 - [c75]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD 2013: 460-471 - [c74]Therese Biedl, Martin Held, Stefan Huber:
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. ISVD 2013: 37-46 - [c73]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [i11]Therese Biedl:
Transforming planar graph drawings while maintaining height. CoRR abs/1308.6693 (2013) - [i10]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR abs/1308.6778 (2013) - [i9]Therese Biedl:
On triangulating k-outerplanar graphs. CoRR abs/1310.1845 (2013) - [i8]Therese Biedl:
Trees and co-trees with constant maximum degree in planar 3-connected graphs. CoRR abs/1312.4101 (2013) - [i7]Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Dihedral angles and orthogonal polyhedra. CoRR abs/1312.6824 (2013) - 2012
- [j38]Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
The Art Gallery Theorem for Polyominoes. Discret. Comput. Geom. 48(3): 711-720 (2012) - [j37]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. J. Graph Algorithms Appl. 16(3): 701-728 (2012) - [c72]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing cartograms with optimal complexity. SCG 2012: 21-30 - [c71]Therese Biedl, Martin Vatshelle:
The point-set embeddability problem for plane graphs. SCG 2012: 41-50 - [c70]Terry Anderson, Therese Biedl:
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs. FUN 2012: 4-15 - [c69]Soroush Alamdari, Therese Biedl:
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. GD 2012: 102-113 - [c68]Therese Biedl, Peter Floderus:
Drawing Planar Graphs on Points Inside a Polygon. MFCS 2012: 172-183 - [c67]Therese Biedl:
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. WAOA 2012: 272-285 - [i6]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. CoRR abs/1201.0066 (2012) - 2011
- [j36]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Efficient view point selection for silhouettes of convex polyhedra. Comput. Geom. 44(8): 399-408 (2011) - [j35]Therese Biedl, Burkay Genç:
Reconstructing orthogonal polyhedra from putative vertex sets. Comput. Geom. 44(8): 409-417 (2011) - [j34]Therese Biedl:
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs. Discret. Comput. Geom. 45(1): 141-160 (2011) - [j33]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geom. Appl. 21(2): 215-239 (2011) - [j32]Therese Biedl, Burkay Genç:
Stoker's Theorem for Orthogonal Polyhedra. Int. J. Comput. Geom. Appl. 21(4): 383-391 (2011) - [j31]Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young:
A note on improving the performance of approximation algorithms for radiation therapy. Inf. Process. Lett. 111(7): 326-333 (2011) - [j30]Therese Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing polygons from scanner data. Theor. Comput. Sci. 412(32): 4161-4172 (2011) - [c66]Therese Biedl:
Drawing some planar graphs with integer edge-lengths. CCCG 2011 - [c65]Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
Guarding polyominoes. SCG 2011: 387-396 - [c64]Soroush Alamdari, Therese Biedl:
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. GD 2011: 14-25 - [c63]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. GD 2011: 26-38 - [c62]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC 2011: 281-291 - [c61]Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. WADS 2011: 86-97 - [c60]Therese Biedl, Lesvia Elena Ruiz Velázquez:
Orthogonal Cartograms with Few Corners Per Face. WADS 2011: 98-109 - 2010
- [j29]Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
Sorting with networks of data structures. Discret. Appl. Math. 158(15): 1579-1586 (2010) - [j28]Therese Biedl, Michal Stern:
On edge-intersection graphs of k-bend paths in grids. Discret. Math. Theor. Comput. Sci. 12(1): 1-12 (2010) - [j27]Adam Bains, Therese Biedl:
Reconstructing hv-convex multi-coloured polyominoes. Theor. Comput. Sci. 411(34-36): 3123-3128 (2010)
2000 – 2009
- 2009
- [j26]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing polyhedra with parallel faces: Counterexamples. Comput. Geom. 42(5): 395-402 (2009) - [j25]Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
On the complexity of crossings in permutations. Discret. Math. 309(7): 1813-1823 (2009) - [c59]Therese Biedl, Michal Stern:
Edge-Intersection Graphs of k-Bend Paths in Grids. COCOON 2009: 86-95 - [c58]Therese Biedl, Burkay Genç:
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. ESA 2009: 71-82 - [c57]Therese Biedl:
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. GD 2009: 280-291 - [c56]Therese Biedl, Lesvia Elena Ruiz Velázquez:
Drawing Planar 3-Trees with Given Face-Areas. GD 2009: 316-322 - [c55]Therese Biedl, Stephane Durocher, Jack Snoeyink:
Reconstructing Polygons from Scanner Data. ISAAC 2009: 862-871 - [i5]Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young:
Fixed-Parameter Tractability and Improved Approximations for Segment Minimization. CoRR abs/0905.4930 (2009) - 2007
- [c54]Therese Biedl:
Realizations of Hexagonal Graph Representations. CCCG 2007: 89-92 - [c53]Shabnam Aziza, Therese Biedl:
Improved Layouts of the Multigrid Network. CCCG 2007: 221-224 - [c52]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. FSTTCS 2007: 400-411 - [c51]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS 2007: 398-409 - 2006
- [j24]Therese Biedl, Torsten Thiele, David R. Wood:
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica 44(3): 233-255 (2006) - [j23]Therese Biedl:
Polygons Needing Many Flipturns. Discret. Comput. Geom. 35(1): 131-141 (2006) - [c50]Therese Biedl, Franz-Josef Brandenburg:
Partitions of Graphs into Trees. GD 2006: 430-439 - 2005
- [j22]Therese Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron? Comput. Geom. 31(3): 207-218 (2005) - [j21]Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood:
Balanced vertex-orderings of graphs. Discret. Appl. Math. 148(1): 27-48 (2005) - [j20]Therese Biedl, Timothy M. Chan:
A note on 3D orthogonal graph drawing. Discret. Appl. Math. 148(2): 189-193 (2005) - [j19]Therese Biedl, Dana F. Wilkinson:
Bounded-Degree Independent Sets in Planar Graphs. Theory Comput. Syst. 38(3): 253-278 (2005) - [c49]Therese Biedl, Franz-Josef Brandenburg:
Drawing planar bipartite graphs with small area. CCCG 2005: 105-108 - [c48]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG 2005: 109-112 - [c47]Therese Biedl, Burkay Genç:
Complexity of Octagonal and Rectangular Cartograms. CCCG 2005: 117-120 - [c46]Therese Biedl:
The complexity of domino tiling. CCCG 2005: 187-190 - [c45]Therese Biedl, Joseph Douglas Horton, Alejandro López-Ortiz:
Cross-Stitching Using Little Thread. CCCG 2005: 199-202 - [c44]Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
Crossings and Permutations. GD 2005: 1-12 - [c43]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Planar Graphs While Preserving Edge Directions. GD 2005: 13-24 - 2004
- [j18]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - [j17]Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight bounds on maximal and maximum matchings. Discret. Math. 285(1-3): 7-15 (2004) - [j16]Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar:
Finding hidden independent sets in interval graphs. Theor. Comput. Sci. 310(1-3): 287-307 (2004) - [c42]Therese Biedl, Burkay Genç:
When can a graph form an orthogonal polyhedron? CCCG 2004: 53-56 - [c41]Shabnam Aziza, Therese Biedl:
Hexagonal Grid Drawings: Algorithms and Lower Bounds. GD 2004: 18-24 - [c40]Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS 2004: 735-747 - [c39]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS 2004: 748-759 - 2003
- [j15]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) - [j14]Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar:
Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003) - [c38]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Parallel morphing of trees and cycles. CCCG 2003: 29-34 - [c37]Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar:
Finding Hidden Independent Sets in Interval Graphs. COCOON 2003: 182-191 - [c36]Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper:
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA 2003: 90-101 - 2002
- [j13]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j12]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings. Discret. Math. 254(1-3): 19-32 (2002) - [j11]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002) - [c35]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang:
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108 - [c34]Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar:
Searching for the center of a circle. CCCG 2002: 137-141 - [c33]Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing k2, n: A lower bound. CCCG 2002: 146-148 - [c32]Therese Biedl:
Drawing Outer-Planar Graphs in O(n log n) Area. GD 2002: 54-65 - [c31]Therese Biedl, Dana F. Wilkinson:
Bounded-Degree Independent Sets in Planar Graphs. ISAAC 2002: 416-427 - 2001
- [j10]Therese Biedl:
The DFS-heuristic for orthogonal graph drawing. Comput. Geom. 18(3): 167-188 (2001) - [j9]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:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j8]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001) - [j7]Therese Biedl:
1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. J. Graph Algorithms Appl. 5(3): 1-15 (2001) - [c30]Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood:
Orthogonal Drawings with Few Layers. GD 2001: 297-311 - [c29]Therese Biedl, Franz-Josef Brandenburg:
Graph-Drawing Contest Report. GD 2001: 513-522 - [c28]Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319 - [c27]Therese Biedl:
Linear reductions of maximum matching. SODA 2001: 825-826 - [i4]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro:
The Complexity of Clickomania. CoRR cs.CC/0107031 (2001) - 2000
- [j6]Therese C. Biedl, Brendan Madden, Ioannis G. Tollis:
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geom. Appl. 10(6): 553-580 (2000) - [c26]Therese Biedl:
1-bend 3-D orthogonal drawings: two open problems solved. CCCG 2000 - [c25]Therese Biedl, Torsten Thiele, David R. Wood:
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. GD 2000: 284-295 - [c24]Therese C. Biedl, Brona Brejová, Tomás Vinar:
Simplifying Flow Networks. MFCS 2000: 192-201 - [c23]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211
1990 – 1999
- 1999
- [j5]Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath:
Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3(4): 63-79 (1999) - [c22]Therese Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron. CCCG 1999 - [c21]Therese Biedl, Anna Bretscher, Henk Meijer:
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. GD 1999: 359-368 - [c20]Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss:
Convexifying Monotone Polygons. ISAAC 1999: 415-424 - [c19]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139 - [c18]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:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [i3]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - [i2]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999) - 1998
- [j4]Therese Biedl, Goos Kant:
A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3): 159-180 (1998) - [j3]Therese Biedl:
Relating Bends and Size in Orthogonal Graph Drawings. Inf. Process. Lett. 65(2): 111-115 (1998) - [j2]Therese C. Biedl:
New Lower Bounds For Orthogonal Drawings. J. Graph Algorithms Appl. 2(7): 1-31 (1998) - [c17]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On reconfiguring tree linkages: Trees can lock. CCCG 1998 - [c16]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides:
Unfolding some classes of orthogonal polyhedra. CCCG 1998 - [c15]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint:
Hiding disks in folded polygons. CCCG 1998 - [c14]Therese C. Biedl:
Drawing Planar Partitions I: LL-Drawings and LH-Drawings. SCG 1998: 287-296 - [c13]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG 1998: 392-401 - [c12]Therese C. Biedl:
Three Approaches to 3D-Orthogonal Box-Drawings. GD 1998: 30-43 - [c11]Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides:
Graph Multidrawing: Finding Nice Drawings Without Defining Nice. GD 1998: 347-355 - [c10]Therese Biedl, Michael Kaufmann, Petra Mutzel:
Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136 - [i1]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:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1997
- [j1]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997) - [c9]Therese C. Biedl, Michael Kaufmann:
Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52 - [c8]Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath:
Orthogonal 3-D Graph Drawing. GD 1997: 76-86 - [c7]Therese C. Biedl, Brendan Madden, Ioannis G. Tollis:
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. GD 1997: 391-402 - 1996
- [c6]Therese C. Biedl:
Improved Orthogonal Drawings of 3-graphs. CCCG 1996: 295-299 - [c5]Therese C. Biedl:
Optimal Orthogonal Drawings of Connected Plane Graphs. CCCG 1996: 306-311 - [c4]Therese C. Biedl:
Optimal Orthogonal Drawings of Triconnected Plane Graphs. SWAT 1996: 333-344 - 1995
- [c3]Therese C. Biedl:
New Lower Bounds for Orthogonal Graph Drawings. GD 1995: 28-39 - 1994
- [c2]Therese Biedl, Goos Kant:
A Better Heuristic for Orthogonal Graph Drawings. ESA 1994: 24-35 - [c1]Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
