Announcement_44

Our paper Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth (with Isolde Adler, Eva Fluck, and Gian Luca Spitzer) has been published in Logical Methods in Computer Science.