Similar Items: Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- On first-order transductions of classes of graphs
- Logical and Algebraic Characterizations of Rational Transductions
- First-order queries on classes of structures with bounded expansion
- Refined Risk Bounds for Unbounded Losses via Transductive Priors
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
- Streamability of nested word transductions