115 citations · 430 across the 53 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
Twin-width VI: the lens of contraction sequences
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald +1
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on…
cs.DS2021★ 13 cited
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +6
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…