Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Therese Biedl

Therese Biedl

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Comp. Geom.×2Discrete Math×2Combinatorics×1

Frequent co-authors

Alexander Baumann1×
Mahmoud Elashmawi1×
Simon D. Fink1×
Maria Saumell1×
André Schulz1×

Research Timeline

2026
Unbent collections of non-planar $s$-grid-drawing

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

On Reconstructing a Convex Polygon from Partial Information

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

Highlighted terms show continued research focus across papers

Papers

cs.CGcs.DMTheoreticalRecentJul 1, 2026

On Reconstructing a Convex Polygon from Partial Information

Alexander Baumann, Therese Biedl, Mahmoud Elashmawi, Simon D. Fink +2 more

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

View →
cs.CGcs.DMmath.COTheoretical
Recent
Jun 25, 2026

Unbent collections of non-planar $s$-grid-drawing

Therese Biedl

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

View →