Showing 2026Show all
2 papers · 1 filter
cs.LO2026
Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz +3
Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions o…
cs.DS2026
A more versatile model for enumerative kernelization: a case study for Vertex Cover
Marin Bougeret, Guilherme C. M. Gomes, Ignasi Sau
Enumerative kernelization is a recent promising at the intersection of parameterized complexity and enumeration algorithms, with two proposed models. The first, known as enum-kerne…