14 citations · 49 across the 47 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2020
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm +2
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph , a conne…
cs.CG2017
How to navigate through obstacles?
Eduard Eiben, Iyad Kanj
Given a set of obstacles and two points, is there a path between the two points that does not cross more than different obstacles? This is a fundamental problem that has underg…