Therese Biedl - RankMe

284 papers A* 8A 39B 30C 1Misc 3Journal 157Unranked 46

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computing conforming partitions with low stabbing number for rectilinear polygons. Inf. Comput. Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier
2026	B	`conf`	Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm. SOFSEM Therese Biedl
2026	J	`jnl`	On computing vertex connectivity of 1-planar graphs. Algorithmica Therese Biedl, Karthik Murali
2026	B	`conf`	Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. SOFSEM Therese Biedl, Prashant Gokhale
2026	J	`jnl`	Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. CoRR Therese Biedl, Prashant Gokhale
2025	B	`conf`	Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. WALCOM Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier
2025	J	`jnl`	Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm. CoRR Therese Biedl
2025	A*	`conf`	Finding a Shortest Curve That Separates Few Objects from Many. SoCG Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote
2025	J	`jnl`	Finding a Shortest Curve that Separates Few Objects from Many. CoRR Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote
2025	J	`jnl`	Large matchings in maximal 1-planar graphs. Discret. Math. Therese Biedl, John Wittnebel
2025	J	`jnl`	On the Complexity of Embedding in Graph Products. Comput. Geom. Topol. Therese Biedl, David Eppstein, Torsten Ueckerdt
2025	J	`jnl`	On the d-independence number in 1-planar graphs. Graphs Comb. Therese Biedl, Prosenjit Bose, Babak Miraftab
2025	J	`jnl`	Rectangular Duals on the Cylinder and the Torus. CoRR Therese Biedl, Philipp Kindermann, Jonathan Klawitter
2025	J	`jnl`	Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited). CoRR Therese Biedl
2025	J	`jnl`	Sweeping CoRR Therese Biedl, Erin W. Chambers, Irina Kostitsyna, Günter Rote
2025	—	`conf`	Sweeping x-monotone pseudolines. CCCG Therese Biedl, Erin W. Chambers, Irina Kostitsyna, Günter Rote
2025	J	`jnl`	The Price of Upwardness. Discret. Math. Theor. Comput. Sci. Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter
2024	A	`conf`	A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. ESA Therese Biedl, Prosenjit Bose, Karthik Murali
2024	J	`jnl`	A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. CoRR Therese Biedl, Prosenjit Bose, Karthik Murali
2024	J	`jnl`	Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. CoRR Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier
2024	A	`conf`	Constrained Outer-String Representations. GD Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter
2024	—	`conf`	Finding maximum matchings in RDV graphs efficiently. CCCG Therese Biedl, Prashant Gokhale
2024	J	`jnl`	Finding maximum matchings in RDV graphs efficiently. CoRR Therese Biedl, Prashant Gokhale
2024	B	`conf`	Improved Outerplanarity Bounds for Planar Graphs. WG Therese Biedl, Debajyoti Mondal
2024	J	`jnl`	Improved Outerplanarity Bounds for Planar Graphs. CoRR Therese Biedl, Debajyoti Mondal
2024	A	`conf`	Morphing Planar Graph Drawings via Orthogonal Box Drawings. GD Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
2024	J	`jnl`	Morphing Planar Graph Drawings via Orthogonal Box Drawings. CoRR Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
2024	J	`jnl`	On the CoRR Therese Biedl, Prosenjit Bose, Babak Miraftab
2024	—	`conf`	On the Independence Number of 1-Planar Graphs. SWAT Therese Biedl, Prosenjit Bose, Babak Miraftab
2024	J	`jnl`	Optimal-area visibility representations of outer-1-plane graphs. J. Comput. Geom. Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2024	J	`jnl`	Reconfiguration of non-crossing spanning trees. J. Comput. Geom. Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Adam Hesterberg, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2024	A	`conf`	The Price of Upwardness. GD Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff
2024	J	`jnl`	The Price of Upwardness. CoRR Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff
2024	J	`jnl`	The basis number of 1-planar graphs. CoRR Saman Bazargani, Therese Biedl, Prosenjit Bose, Anil Maheshwari, Babak Miraftab
2023	J	`jnl`	Large Matchings in Maximal 1-planar graphs. CoRR Therese Biedl, John Wittnebel
2023	A*	`conf`	On Computing the Vertex Connectivity of 1-Plane Graphs. ICALP Therese Biedl, Karthik Murali
2023	—	`conf`	On the complexity of embedding in graph products. CCCG Therese Biedl, David Eppstein, Torsten Ueckerdt
2023	J	`jnl`	On the complexity of embedding in graph products. CoRR Therese Biedl, David Eppstein, Torsten Ueckerdt
2022	J	`jnl`	Drawing Halin-graphs with small height. J. Graph Algorithms Appl. Therese Biedl, Milap Sheth
2022	—	`conf`	Drawing complete outer-1-planar graphs in linear area. CCCG Therese Biedl
2022	J	`jnl`	Drawing outer-1-planar graphs revisited. J. Graph Algorithms Appl. Therese Biedl
2022	J	`jnl`	Horton-Strahler number, rooted pathwidth and upward drawings of trees. Inf. Process. Lett. Therese Biedl
2022	J	`jnl`	Matchings in 1-planar graphs with large minimum degree. J. Graph Theory Therese Biedl, John Wittnebel
2022	J	`jnl`	On computing the vertex connectivity of 1-plane graphs. CoRR Therese Biedl, Karthik Murali
2022	J	`jnl`	Reconfiguration of Non-crossing Spanning Trees. CoRR Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
2022	A	`conf`	Visibility Representations of Toroidal and Klein-bottle Graphs. GD Therese Biedl
2022	J	`jnl`	Visibility Representations of Toroidal and Klein-bottle Graphs. CoRR Therese Biedl
2021	J	`jnl`	A note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. Therese Biedl
2021	C	`conf`	All Subgraphs of a Wheel Are 5-Coupled-Choosable. IWOCA Sam Barr, Therese Biedl
2021	J	`jnl`	All Subgraphs of a Wheel are 5-Coupled-Choosable. CoRR Sam Barr, Therese Biedl
2021	J	`jnl`	Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. CoRR Therese Biedl, Karthik Murali
2021	—	`conf`	Dispersion for Intervals: A Geometric Approach. SOSA Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021	A	`conf`	Distant Representatives for Rectangles in the Plane. ESA Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021	J	`jnl`	Distant Representatives for Rectangles in the Plane. CoRR Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021	B	`conf`	Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ISAAC Sam Barr, Therese Biedl
2021	J	`jnl`	Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. CoRR Sam Barr, Therese Biedl
2021	—	`conf`	Generalized LR-Drawings of Trees. CCCG Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Generalized LR-drawings of trees. CoRR Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Minimum ply covering of points with disks and squares. Comput. Geom. Therese Biedl, Ahmad Biniaz, Anna Lubiw
2021	J	`jnl`	On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth. Algorithmica Therese Biedl, Saeed Mehrabi
2021	A	`conf`	Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021	J	`jnl`	Optimal-area visibility representations of outer-1-plane graphs. CoRR Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2020	J	`jnl`	Building a larger class of graphs for efficient reconfiguration of vertex colouring. CoRR Therese Biedl, Anna Lubiw, Owen D. Merkel
2020	J	`jnl`	Crossing Number for Graphs with Bounded Pathwidth. Algorithmica Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
2020	J	`jnl`	Drawing Halin-graphs with small height. CoRR Therese Biedl, Milap Sheth
2020	J	`jnl`	Drawing outer-1-planar graphs revisited. CoRR Therese Biedl
2020	B	`conf`	Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG Therese Biedl, Fabian Klute
2020	J	`jnl`	Finding large matchings in 1-planar graphs of minimum degree 3. CoRR Therese Biedl, Fabian Klute
2020	B	`conf`	Layered Fan-Planar Graph Drawings. MFCS Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020	J	`jnl`	On Layered Fan-Planar Graph Drawings. CoRR Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020	J	`jnl`	Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). J. Graph Algorithms Appl. Johannes Batzill, Therese Biedl
2020	J	`jnl`	Packing boundary-anchored rectangles and squares. Comput. Geom. Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2020	J	`jnl`	Reconstructing a Polyhedron between Polygons in Parallel Slices. CoRR Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
2020	J	`jnl`	Segment representations with small resolution. Inf. Process. Lett. Therese Biedl
2019	J	`jnl`	A note on 1-planar graphs with minimum degree 7. CoRR Therese Biedl
2019	J	`jnl`	Are highly connected 1-planar graphs Hamiltonian? CoRR Therese Biedl
2019	A*	`conf`	Finding Tutte Paths in Linear Time. ICALP Therese Biedl, Philipp Kindermann
2019	J	`jnl`	Finding big matchings in planar graphs quickly. CoRR Therese Biedl
2019	J	`jnl`	Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu
2019	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Therese Biedl, Andreas Kerren
2019	A	`conf`	Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
2019	J	`jnl`	Homotopy height, grid-major height and graph-drawing height. CoRR Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
2019	A	`conf`	Line and Plane Cover Numbers Revisited. GD Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
2019	J	`jnl`	Line and Plane Cover Numbers Revisited. CoRR Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
2019	J	`jnl`	Matchings in 1-planar graphs with large minimum degree. CoRR Therese Biedl, John Wittnebel
2019	B	`conf`	Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
2019	J	`jnl`	Maximum Matchings and Minimum Blocking Sets in Θ CoRR Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
2019	—	`conf`	Minimum Ply Covering of Points with Disks and Squares. CCCG Therese Biedl, Ahmad Biniaz, Anna Lubiw
2019	J	`jnl`	Minimum Ply Covering of Points with Disks and Squares. CoRR Therese Biedl, Ahmad Biniaz, Anna Lubiw
2019	J	`jnl`	Packing Boundary-Anchored Rectangles and Squares. CoRR Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2019	J	`jnl`	Quasiperiodic bobbin lace patterns. CoRR Veronika Irvine, Therese Biedl, Craig S. Kaplan
2019	—	`conf`	Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
2019	J	`jnl`	Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. Discret. Comput. Geom. Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2018	J	`jnl`	Finding Tutte paths in linear time. CoRR Therese Biedl, Philipp Kindermann
2018	A	`ed.`	Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings GD Therese Biedl, Andreas Kerren
2018	—	`conf`	Integral Unit Bar-Visibility Graphs. CCCG Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte
2018	—	`conf`	On the Size of Outer-String Representations. SWAT Therese Biedl, Ahmad Biniaz, Martin Derka
2018	B	`conf`	Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte
2018	J	`jnl`	Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). CoRR Therese Biedl, Andreas Kerren
2018	A*	`conf`	Rollercoasters and Caterpillars. ICALP Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Rollercoasters and Caterpillars. CoRR Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit
2018	J	`jnl`	Segment representations with small resolution. CoRR Therese Biedl
2017	J	`jnl`	4-connected planar graphs are in B CoRR Therese Biedl, Claire Pennarun
2017	B	`conf`	A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. WADS Therese Biedl, Philippe Demontigny
2017	J	`jnl`	A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. CoRR Therese Biedl, Philippe Demontigny
2017	J	`jnl`	A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. CoRR Therese Biedl, Debajyoti Mondal
2017	B	`conf`	Crossing Number for Graphs with Bounded~Pathwidth. ISAAC Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
2017	A	`conf`	Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. GD Therese Biedl, Veronika Irvine
2017	J	`jnl`	Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs. CoRR Therese Biedl, Veronika Irvine
2017	A	`conf`	EPG-representations with Small Grid-Size. GD Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin
2017	J	`jnl`	EPG-representations with small grid-size. CoRR Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin
2017	A	`conf`	Grid-Obstacle Representations with Connections to Staircase Guarding. GD Therese Biedl, Saeed Mehrabi
2017	J	`jnl`	Grid-Obstacle Representations with Connections to Staircase Guarding. CoRR Therese Biedl, Saeed Mehrabi
2017	J	`jnl`	Ideal Drawings of Rooted Trees With Approximately Optimal Width. J. Graph Algorithms Appl. Therese Biedl
2017	A	`conf`	Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
2017	J	`jnl`	Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw
2017	J	`jnl`	Non-aligned Drawings of Planar Graphs. J. Graph Algorithms Appl. Therese Biedl, Claire Pennarun
2017	—	`conf`	On Guarding Orthogonal Polygons with Bounded Treewidth. CCCG Therese Biedl, Saeed Mehrabi
2017	J	`jnl`	On Guarding Orthogonal Polygons with Bounded Treewidth. CoRR Therese Biedl, Saeed Mehrabi
2017	B	`conf`	On Guarding Orthogonal Polygons with Sliding Cameras. WALCOM Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2017	A	`conf`	On Upward Drawings of Trees on a Given Grid. GD Therese Biedl, Debajyoti Mondal
2017	J	`jnl`	On Upward Drawings of Trees on a Given Grid. CoRR Therese Biedl, Debajyoti Mondal
2017	B	`conf`	Order-Preserving 1-String Representations of Planar Graphs. SOFSEM Therese Biedl, Martin Derka
2017	—	`conf`	Packing Boundary-Anchored Rectangles. CCCG Therese Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2017	B	`conf`	Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS Therese Biedl, Martin Derka
2017	—	`conf`	Upward Order-Preserving 8-Grid-Drawings of Binary Trees. CCCG Therese Biedl
2016	J	`jnl`	1-string B J. Comput. Geom. Therese Biedl, Martin Derka
2016	J	`jnl`	Crossing Number for Graphs With Bounded Pathwidth. CoRR Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
2016	A	`conf`	Non-aligned Drawings of Planar Graphs. GD Therese Biedl, Claire Pennarun
2016	J	`jnl`	Non-aligned drawings of planar graphs. CoRR Therese Biedl, Claire Pennarun
2016	J	`jnl`	On Guarding Orthogonal Polygons with Sliding Cameras. CoRR Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2016	A*	`conf`	On Visibility Representations of Non-Planar Graphs. SoCG Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2016	B	`conf`	On r-Guarding Thin Orthogonal Polygons. ISAAC Therese Biedl, Saeed Mehrabi
2016	J	`jnl`	On r-Guarding Thin Orthogonal Polygons. CoRR Therese Biedl, Saeed Mehrabi
2016	J	`jnl`	Order-preserving 1-string representations of planar graphs. CoRR Therese Biedl, Martin Derka
2016	J	`jnl`	Order-preserving drawings of trees with approximately optimal height (and small width). CoRR Johannes Batzill, Therese Biedl
2016	J	`jnl`	Planar Matchings for Weighted Straight Skeletons. Int. J. Comput. Geom. Appl. Therese Biedl, Stefan Huber, Peter Palfrader
2016	—	`conf`	Realizing Farthest-Point Voronoi Diagrams. CCCG Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot
2016	—	`conf`	Rectangle-of-influence triangulations. CCCG Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot
2016	—	`conf`	Sliding k-Transmitters: Hardness and Approximation. CCCG Therese Biedl, Saeed Mehrabi, Ziting Yu
2016	J	`jnl`	Sliding k-Transmitters: Hardness and Approximation. CoRR Therese Biedl, Saeed Mehrabi, Ziting Yu
2016	J	`jnl`	Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs. CoRR Martin Derka, Therese Biedl
2016	J	`jnl`	The (3, 1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. Therese Biedl, Martin Derka
2015	J	`jnl`	$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. CoRR Therese Biedl, Martin Derka
2015	A*	`conf`	1-String B_2-VPG Representation of Planar Graphs. SoCG Therese Biedl, Martin Derka
2015	—	`conf`	1-string B1-VPG-representations of planar partial 3-trees and some subclasses. CCCG Therese Biedl, Martin Derka
2015	J	`jnl`	A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Inf. Process. Lett. Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2015	J	`jnl`	DAG-width of Control Flow Graphs with Applications to Model Checking. CoRR Therese Biedl, Sebastian Fischmeister, Neeraj Kumar
2015	J	`jnl`	On Visibility Representations of Non-planar Graphs. CoRR Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2015	J	`jnl`	On triangulating k-outerplanar graphs. Discret. Appl. Math. Therese Biedl
2015	J	`jnl`	Optimum-width upward drawings of trees I: Rooted pathwidth. CoRR Therese Biedl
2015	J	`jnl`	Optimum-width upward order-preserving poly-line drawings of trees. CoRR Therese Biedl
2015	A	`conf`	Representing Directed Trees as Straight Skeletons. GD Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber
2015	J	`jnl`	Representing Directed Trees as Straight Skeletons. CoRR Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber
2015	J	`jnl`	Reprint of: Weighted straight skeletons in the plane. Comput. Geom. Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2015	A	`conf`	Small-Area Orthogonal Drawings of 3-Connected Graphs. GD Therese Biedl, Jens M. Schmidt
2015	J	`jnl`	Small-Area Orthogonal Drawings of 3-Connected Graphs. CoRR Therese Biedl, Jens M. Schmidt
2015	J	`jnl`	The (3, 1)-ordering for 4-connected planar triangulations. CoRR Therese Biedl, Martin Derka
2015	B	`conf`	Triangulating Planar Graphs While Keeping the Pathwidth Small. WG Therese Biedl
2015	J	`jnl`	Triangulating planar graphs while keeping the pathwidth small. CoRR Therese Biedl
2015	J	`jnl`	Weighted straight skeletons in the plane. Comput. Geom. Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2014	J	`jnl`	$1$-String $B_2$-VPG Representation of Planar Graphs. CoRR Therese Biedl, Martin Derka
2014	J	`jnl`	1-String CZ-Representation of Planar Graphs. CoRR Therese Biedl, Martin Derka
2014	A	`conf`	Height-Preserving Transformations of Planar Graph Drawings. GD Therese Biedl
2014	—	`conf`	On Area-Optimal Planar Graph Drawings. ICALP (1) Therese Biedl
2014	J	`jnl`	Orthogonal cartograms with at most 12 corners per face. Comput. Geom. Therese Biedl, Lesvia Elena Ruiz Velázquez
2014	B	`conf`	Planar Matchings for Weighted Straight Skeletons. ISAAC Therese Biedl, Stefan Huber, Peter Palfrader
2014	J	`jnl`	Straightening out planar poly-line drawings. CoRR Therese Biedl
2014	—	`conf`	Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs. SWAT Therese Biedl
2014	—	`conf`	Turning Orthogonally Convex Polyhedra into Orthoballs. CCCG Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour
2013	J	`jnl`	Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2013	J	`jnl`	Dihedral angles and orthogonal polyhedra. CoRR Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour
2013	J	`jnl`	Drawing planar 3-trees with given face areas. Comput. Geom. Therese Biedl, Lesvia Elena Ruiz Velázquez
2013	J	`jnl`	Faster optimal algorithms for segment minimization with small maximal value. Discret. Appl. Math. Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young
2013	J	`jnl`	Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Algorithmica Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
2013	J	`jnl`	Morphing orthogonal planar graph drawings. ACM Trans. Algorithms Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs
2013	J	`jnl`	On triangulating k-outerplanar graphs. CoRR Therese Biedl
2013	—	`conf`	Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. ISVD Therese Biedl, Martin Held, Stefan Huber
2013	B	`conf`	Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak
2013	J	`jnl`	The Point-Set Embeddability Problem for Plane graphs. Int. J. Comput. Geom. Appl. Therese Biedl, Martin Vatshelle
2013	J	`jnl`	Transforming planar graph drawings while maintaining height. CoRR Therese Biedl
2013	J	`jnl`	Trees and co-trees with constant maximum degree in planar 3-connected graphs. CoRR Therese Biedl
2013	A	`conf`	Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2013	J	`jnl`	Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2013	—	`conf`	Weighted Straight Skeletons In The Plane. CCCG Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2012	B	`conf`	A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. WAOA Therese Biedl
2012	J	`jnl`	Computing Cartograms with Optimal Complexity CoRR Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012	—	`conf`	Computing cartograms with optimal complexity. SCG Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
2012	B	`conf`	Drawing Planar Graphs on Points Inside a Polygon. MFCS Therese Biedl, Peter Floderus
2012	A	`conf`	Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. GD Soroush Alamdari, Therese Biedl
2012	J	`jnl`	Proportional Contact Representations of Planar Graphs. J. Graph Algorithms Appl. Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
2012	J	`jnl`	The Art Gallery Theorem for Polyominoes. Discret. Comput. Geom. Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell
2012	Misc	`conf`	The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs. FUN Terry Anderson, Therese Biedl
2012	—	`conf`	The point-set embeddability problem for plane graphs. SCG Therese Biedl, Martin Vatshelle
2011	J	`jnl`	A note on improving the performance of approximation algorithms for radiation therapy. Inf. Process. Lett. Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young
2011	—	`conf`	Drawing some planar graphs with integer edge-lengths. CCCG Therese Biedl
2011	J	`jnl`	Efficient view point selection for silhouettes of convex polyhedra. Comput. Geom. Therese Biedl, Masud Hasan, Alejandro López-Ortiz
2011	B	`conf`	Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. WADS Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young
2011	—	`conf`	Guarding polyominoes. SCG Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell
2011	B	`conf`	Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
2011	B	`conf`	Orthogonal Cartograms with Few Corners Per Face. WADS Therese Biedl, Lesvia Elena Ruiz Velázquez
2011	A	`conf`	Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. GD Soroush Alamdari, Therese Biedl
2011	A	`conf`	Proportional Contact Representations of Planar Graphs. GD Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
2011	J	`jnl`	Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Int. J. Comput. Geom. Appl. Therese Biedl, Masud Hasan, Alejandro López-Ortiz
2011	J	`jnl`	Reconstructing orthogonal polyhedra from putative vertex sets. Comput. Geom. Therese Biedl, Burkay Genç
2011	J	`jnl`	Reconstructing polygons from scanner data. Theor. Comput. Sci. Therese Biedl, Stephane Durocher, Jack Snoeyink
2011	J	`jnl`	Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs. Discret. Comput. Geom. Therese Biedl
2011	J	`jnl`	Stoker's Theorem for Orthogonal Polyhedra. Int. J. Comput. Geom. Appl. Therese Biedl, Burkay Genç
2010	J	`jnl`	On edge-intersection graphs of k-bend paths in grids. Discret. Math. Theor. Comput. Sci. Therese Biedl, Michal Stern
2010	J	`jnl`	Reconstructing hv-convex multi-coloured polyominoes. Theor. Comput. Sci. Adam Bains, Therese Biedl
2010	J	`jnl`	Sorting with networks of data structures. Discret. Appl. Math. Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro
2009	A	`conf`	Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. ESA Therese Biedl, Burkay Genç
2009	A	`conf`	Drawing Planar 3-Trees with Given Face-Areas. GD Therese Biedl, Lesvia Elena Ruiz Velázquez
2009	Misc	`conf`	Edge-Intersection Graphs of COCOON Therese Biedl, Michal Stern
2009	J	`jnl`	Fixed-Parameter Tractability and Improved Approximations for Segment Minimization CoRR Therese Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young
2009	J	`jnl`	Morphing polyhedra with parallel faces: Counterexamples. Comput. Geom. Therese Biedl, Anna Lubiw, Michael J. Spriggs
2009	J	`jnl`	On the complexity of crossings in permutations. Discret. Math. Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng
2009	B	`conf`	Reconstructing Polygons from Scanner Data. ISAAC Therese Biedl, Stephane Durocher, Jack Snoeyink
2009	A	`conf`	Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. GD Therese Biedl
2007	B	`conf`	Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS Therese Biedl, Anna Lubiw, Michael J. Spriggs
2007	—	`conf`	Improved Layouts of the Multigrid Network. CCCG Shabnam Aziza, Therese Biedl
2007	—	`conf`	Realizations of Hexagonal Graph Representations. CCCG Therese Biedl
2007	—	`conf`	Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. FSTTCS Therese Biedl, Masud Hasan, Alejandro López-Ortiz
2006	A	`conf`	Partitions of Graphs into Trees. GD Therese Biedl, Franz-Josef Brandenburg
2006	J	`jnl`	Polygons Needing Many Flipturns. Discret. Comput. Geom. Therese Biedl
2006	J	`jnl`	Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica Therese Biedl, Torsten Thiele, David R. Wood
2005	J	`jnl`	A note on 3D orthogonal graph drawing. Discret. Appl. Math. Therese Biedl, Timothy M. Chan
2005	J	`jnl`	Balanced vertex-orderings of graphs. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
2005	J	`jnl`	Bounded-Degree Independent Sets in Planar Graphs. Theory Comput. Syst. Therese Biedl, Dana F. Wilkinson
2005	—	`conf`	Complexity of Octagonal and Rectangular Cartograms. CCCG Therese Biedl, Burkay Genç
2005	—	`conf`	Cross-Stitching Using Little Thread. CCCG Therese Biedl, Joseph Douglas Horton, Alejandro López-Ortiz
2005	A	`conf`	Crossings and Permutations. GD Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng
2005	—	`conf`	Drawing planar bipartite graphs with small area. CCCG Therese Biedl, Franz-Josef Brandenburg
2005	A	`conf`	Morphing Planar Graphs While Preserving Edge Directions. GD Therese Biedl, Anna Lubiw, Michael J. Spriggs
2005	—	`conf`	Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG Therese Biedl, Anna Lubiw, Michael J. Spriggs
2005	—	`conf`	The complexity of domino tiling. CCCG Therese Biedl
2005	J	`jnl`	When can a net fold to a polyhedron? Comput. Geom. Therese Biedl, Anna Lubiw, Julie Sun
2004	B	`conf`	Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS Therese Biedl, Anna Lubiw, Michael J. Spriggs
2004	B	`conf`	Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS Therese Biedl, Masud Hasan, Alejandro López-Ortiz
2004	J	`jnl`	Finding hidden independent sets in interval graphs. Theor. Comput. Sci. Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
2004	J	`jnl`	Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004	A	`conf`	Hexagonal Grid Drawings: Algorithms and Lower Bounds. GD Shabnam Aziza, Therese Biedl
2004	J	`jnl`	Tight bounds on maximal and maximum matchings. Discret. Math. Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2004	—	`conf`	When can a graph form an orthogonal polyhedron? CCCG Therese Biedl, Burkay Genç
2003	J	`jnl`	Drawing K Inf. Process. Lett. Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz
2003	Misc	`conf`	Finding Hidden Independent Sets in Interval Graphs. COCOON Therese Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
2003	A	`conf`	Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
2003	J	`jnl`	Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
2003	—	`conf`	Parallel morphing of trees and cycles. CCCG Therese Biedl, Anna Lubiw, Michael J. Spriggs
2002	J	`jnl`	A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
2002	B	`conf`	Bounded-Degree Independent Sets in Planar Graphs. ISAAC Therese Biedl, Dana F. Wilkinson
2002	J	`jnl`	Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
2002	—	`conf`	Drawing CCCG Therese Biedl, Timothy M. Chan, Alejandro López-Ortiz
2002	A	`conf`	Drawing Outer-Planar Graphs in O(n log n) Area. GD Therese Biedl
2002	—	`conf`	Searching for the center of a circle. CCCG Therese Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar
2002	—	`conf`	Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang
2001	J	`jnl`	1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. J. Graph Algorithms Appl. Therese Biedl
2001	A	`conf`	Graph-Drawing Contest Report. GD Therese Biedl, Franz-Josef Brandenburg
2001	A*	`conf`	Linear reductions of maximum matching. SODA Therese Biedl
2001	J	`jnl`	Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 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
2001	A	`conf`	Orthogonal Drawings with Few Layers. GD Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
2001	J	`jnl`	The DFS-heuristic for orthogonal graph drawing. Comput. Geom. Therese Biedl
2001	B	`conf`	Tight Bounds on Maximal and Maximum Matchings. ISAAC Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
2000	—	`conf`	1-bend 3-D orthogonal drawings: two open problems solved. CCCG Therese Biedl
2000	A	`conf`	Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. GD Therese Biedl, Torsten Thiele, David R. Wood
1999	J	`jnl`	Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1999	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1999	A*	`conf`	Locked and Unlocked Polygonal Chains in 3D. SODA 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
1999	J	`jnl`	On Reconfiguring Tree Linkages: Trees can Lock CoRR Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1999	A	`conf`	Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. GD Therese Biedl, Anna Bretscher, Henk Meijer
1999	—	`conf`	When can a net fold to a polyhedron. CCCG Therese Biedl, Anna Lubiw, Julie Sun
1998	J	`jnl`	A better heuristic for orthogonal graph drawings. Comput. Geom. Therese Biedl, Goos Kant
1998	—	`conf`	Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
1998	B	`conf`	Drawing Planar Partitions II: HH-Drawings. WG Therese Biedl, Michael Kaufmann, Petra Mutzel
1998	A	`conf`	Graph Multidrawing: Finding Nice Drawings Without Defining Nice. GD Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides
1998	J	`jnl`	Locked and Unlocked Polygonal Chains in 3D CoRR 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
1998	—	`conf`	On reconfiguring tree linkages: Trees can lock. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides
1998	J	`jnl`	Relating Bends and Size in Orthogonal Graph Drawings. Inf. Process. Lett. Therese Biedl
1998	—	`conf`	Unfolding some classes of orthogonal polyhedra. CCCG Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
1997	J	`jnl`	On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica Therese Biedl, Goos Kant, Michael Kaufmann
1997	A	`conf`	Orthogonal 3-D Graph Drawing. GD Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
1994	A	`conf`	A Better Heuristic for Orthogonal Graph Drawings. ESA Therese Biedl, Goos Kant
1994	—	`conf`	On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT Therese Biedl, Goos Kant, Michael Kaufmann