11 citations · 20 across the 5 of their papers we have counts for
1 paper · 1 filter
Jan Dreier, Daniel Mock, Peter Rossmanith
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-r minors have constant density.…