2 papers
cs.CC2023
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
Manuel Lafond, Weidong Luo
For a graph class , we define the -modular cardinality of a graph as the minimum size of a vertex partition of 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…