Manuel Lafond

activity

20172023

most citedA lightweight semi-centralized strategy for the massive parallelization of branching algorithms

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

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2023

Parameterized Complexity of Domination Problems Using Restricted Modular Partitions

Manuel Lafond, Weidong Luo

For a graph class $G$ , we define the $G$ -modular cardinality of a graph $G$ as the minimum size of a vertex partition of $G$ into modules that each induces a gr…

cs.CC2023

Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters

Manuel Lafond, Weidong Luo

Structural graph parameters play an important role in parameterized complexity, including in kernelization. Notably, vertex cover, neighborhood diversity, twin-cover, and modular-w…