Carla Groenland
Cited by
Cited by
Probabilistic multileave for online retrieval evaluation
A Schuth, RJ Bruintjes, F Buüttner, J van Doorn, C Groenland, ...
Proceedings of the 38th international ACM SIGIR Conference on Research and …, 2015
-colouring -free graphs in subexponential time
C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl
Discrete Applied Mathematics 267, 184-189, 2019
Parameterized problems complete for nondeterministic FPT time and logarithmic space
HL Bodlaender, C Groenland, J Nederlof, CMF Swennenhuis
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
M Bonamy, N Bousquet, L Esperet, C Groenland, CH Liu, F Pirot, A Scott
arXiv preprint arXiv:2012.02435, 2020
Judgment aggregation under issue dependencies
M Costantini, C Groenland, U Endriss
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
M Bonamy, L Cook, C Groenland, A Wesolek
arXiv preprint arXiv:2108.02697, 2021
Exact hyperplane covers for subsets of the hypercube
J Aaronson, C Groenland, A Grzesik, T Johnston, B Kielak
Discrete Mathematics 344 (9), 112490, 2021
Parameterized complexities of dominating and independent set reconfiguration
HL Bodlaender, C Groenland, CMF Swennenhuis
arXiv preprint arXiv:2106.15907, 2021
Approximating pathwidth for graphs of small treewidth
C Groenland, G Joret, W Nadara, B Walczak
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Surfaces have (asymptotic) dimension 2
M Bonamy, N Bousquet, L Esperet, C Groenland, F Pirot, A Scott
arXiv preprint arXiv:2007.03582, 2020
Induced Saturation for
M Bonamy, C Groenland, T Johnston, N Morrison, A Scott, 2020
Reconstructing trees from small cards
C Groenland, T Johnston, A Scott, J Tan
arXiv preprint arXiv:2103.13359, 2021
The curse of ties in congestion games with limited lookahead
C Groenland, G Schäfer
arXiv preprint arXiv:1804.07107, 2018
Size reconstructibility of graphs
C Groenland, H Guggiari, A Scott
Journal of Graph Theory 96 (2), 326-337, 2021
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
Optimal labelling schemes for adjacency, comparability, and reachability
M Bonamy, L Esperet, C Groenland, A Scott
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Intersection sizes of linear subspaces with the hypercube
C Groenland, T Johnston
Journal of Combinatorial Theory, Series A 170, 105142, 2020
A note on connected greedy edge colouring
M Bonamy, C Groenland, C Muller, J Narboni, J Pekárek, A Wesolek
Discrete Applied Mathematics 304, 129-136, 2021
The lengths for which bicrucial square-free permutations exist
C Groenland, T Johnston
arXiv preprint arXiv:2109.00502, 2021
Cyclically covering subspaces in
J Aaronson, C Groenland, T Johnston
Journal of Combinatorial Theory, Series A 181, 105436, 2021
The system can't perform the operation now. Try again later.
Articles 1–20