activity
20202026
most citedSparse graphs with bounded induced cycle packing number have logarithmic treewidth

8 citations · 11 across the 16 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions

Colin Geniet, Aliénor Goubault-Larrecq, Kévin Perrot

We present a Rice-like complexity lower bound for any MSO-definable problem on binary structures succinctly encoded by circuits. This work extends the framework recently developed…