Jayakrishnan Madathil
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Discrete Math×1
Frequent co-authors
Research Timeline
2026
The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem
This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, introducing a new measure called toadwidth, and providing a parameterized complexity dichotomy for totally ordered temporal patterns.
Highlighted terms show continued research focus across papers