activity
20242026
most citedStructure and generation of crossing-critical graphs

4 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 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…