73 citations · 387 across the 61 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.CG2007★ 1 cited
Spanners of Complete -Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture +3
We address the following problem: Given a complete -partite geometric graph whose vertex set is a set of points in , compute a spanner of that has a ``…
cs.CG2007★ 17 cited
A polynomial bound for untangling geometric planar graphs
Prosenjit Bose, Vida Dujmovic, Ferran Hurtado +3
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if eve…