activity
20232026
most citedParameterized Algorithms for Balanced Cluster Edge Modification Problems

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.CC2026

The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem

Jayakrishnan Madathil, Kitty Meeks, Marc Roth

We study the structural expressivity and the parameterised complexity of counting homomorphisms from small temporal patterns to large temporal graphs. Here, a temporal pattern …