activity
20152025
most citedDepth lower bounds in Stabbing Planes for combinatorial principles

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

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.DS2025

Cluster deletion in cographs, permutation graphs, and graphs with bounded clique number

Nicola Galesi, Tony Huynh, Fariba Ranjbar +1

The Cluster Deletion problem asks for a minimum-size edge set whose deletion turns a graph into a disjoint union of complete graphs. Equivalently, the Clique Partition problem asks…