Lacon-and shrub-decompositions: A new characterization of first-order transductions of bounded expansion classes
J Dreier - 2021 36th Annual ACM/IEEE Symposium on Logic in …, 2021 - ieeexplore.ieee.org
The concept of bounded expansion provides a robust way to capture sparse graph classes
with interesting algorithmic properties. Most notably, every problem definable in first-order …
with interesting algorithmic properties. Most notably, every problem definable in first-order …
Lacon-, shrub-and parity-decompositions: Characterizing transductions of bounded expansion classes
J Dreier - Logical Methods in Computer Science, 2023 - lmcs.episciences.org
The concept of bounded expansion provides a robust way to capture sparse graph classes
with interesting algorithmic properties. Most notably, every problem definable in first-order …
with interesting algorithmic properties. Most notably, every problem definable in first-order …
[PDF][PDF] Two new perspectives on algorithmic meta-theorems: evaluating approximate first-order counting queries on bounded expansion and first-order queries on …
J Dreier - 2020 - publications.rwth-aachen.de
We present two algorithmic meta-theorems. Our first meta-theorem is an approximation
scheme of the parameterized model-checking problem for the firstorder counting logic FO ({> …
scheme of the parameterized model-checking problem for the firstorder counting logic FO ({> …