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
Contact
No contact links provided.
Publications
7 items
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
Tangled Paths: A Random Graph Model from Mallows Permutations
European Conference on Combinatorics, Graph Theory and Applications · 2021
Cited
3
Directed branch-width: A directed analogue of tree-width
arXiv.org · 2020
Cited
3
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up