受强制性开放获取政策约束的文章 - Kitty Meeks了解详情
可在其他位置公开访问的文章：18 篇
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
Journal of Computer and System Sciences 119, 60-77, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
The parameterised complexity of counting connected subgraphs and graph motifs
M Jerrum, K Meeks
arXiv preprint arXiv:1308.1575, 2013
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Assigning times to minimise reachability in temporal graphs
J Enright, K Meeks, F Skerman
Journal of Computer and System Sciences, 2020
强制性开放获取政策： Swedish Research Council, UK Engineering and Physical Sciences Research Council
Edge exploration of temporal graphs
BM Bumpus, K Meeks
Algorithmica 85 (3), 688-716, 2023
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
The challenges of unbounded treewidth in parameterised subgraph counting problems
K Meeks
Discrete Applied Mathematics 198, 170-194, 2016
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
T Bläsius, T Friedrich, J Lischeid, K Meeks, M Schirneck
Journal of Computer and System Sciences 124, 192-213, 2022
强制性开放获取政策： Royal Society UK
Deleting edges to restrict the size of an epidemic: a new application for treewidth
J Enright, K Meeks
Algorithmica 80, 1857-1889, 2018
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Some hard families of parameterised counting problems
M Jerrum, K Meeks
arXiv preprint arXiv:1310.6524, 2013
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
The parameterised complexity of counting even and odd induced subgraphs
M Jerrum, K Meeks
Combinatorica 37 (5), 965-990, 2017
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Improved inference for areal unit count data using graph-based optimisation
D Lee, K Meeks, W Pettersson
Statistics and Computing 31 (4), 51, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
A new temporal interpretation of cluster editing
C Bocci, C Capresi, K Meeks, J Sylvester
International Workshop on Combinatorial Algorithms, 214-227, 2022
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Reconstructing the degree sequence of a sparse graph from a partial deck
C Groenland, T Johnston, A Kupavskii, K Meeks, A Scott, J Tan
Journal of Combinatorial Theory, Series B 157, 283-293, 2022
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Reducing reachability in temporal graphs: Towards a more realistic model of real-world spreading processes
K Meeks
Conference on Computability in Europe, 186-195, 2022
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Making life more confusing for firefighters
S Hand, J Enright, K Meeks
arXiv preprint arXiv:2202.12599, 2022
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
Counting subgraphs in somewhere dense graphs
M Bressan, L Ann Goldberg, K Meeks, M Roth
SIAM Journal on Computing 53 (5), 1409-1438, 2024
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Cops and robbers on multi-layer graphs
J Enright, K Meeks, W Pettersson, J Sylvester
International Workshop on Graph-Theoretic Concepts in Computer Science, 319-333, 2023
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
The complexity of finding optimal subgraphs to represent spatial correlation
J Enright, D Lee, K Meeks, W Pettersson, J Sylvester
International Conference on Combinatorial Optimization and Applications, 152-166, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
On the complexity of finding and counting solution-free sets of integers
K Meeks, A Treglown
Discrete Applied Mathematics 243, 219-238, 2018
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
出版信息和资助信息由计算机程序自动确定