23 citations · 60 across the 50 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 2 cited
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle, Ignasi Sau, Giannos Stamoulis +1
Let be a minor-closed graph class and let be an -vertex graph. We say that is a -apex of if contains a set of at most vertices such…
cs.DS2022
Reducing the Vertex Cover Number via Edge Contractions
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +2
The CONTRACTION(vc) problem takes as input a graph on vertices and two integers and , and asks whether one can contract at most edges to reduce the size of a min…