Therese Biedl
3 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
The paper investigates the twin-width of various hereditary classes of graphs and provides sub-linear bounds for graphs with bounded VC-dimension.
The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.
This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.