1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2025
The Complexity of Finding and Counting Subtournaments
Simon Döring, Sarah Houdaigoui, Lucas Picasarri-Arrieta +1
We study the complexity of counting and finding small tournament patterns inside large tournaments. Given a fixed tournament of order , we write ${\#}\text{IndSub}_{\text{To…
cs.CC2024
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
Simon Döring, Dániel Marx, Philip Wellnitz
A graph property is a function that maps every graph to {0, 1} and is invariant under isomorphism. In the problem, given a graph and an integer , the task…
cs.CC2023★ 1 cited
Counting Small Induced Subgraphs with Edge-monotone Properties
Simon Döring, Dániel Marx, Philip Wellnitz
We study the parameterized complexity of #IndSub(), where given a graph and an integer , the task is to count the number of induced subgraphs on vertices that satisfy…