3 citations · 10 across the 22 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Prosenjit Bose, Paz Carmi, J. Mark Keil +4
A graph with vertices is called an outerstring graph if it has an intersection representation of a set of curves inside a disk such that one endpoint of every curve is…
cs.CG2019
Near-Optimal -Robust Geometric Spanners
Prosenjit Bose, Paz Carmi, Vida Dujmovic +1
For any constants , , , and any -point set , we show that there is a geometric graph having edges with…