My research falls mainly within the following fields (click on the link for more information).
I also wrote five papers in different fields and six papers on graph reconstruction (which perhaps could fall in several of the fields above).
Repeated co-authors: Tom Johnston (14), Alex Scott (12), Hans L. Bodlaender (7), Paul Bastide (6), Hugo Jacob (5), Marthe Bonamy (5), Louis Esperet (4), Jesper Nederlof (4), Isja Mannens (3), Jane Tan (3), Alexandra Wesolek (3), James Aaronson (2), Linda Cook (2), Michał Pilipczuk (2), Alexander Roberts (2), Paweł Rzążewski (2), Céline M. F. Swennenhuis (2).
See also: arXiv, orcid, Google Scholar, dblp.
Preprints:
(43) Marthe Bonamy, Carla Groenland, Tom Johnston, Natasha Morrison and Alex Scott, Infinite induced-saturated graphs, arXiv:2506.08810.
(42) Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, Clément Rambaud and Alexandra Wesolek, Faithful universal graphs for minor-closed classes, arXiv:2504.19582, submitted to journal.
(41) Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte and Liana Yepremyan, Longest cycles in vertex-transitive and highly connected graphs, arXiv:2408.04618, accepted by Bulletin of the London Mathematical Society.
(40) Paul Bastide and Carla Groenland, Optimal distance query reconstruction for graphs without long induced cycles, arXiv:2306.05979, accepted by Random Structures and Algorithms.
(39) Carla Groenland, Tom Johnston, Jamie Radcliffe and Alex Scott, Short reachability networks, arXiv:2208.06630, submitted to journal.
(38) Carla Groenland, Tom Johnston, Jamie Radcliffe and Alex Scott, Perfect shuffling with fewer lazy transpositions, arXiv:2208.06629.
Accepted papers:
(37) Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston and Alex Scott, Counting graphic sequences via integrated random walks, arXiv:2301.07022, to appear in Transactions of the American Mathematical Society.
(36) Paul Bastide and Carla Groenland, Quasi-linear distance query reconstruction for graphs of bounded treelength, arXiv:2410.12594 . Conference publication: IPEC 2024.
(35) Carla Groenland, Jesper Nederlof and Tomohiro Koana, A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor, arXiv:2410.06793. Conference publication: IPEC 2024.
(34) Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Paweł Rzążewski, Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters, arXiv:2312.03859. Conference publication: ICALP 2024.
(33) Paul Bastide, Carla Groenland, Maria-Romina Ivan and Tom Johnston, A Polynomial Upper Bound for Poset Saturation, arXiv:2310.04634, accepted by European Journal of Combinatorics.
(32) Hans L. Bodlaender, Carla Groenland and Michał Pilipczuk, Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters, arXiv:2304.25 (revision). Conference publication: ICALP 2023.
(31) Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens and Jordi L. Vermeulen, Reconstructing Graphs from Connected Triples, arXiv:2303.06609. Conference publication: WG 2023.
(30) Willem Röpke, Carla Groenland, Roxana Rădulescu, Ann Nowé, Diederik M. Roijers, Bridging the Gap Between Single and Multi Objective Games. Conference publication: AAMAS 2023.
(29) Paul Bastide, Carla Groenland, Hugo Jacob and Tom Johnston, Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron, arXiv:2207.07391, accepted by Combinatorial Theory.
(28) Hans L. Bodlaender, Carla Groenland and Hugo Jacob, List Colouring Trees in Logarithmic Space, arXiv:2206.09750. Conference publication: ESA 2022.
(27) Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk and Michał Pilipczuk, On the Complexity of Problems on Tree-structured Graphs, arXiv:2206.11828. Conference publication: IPEC 2022.
(26) Hans L. Bodlaender, Carla Groenland and Hugo Jacob, On the parameterized complexity of computing tree-partitions, arXiv:2206.11832. Conference publication: IPEC 2022.
(25) Carla Groenland, Tom Johnston, Dániel Korándi, Alexander Roberts, Alex Scott and Jane Tan, Decomposing random permutations into order-isomorphic subpermutations, arXiv:2202.10789, SIAM Journal of Discrete Mathematics, 37(2), 2023.
(24) Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke and Paloma T. Lima, XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure, arXiv:2201.13119. Conference publication: IPEC 2022. Best Paper award
(23) Carla Groenland, Jesper Nederlof, Isja Mannens and Krisztina Szilágyi, Tight bounds for counting colorings and connected edge sets parameterized by cutwidth, arXiv:2110.02730. Conference publication: STACS 2022.
(22) Carla Groenland and Tom Johnston, The lengths for which bicrucial square-free permutations exist, arXiv:2109.00502. Published in PP2021 special issue of Enumerative Combinatorics and Applications, #S4PP4, 2:4, 2022.
(21) Marthe Bonamy, Linda Cook, Carla Groenland and Alexandra Wesolek, A tight local algorithm for the minimum dominating set problem in outerplanar graphs, arXiv:2108.02697. Conference publication: DISC 2021.
(20) Carla Groenland, Tomáš Kaiser, Oscar Treffers and Matthew Wales, Graphs of low average degree without independent transversals, arXiv:2106.15175. Published in Journal of Graph Theory, 102:374-387, 2023.
(19) Hans L. Bodlaender, Carla Groenland and Céline M.F. Swennenhuis, Parameterized Complexities of Dominating and Independent Set Reconfiguration, arXiv:2106.15907. Conference publication: IPEC 2021.
(18) Hans L. Bodlaender, Carla Groenland, Jesper Nederlof and Céline M. F. Swennenhuis, Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space, arXiv:2105.14882. Conference publication: FOCS 2021. Journal: Information and Computation.
(17) Carla Groenland, Tom Johnston, Alex Scott and Jane Tan, Reconstructing trees from small cards, arXiv:2103.13359. Accepted by Israel Journal of Mathematics.
(16) Louis Esperet, Cyril Gavoille and Carla Groenland, Isometric universal graphs, arXiv:2103.08570. Published in SIAM Journal of Discrete Mathematics, 35(2):1224-1237, 2021.
(15) Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex Scott and Jane Tan, Reconstructing the degree sequence of a sparse graph from a partial deck, arXiv:2102.08679. Published in Journal of Combinatorial Theory Series B, 157:283-293, 2022.
(14) Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, Francois Pirot and Alex Scott, Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces, arXiv:2012.02435. Published in Journal of the European Mathematical Society.
(13) Marthe Bonamy, Louis Esperet, Carla Groenland and Alex Scott, Optimal labelling schemes for adjacency, comparability and reachability, arXiv:2012.01764. Conference publication: STOC 2021.
(12) Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek and Alexandra Wesolek, A note on connected greedy edge colouring, arXiv:2012.13916. Published in Discrete Applied Mathematics, 304:129-136, 2021.
(11) James Aaronson, Carla Groenland, Andrzej Grzesik, Tom Johnston and B. Kielak, Exact hyperplane covers for subsets of the hypercube, arXiv:2010.00315. Published in Discrete Mathematics, 344(9):112490, 2021. Awarded Editor’s choice 2022
(10) Carla Groenland, Gwen Joret, Woijech Nadara and Bartek Walczak, Approximating pathwidth for graphs of small treewidth, arXiv:2008.00779. Journal publication: ACM Transactions on Algorithms, 19(2):1-19, 2023. Conference publication: SODA 2021.
(9) James Aaronson, Carla Groenland and Tom Johnston, Cyclically covering subspaces in F_2^n, arXiv:1903.10613. Published in Journal of Combinatorial Theory, Series A, 181:105436, 2021.
(8) Koen Groenland, Carla Groenland and Reinier Kramer, Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs, arXiv:1904.09915. Published in Journal of Mathematical Physics, 61(7):072201, 2020. Only first author non-alphabetic; equal contribution of last two authors.
(7) Carla Groenland and Tom Johnston, Intersection sizes of linear subspaces with the hypercube, arXiv:1810.02729. Published in Journal of Combinatorial Theory, Series A, 170:105-142, 2020.
(6) Carla Groenland, Hannah Guggiari and Alex Scott, Size reconstructibility of graphs, arXiv:1807.11733. Published in Journal of Graph Theory, 96(2):326-337, 2021.
(5) Juhan Aru, Carla Groenland, Tom Johnston, Bharghav Narayanan, Alexander Roberts and Alex Scott, Exceptional graphs for the random walk, arXiv:1805.06277. Published in Annales de l’Institut Henri Poincaré, 56(3):2017-2027, 2020.
(4) Carla Groenland, Karolina Okrasa, Pawel Rzążewski, Alex Scott, Paul Seymour and Sophie Spirkl, H-colouring Pt-free graphs in subexponential time, arXiv:1803.05396. Published in Discrete Applied Mathematics, 267:184-189, 2019.
(3) Carla Groenland and Guido Schaefer, The Curse of Ties in Congestion Games with Limited Lookahead. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018), July 2018. (Full version, Master thesis)
(2) Marco Costantini, Carla Groenland and Ulle Endriss. Judgment Aggregation under Issue Dependencies. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI-2016), February 2016. (Slides of Ulle Endriss). Student project supervised by Ulle Endriss, first two authors in alphabetic order.
(1) From a (large) group project supervised by Anne Schuth: Probabilistic Multileave for Online Retrieval Evaluation, published in SIGIR (2015).
Manuscripts
Structure for algorithms, graph reconstruction and hypercube intersections. (Last updated: August 2021.)
PhD thesis in Combinatorics, supervised by Alex Scott (University of Oxford, 2017-2021).
The effect of anticipation on stability and efficiency in congestion games.
Master thesis in Artificial Intelligence, supervised by Guido Schaefer (CWI, 2016-2017).
Surfaces have (asymptotic) dimension 2, arXiv:2007.03582 (with Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Francois Pirot and Alex Scott).