Scholar
Jayakrishnan Madathil
Google Scholar ID: 5jSMmyUAAAAJ
Research Associate, University of Glasgow
Theoretical Computer Science
Algorithms
Parameterized Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
80
H-index
6
i10-index
4
Publications
18
Co-authors
20
list available
Contact
No contact links provided.
Publications
4 items
The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem
2026
Cited
0
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
2025
Cited
0
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
arXiv.org · 2024
Cited
0
The Cost and Complexity of Minimizing Envy in House Allocation
arXiv.org · 2024
Cited
0
Resume (English only)
Co-authors
20 total
Saket Saurabh
Professor at Institute of Mathematical Sciences
Abhishek Sahu
Visiting Faculty, Niser
Lawqueen Kanesh
Indian Institute of Technology Indore, India
Meirav Zehavi
Ben-Gurion University of the Negev
Neeldhara Misra
Indian Institute of Technology, Gandhinagar
Fahad Panolan
School of Computing, University of Leeds
Co-author 7
Sanjukta Roy
Assistant Professor at Indian Statistical Institute