37 citations · 132 across the 52 of their papers we have counts for
72 papers
On Reconstructing a Convex Polygon from Partial Information
Alexander Baumann, Therese Biedl, Mahmoud Elashmawi +3
The reconstruction problem asks to construct a (convex) polygon that has a specified set of features, such as an ordered set of edge-lengths or an ordered set of polygon-angles. In…
Unbent collections of non-planar -grid-drawing
Therese Biedl
In a recent paper, Antić et al.~studied collections of planar orthogonal drawings of a graph where every edge is unbent in at least one drawing. This paper generalizes this concept…
On the complexity of embedding in graph products
Therese Biedl, David Eppstein, Torsten Ueckerdt
Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of…
Large Matchings in Maximal 1-planar graphs
Therese Biedl, John Wittnebel
It is well-known that every maximal planar graph has a matching of size at least if . In this paper, we investigate similar matching-bounds for maximal \…
On Computing Vertex Connectivity of 1-Plane Graphs
Therese Biedl, Karthik Murali
The vertex connectivity of a graph is the size of the smallest set of vertices such that is disconnected. For the class of planar graphs, the problem of ver…
Visibility Representations of Toroidal and Klein-bottle Graphs
Therese Biedl
In this paper, we study visibility representations of graphs that are embedded on a torus or a Klein bottle. Mohar and Rosenstiehl showed that any toroidal graph has a visibility r…