T. Biedl

Most-cited papers

Weighted straight skeletons in the plane
T. Biedl, M. Held, S. Huber, Dominik Kaaser +1 more
2015Canadian Conference on Computational Geometry32 citations Open access
Semantic Scholar
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
T. Biedl, G. Liotta, F. Montecchiani
2015Discrete & Computational Geometry28 citations Open access
Semantic Scholar
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
T. Biedl, Thomas Bläsius, Benjamin Niedermann, M. Nöllenburg +2 more
2013International Symposium Graph Drawing and Network Visualization24 citations Open access
Semantic Scholar
Smart-Grid Electricity Allocation via Strip Packing with Slicing
Soroush Alamdari, T. Biedl, T. Chan, Elyot Grant +4 more
2013Workshop on Algorithms and Data Structures24 citations Open access
Semantic Scholar
Height-Preserving Transformations of Planar Graph Drawings
T. Biedl
2014International Symposium Graph Drawing and Network Visualization18 citations Open access
Semantic Scholar
On triangulating k-outerplanar graphs
T. Biedl
2013Discrete Applied Mathematics18 citations Open access
Semantic Scholar
Minimum Ply Covering of Points with Disks and Squares
T. Biedl, Ahmad Biniaz, A. Lubiw
2019Canadian Conference on Computational Geometry16 citations Open access
Semantic Scholar
On r-Guarding Thin Orthogonal Polygons
T. Biedl, S. Mehrabi
2016International Symposium on Algorithms and Computation16 citations
Semantic Scholar
A simple algorithm for computing positively weighted straight skeletons of monotone polygons
T. Biedl, M. Held, S. Huber, Dominik Kaaser +1 more
2015Information Processing Letters16 citations Open access
Semantic Scholar
1-string B2-VPG representation of planar graphs
T. Biedl, Martin Derka
2014Journal of Computational Geometry14 citations
Semantic Scholar
Matchings in 1‐planar graphs with large minimum degree
T. Biedl, John Wittnebel
2019Journal of Graph Theory13 citations Open access
Semantic Scholar
On Guarding Orthogonal Polygons with Sliding Cameras
T. Biedl, T. Chan, Stephanie Lee, S. Mehrabi +2 more
2016Workshop on Algorithms and Computation13 citations Open access
Semantic Scholar
Reconfiguration of Non-crossing Spanning Trees
O. Aichholzer, Brad Ballinger, T. Biedl, Mirela Damian +6 more
2022arXiv.org11 citations Open access
Semantic Scholar
Crossing Number for Graphs with Bounded Pathwidth
T. Biedl, Markus Chimani, Martin Derka, Petra Mutzel
2016Algorithmica11 citations Open access
Semantic Scholar
Planar Matchings for Weighted Straight Skeletons
T. Biedl, S. Huber, Peter Palfrader
2014International journal of computational geometry and applications11 citations Open access
Semantic Scholar
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input
T. Biedl, M. Held, S. Huber
2013International Symposium on Voronoi Diagrams in Science and Engineering11 citations
Semantic Scholar
The (3, 1)-ordering for 4-connected planar triangulations
T. Biedl, Martin Derka
2015J. Graph Algorithms Appl.10 citations Open access
Semantic Scholar
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
T. Biedl
2014Scandinavian Workshop on Algorithm Theory10 citations
Semantic Scholar
Rollercoasters: Long Sequences without Short Runs
T. Biedl, Ahmad Biniaz, Robert Cummings, A. Lubiw +3 more
2019SIAM Journal on Discrete Mathematics9 citations
Semantic Scholar
Quasiperiodic bobbin lace patterns
Veronika Irvine, T. Biedl, Craig S. Kaplan
2019Journal of Mathematics and the Arts8 citations Open access
Semantic Scholar
A note on 1-planar graphs with minimum degree 7
T. Biedl
2019Discrete Applied Mathematics8 citations Open access
Semantic Scholar
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
T. Biedl, T. Chan, Martin Derka, Kshitij Jain +1 more
2017International Symposium Graph Drawing and Network Visualization7 citations
Semantic Scholar
Optimum-width upward drawings of trees
T. Biedl
20157 citations
Semantic Scholar
On computing vertex connectivity of 1-planar graphs
T. Biedl, K. Murali
2022Algorithmica6 citations
Semantic Scholar
On Layered Fan-Planar Graph Drawings
T. Biedl, S. Chaplick, J. Fiala, M. Kaufmann +3 more
2020International Symposium on Mathematical Foundations of Computer Science6 citations
Semantic Scholar
Partitioning Orthogonal Histograms into Rectangular Boxes
T. Biedl, Martin Derka, Veronika Irvine, A. Lubiw +2 more
2018Latin American Symposium on Theoretical Informatics6 citations
Semantic Scholar
On the Size of Outer-String Representations
T. Biedl, Ahmad Biniaz, Martin Derka
2018Scandinavian Workshop on Algorithm Theory6 citations
Semantic Scholar
On Upward Drawings of Trees on a Given Grid
T. Biedl, Debajyoti Mondal
2017International Symposium Graph Drawing and Network Visualization6 citations
Semantic Scholar
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs
T. Biedl, Martin Derka
2016Workshop on Algorithms and Data Structures6 citations
Semantic Scholar
1-string B1-VPG-representations of planar partial 3-trees and some subclasses
T. Biedl, Martin Derka
2015Canadian Conference on Computational Geometry6 citations
Semantic Scholar
Dispersion for Intervals: A Geometric Approach
T. Biedl, A. Lubiw, Anurag Murty Naredla, P. D. Ralbovsky +1 more
2021SIAM Symposium on Simplicity in Algorithms5 citations Open access
Semantic Scholar
Building a larger class of graphs for efficient reconfiguration of vertex colouring
T. Biedl, A. Lubiw, Owen D. Merkel
2020Trends in Mathematics5 citations Open access
Semantic Scholar
Finding Tutte paths in linear time
T. Biedl, Philipp Kindermann
2018International Colloquium on Automata, Languages and Programming5 citations
Semantic Scholar
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs
T. Biedl, Veronika Irvine
2017International Symposium Graph Drawing and Network Visualization5 citations Open access
Semantic Scholar
Order-Preserving 1-String Representations of Planar Graphs
T. Biedl, Martin Derka
2016Conference on Current Trends in Theory and Practice of Informatics5 citations
Semantic Scholar
Representing Directed Trees as Straight Skeletons
O. Aichholzer, T. Biedl, T. Hackl, M. Held +3 more
2015International Symposium Graph Drawing and Network Visualization5 citations
Semantic Scholar
On the complexity of embedding in graph products
T. Biedl, D. Eppstein, T. Ueckerdt
2023Canadian Conference on Computational Geometry4 citations
Semantic Scholar
Packing Boundary-Anchored Rectangles and Squares
T. Biedl, Ahmad Biniaz, A. Maheshwari, S. Mehrabi
2019Computational geometry4 citations Open access
Semantic Scholar
Line and Plane Cover Numbers Revisited
T. Biedl, S. Felsner, H. Meijer, Alexander Wolff
2019International Symposium Graph Drawing and Network Visualization4 citations Open access
Semantic Scholar
Are highly connected 1-planar graphs Hamiltonian?
T. Biedl
2019arXiv.org4 citations
Semantic Scholar
Homotopy height, grid-major height and graph-drawing height
T. Biedl, Erin W. Chambers, D. Eppstein, A. de Mesmay +1 more
2019International Symposium Graph Drawing and Network Visualization4 citations
Semantic Scholar
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
T. Biedl, T. Chan, Stephanie Lee, S. Mehrabi +3 more
2018Algorithmica4 citations
Semantic Scholar
Grid-Obstacle Representations with Connections to Staircase Guarding
T. Biedl, S. Mehrabi
2017International Symposium Graph Drawing and Network Visualization4 citations Open access
Semantic Scholar
Upward Order-Preserving 8-Grid-Drawings of Binary Trees
T. Biedl
2017Canadian Conference on Computational Geometry4 citations
Semantic Scholar
On Area-Optimal Planar Graph Drawings
T. Biedl
2014International Colloquium on Automata, Languages and Programming4 citations
Semantic Scholar
Palindrome Re ognition Using a Multidimensional Tape
T. Biedl, Jonathan F. Buss, E. Demaine, M. Demaine +1 more
20213 citations
Semantic Scholar
Horton-Strahler number, rooted pathwidth and upward drawings of trees
T. Biedl
2021Information Processing Letters3 citations
Semantic Scholar
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
T. Biedl, S. Mehrabi
2020Algorithmica3 citations
Semantic Scholar
Rollercoasters and Caterpillars
T. Biedl, Ahmad Biniaz, Robert Cummings, A. Lubiw +3 more
2018International Colloquium on Automata, Languages and Programming3 citations
Semantic Scholar
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings
T. Biedl, Debajyoti Mondal
2017arXiv.org3 citations
Semantic Scholar