Similar Items: Shrub-depth: Capturing Height of Dense Graphs
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- The Improvement of RoMa Dense Matching Framework With the Introduction of KAN
- Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata