activity
20082021
most citedA distributed algorithm for computing and updating the process number of a forest

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

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017★ 1 cited

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

David Coudert, Guillaume Ducoffe, Alexandru Popa

Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so…