Scholar
Kitty Meeks
Google Scholar ID: rrC2K4YAAAAJ
University of Glasgow
Algorithms - Graph Theory - Parameterised Complexity - Counting Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
741
H-index
16
i10-index
21
Publications
20
Co-authors
0
Publications
10 items
The parameterised complexity of generalised temporal domination on temporal graphs with modular structure
2026
Cited
0
Temporal Role Colouring
2026
Cited
0
The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem
2026
Cited
0
Approximating temporal modularity on graphs of small underlying treewidth
2025
Cited
0
Temporal Orienteering with Changing Fuel Costs
2025
Cited
0
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
2025
Cited
0
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
arXiv.org · 2024
Cited
0
Reachability in temporal graphs under perturbation
Conference on Current Trends in Theory and Practice of Informatics · 2024
Cited
1
Load more
