| 2026 | SOFSEM | Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm. | Therese Biedl |
| 2026 | SOFSEM | Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. | Therese Biedl, Prashant Gokhale |
| 2025 | WALCOM | Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. | Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier |
| 2024 | ESA | A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. | Therese Biedl, Prosenjit Bose, Karthik Murali |
| 2024 | GD | The Price of Upwardness. | 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 | GD | Constrained Outer-String Representations. | Therese Biedl, Sabine Cornelsen, Jan Kratochvl, Ignaz Rutter |
| 2024 | GD | Morphing Planar Graph Drawings via Orthogonal Box Drawings. | Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson |
| 2024 | WG | Improved Outerplanarity Bounds for Planar Graphs. | Therese Biedl, Debajyoti Mondal |
| 2023 | ICALP | On Computing the Vertex Connectivity of 1-Plane Graphs. | Therese Biedl, Karthik Murali |
| 2022 | GD | Visibility Representations of Toroidal and Klein-bottle Graphs. | Therese Biedl |
| 2021 | ESA | Distant Representatives for Rectangles in the Plane. | Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
| 2021 | GD | Optimal-Area Visibility Representations of Outer-1-Plane Graphs. | Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani |
| 2021 | ISAAC | Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. | Sam Barr, Therese Biedl |
| 2021 | IWOCA | All Subgraphs of a Wheel Are 5-Coupled-Choosable. | Sam Barr, Therese Biedl |
| 2020 | MFCS | Layered Fan-Planar Graph Drawings. | Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nllenburg, Chrysanthi N. Raftopoulou |
| 2020 | WG | Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. | Therese Biedl, Fabian Klute |
| 2019 | GD | Homotopy Height, Grid-Major Height and Graph-Drawing Height. | Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders |
| 2019 | GD | Line and Plane Cover Numbers Revisited. | Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff |
| 2019 | ICALP | Finding Tutte Paths in Linear Time. | Therese Biedl, Philipp Kindermann |
| 2019 | WG | Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. | Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw |
| 2018 | ICALP | Rollercoasters and Caterpillars. | Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit |
| 2018 | LATIN | Partitioning Orthogonal Histograms into Rectangular Boxes. | Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte |
| 2017 | GD | Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. | Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw |
| 2017 | GD | EPG-representations with Small Grid-Size. | Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin |
| 2017 | GD | Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs. | Therese Biedl, Veronika Irvine |
| 2017 | GD | Grid-Obstacle Representations with Connections to Staircase Guarding. | Therese Biedl, Saeed Mehrabi |
| 2017 | GD | On Upward Drawings of Trees on a Given Grid. | Therese Biedl, Debajyoti Mondal |
| 2017 | ISAAC | Crossing Number for Graphs with Bounded~Pathwidth. | Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel |
| 2017 | SOFSEM | Order-Preserving 1-String Representations of Planar Graphs. | Therese Biedl, Martin Derka |
| 2017 | WADS | A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. | Therese Biedl, Philippe Demontigny |
| 2017 | WADS | Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. | Therese Biedl, Martin Derka |
| 2017 | WALCOM | On Guarding Orthogonal Polygons with Sliding Cameras. | Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour |
| 2016 | GD | Non-aligned Drawings of Planar Graphs. | Therese Biedl, Claire Pennarun |
| 2016 | ISAAC | On r-Guarding Thin Orthogonal Polygons. | Therese Biedl, Saeed Mehrabi |
| 2015 | GD | Representing Directed Trees as Straight Skeletons. | Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, Birgit Vogtenhuber |
| 2015 | GD | Small-Area Orthogonal Drawings of 3-Connected Graphs. | Therese Biedl, Jens M. Schmidt |
| 2015 | WG | Triangulating Planar Graphs While Keeping the Pathwidth Small. | Therese Biedl |
| 2014 | GD | Height-Preserving Transformations of Planar Graph Drawings. | Therese Biedl |
| 2014 | ICALP | On Area-Optimal Planar Graph Drawings. | Therese Biedl |
| 2014 | ISAAC | Planar Matchings for Weighted Straight Skeletons. | Therese Biedl, Stefan Huber, Peter Palfrader |
| 2013 | GD | Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. | Therese Biedl, Thomas Blsius, Benjamin Niedermann, Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2013 | WADS | Smart-Grid Electricity Allocation via Strip Packing with Slicing. | Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak |
| 2012 | FUN | The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs. | Terry Anderson, Therese Biedl |
| 2012 | GD | Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. | Soroush Alamdari, Therese Biedl |
| 2012 | MFCS | Drawing Planar Graphs on Points Inside a Polygon. | Therese Biedl, Peter Floderus |
| 2012 | WAOA | A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. | Therese Biedl |
| 2011 | GD | Proportional Contact Representations of Planar Graphs. | Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov |
| 2011 | GD | Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. | Soroush Alamdari, Therese Biedl |
| 2011 | ISAAC | Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. | Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov |
| 2011 | WADS | Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. | Therese Biedl, Stephane Durocher, Cline Engelbeen, Samuel Fiorini, Maxwell Young |
| 2011 | WADS | Orthogonal Cartograms with Few Corners Per Face. | Therese Biedl, Lesvia Elena Ruiz Velzquez |
| 2009 | COCOON | Edge-Intersection Graphs of | Therese Biedl, Michal Stern |
| 2009 | ESA | Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. | Therese Biedl, Burkay Gen |
| 2009 | GD | Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. | Therese Biedl |
| 2009 | GD | Drawing Planar 3-Trees with Given Face-Areas. | Therese Biedl, Lesvia Elena Ruiz Velzquez |
| 2009 | ISAAC | Reconstructing Polygons from Scanner Data. | Therese Biedl, Stephane Durocher, Jack Snoeyink |
| 2007 | WADS | Cauchy's Theorem and Edge Lengths of Convex Polyhedra. | Therese Biedl, Anna Lubiw, Michael J. Spriggs |
| 2006 | GD | Partitions of Graphs into Trees. | Therese Biedl, Franz-Josef Brandenburg |
| 2005 | GD | Crossings and Permutations. | Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng |
| 2005 | GD | Morphing Planar Graphs While Preserving Edge Directions. | Therese Biedl, Anna Lubiw, Michael J. Spriggs |
| 2004 | GD | Hexagonal Grid Drawings: Algorithms and Lower Bounds. | Shabnam Aziza, Therese Biedl |
| 2004 | MFCS | Efficient View Point Selection for Silhouettes of Convex Polyhedra. | Therese Biedl, Masud Hasan, Alejandro Lpez-Ortiz |
| 2004 | MFCS | Angles and Lengths in Reconfigurations of Polygons and Polyhedra. | Therese Biedl, Anna Lubiw, Michael J. Spriggs |
| 2003 | COCOON | Finding Hidden Independent Sets in Interval Graphs. | Therese Biedl, Brona Brejov, Erik D. Demaine, Angle M. Hamel, Alejandro Lpez-Ortiz, Toms Vinar |
| 2003 | ESA | Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. | Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro Lpez-Ortiz, Guillaume Poirier, Claude-Guy Quimper |
| 2002 | GD | Drawing Outer-Planar Graphs in O(n log n) Area. | Therese Biedl |
| 2002 | ISAAC | Bounded-Degree Independent Sets in Planar Graphs. | Therese Biedl, Dana F. Wilkinson |
| 2001 | GD | Graph-Drawing Contest Report. | Therese Biedl, Franz-Josef Brandenburg |
| 2001 | GD | Orthogonal Drawings with Few Layers. | Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood |
| 2001 | ISAAC | Tight Bounds on Maximal and Maximum Matchings. | Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov |
| 2001 | SODA | Linear reductions of maximum matching. | Therese Biedl |
| 2000 | GD | Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. | Therese Biedl, Torsten Thiele, David R. Wood |
| 1999 | GD | Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. | Therese Biedl, Anna Bretscher, Henk Meijer |
| 1999 | SODA | Locked and Unlocked Polygonal Chains in 3D. | 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 | GD | Graph Multidrawing: Finding Nice Drawings Without Defining Nice. | Therese Biedl, Joe Marks, Kathy Ryall, Sue Whitesides |
| 1998 | WG | Drawing Planar Partitions II: HH-Drawings. | Therese Biedl, Michael Kaufmann, Petra Mutzel |
| 1997 | GD | Orthogonal 3-D Graph Drawing. | Therese Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath |
| 1994 | ESA | A Better Heuristic for Orthogonal Graph Drawings. | Therese Biedl, Goos Kant |