31 citations · 298 across the 114 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Exact Algorithms for Clustered Planarity with Linear Saturators
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta +3
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an -vertex planar graph whose vertices are partitioned into independent sets (called clus…
cs.DS2018
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…