Counting Small Induced Subgraphs with Edge-Monotone Properties. - Simon Döring; Dániel Marx; Philip Wellnitz (STOC, 2024)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. - Radu Curticapean; Simon Döring; Daniel Neuen (ESA, 2025)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs. - Simon Döring; Dániel Marx; Philip Wellnitz (SODA, 2025)

Can You Link Up With Treewidth? - Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang 002 (STACS, 2025)

The Complexity of Finding and Counting Subtournaments. - Simon Döring; Sarah Houdaigoui; Lucas Picasarri-Arrieta; Philip Wellnitz (CoRR, 2025)