activity
20132023
most citedSubexponential-time Algorithms for Maximum Independent Set in -free and Broom-free Graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2018 · cs.DMShow all

Nothing from them under that filter.

Their other years and fields are still on the left.