Carla Groenland

Orcid: 0000-0002-9878-8750

Affiliations:
  • TU Delft, The Netherlands
  • Utrecht University, The Netherlands (former)


According to our database1, Carla Groenland authored at least 37 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized problems complete for nondeterministic FPT time and logarithmic space.
Inf. Comput., 2024

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K<sub>4</sub>-Minor.
CoRR, 2024

Longest cycles in vertex-transitive and highly connected graphs.
CoRR, 2024

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron.
Comb. Theory, 2024

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Decomposing Random Permutations into Order-Isomorphic Subpermutations.
SIAM J. Discret. Math., June, 2023

Approximating Pathwidth for Graphs of Small Treewidth.
ACM Trans. Algorithms, April, 2023

Graphs of low average degree without independent transversals.
J. Graph Theory, 2023

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters.
CoRR, 2023

Optimal distance query reconstruction for graphs without long induced cycles.
CoRR, 2023

Reconstructing Graphs from Connected Triples.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Bridging the Gap Between Single and Multi Objective Games.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Reconstructing the degree sequence of a sparse graph from a partial deck.
J. Comb. Theory B, 2022

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure.
CoRR, 2022

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

On the Complexity of Problems on Tree-Structured Graphs.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

On the Parameterized Complexity of Computing Tree-Partitions.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

List Colouring Trees in Logarithmic Space.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Isometric Universal Graphs.
SIAM J. Discret. Math., 2021

Size reconstructibility of graphs.
J. Graph Theory, 2021

Cyclically covering subspaces in F2n.
J. Comb. Theory A, 2021

Exact hyperplane covers for subsets of the hypercube.
Discret. Math., 2021

A note on connected greedy edge colouring.
Discret. Appl. Math., 2021

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Optimal labelling schemes for adjacency, comparability, and reachability.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Parameterized Complexities of Dominating and Independent Set Reconfiguration.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
Intersection sizes of linear subspaces with the hypercube.
J. Comb. Theory A, 2020

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.
CoRR, 2020

2019
H-colouring Pt-free graphs in subexponential time.
Discret. Appl. Math., 2019

2018
H-colouring P<sub>t</sub>-free graphs in subexponential time.
CoRR, 2018

The Curse of Ties in Congestion Games with Limited Lookahead.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2016
Judgment Aggregation under Issue Dependencies.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Probabilistic Multileave for Online Retrieval Evaluation.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015


  Loading...