11 citations · 19 across the 15 of their papers we have counts for
3 papers · 1 filter
Pattern Matching under Weighted Edit Distance
Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz
In Pattern Matching with Weighted Edits (PMWED), we are given a pattern of length , a text of length , a positive threshold , and oracle access to a weight functio…
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…
The Parametrised Complexity of Counting Small Sub-Hypergraphs
Marco Bressan, Julian Brinkmann, Holger Dell +2
Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has b…