default search action
Carla Groenland
Person information
- affiliation: TU Delft, The Netherlands
- affiliation (former): Utrecht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston:
Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron. Comb. Theory 4(1) (2024) - [j12]Hans L. Bodlaender
, Carla Groenland
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300: 105195 (2024) - [c19]Carla Groenland
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP 2024: 77:1-77:21 - [c18]Carla Groenland, Jesper Nederlof, Tomohiro Koana:
A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. IPEC 2024: 12:1-12:17 - [c17]Paul Bastide, Carla Groenland:
Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength. IPEC 2024: 20:1-20:11 - [i20]Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan:
Longest cycles in vertex-transitive and highly connected graphs. CoRR abs/2408.04618 (2024) - [i19]Carla Groenland, Jesper Nederlof, Tomohiro Koana:
A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K4-Minor. CoRR abs/2410.06793 (2024) - [i18]Paul Bastide, Carla Groenland:
Quasi-linear distance query reconstruction for graphs of bounded treelength. CoRR abs/2410.12594 (2024) - 2023
- [j11]Carla Groenland
Graphs of low average degree without independent transversals. J. Graph Theory 102(2): 374-387 (2023) - [j10]Carla Groenland
Decomposing Random Permutations into Order-Isomorphic Subpermutations. SIAM J. Discret. Math. 37(2): 1252-1261 (2023) - [j9]Carla Groenland
Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms 19(2): 16:1-16:19 (2023) - [c16]Willem Röpke, Carla Groenland, Roxana Radulescu, Ann Nowé, Diederik M. Roijers:
Bridging the Gap Between Single and Multi Objective Games. AAMAS 2023: 224-232 - [c15]Hans L. Bodlaender
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP 2023: 27:1-27:20 - [c14]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen:
Reconstructing Graphs from Connected Triples. WG 2023: 16-29 - [i17]Willem Röpke, Carla Groenland, Roxana Radulescu, Ann Nowé, Diederik M. Roijers:
Bridging the Gap Between Single and Multi Objective Games. CoRR abs/2301.05755 (2023) - [i16]Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland
Reconstructing Graphs from Connected Triples. CoRR abs/2303.06609 (2023) - [i15]Paul Bastide, Carla Groenland:
Optimal distance query reconstruction for graphs without long induced cycles. CoRR abs/2306.05979 (2023) - [i14]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR abs/2312.03859 (2023) - 2022
- [j8]Carla Groenland
Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory B 157: 283-293 (2022) - [c13]Hans L. Bodlaender
List Colouring Trees in Logarithmic Space. ESA 2022: 24:1-24:15 - [c12]Hans L. Bodlaender
On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022: 6:1-6:17 - [c11]Hans L. Bodlaender
On the Parameterized Complexity of Computing Tree-Partitions. IPEC 2022: 7:1-7:20 - [c10]Hans L. Bodlaender
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022: 8:1-8:18 - [c9]Carla Groenland
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS 2022: 36:1-36:20 - [i13]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR abs/2201.13119 (2022) - [i12]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. CoRR abs/2206.09750 (2022) - [i11]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-structured Graphs. CoRR abs/2206.11828 (2022) - [i10]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. CoRR abs/2206.11832 (2022) - 2021
- [j7]Marthe Bonamy
A note on connected greedy edge colouring. Discret. Appl. Math. 304: 129-136 (2021) - [j6]James Aaronson, Carla Groenland
Exact hyperplane covers for subsets of the hypercube. Discret. Math. 344(9): 112490 (2021) - [j5]James Aaronson, Carla Groenland
Cyclically covering subspaces in F2n. J. Comb. Theory A 181: 105436 (2021) - [j4]Carla Groenland
Size reconstructibility of graphs. J. Graph Theory 96(2): 326-337 (2021) - [j3]Louis Esperet
Isometric Universal Graphs. SIAM J. Discret. Math. 35(2): 1224-1237 (2021) - [c8]Hans L. Bodlaender
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS 2021: 193-204 - [c7]Hans L. Bodlaender
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC 2021: 9:1-9:16 - [c6]Carla Groenland, Gwenaël Joret, Wojciech Nadara
Approximating Pathwidth for Graphs of Small Treewidth. SODA 2021: 1965-1976 - [c5]Marthe Bonamy
Optimal labelling schemes for adjacency, comparability, and reachability. STOC 2021: 1109-1117 - [c4]Marthe Bonamy
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. DISC 2021: 13:1-13:18 - [i9]Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR abs/2105.14882 (2021) - [i8]Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR abs/2106.15907 (2021) - [i7]Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek:
A tight local algorithm for the minimum dominating set problem in outerplanar graphs. CoRR abs/2108.02697 (2021) - [i6]Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi:
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. CoRR abs/2110.02730 (2021) - 2020
- [j2]Carla Groenland
Intersection sizes of linear subspaces with the hypercube. J. Comb. Theory A 170 (2020) - [i5]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating pathwidth for graphs of small treewidth. CoRR abs/2008.00779 (2020) - [i4]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability and reachability. CoRR abs/2012.01764 (2020) - [i3]Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR abs/2012.02435 (2020)
2010 – 2019
- 2019
- [j1]Carla Groenland
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - 2018
- [c3]Carla Groenland, Guido Schäfer:
The Curse of Ties in Congestion Games with Limited Lookahead. AAMAS 2018: 1941-1943 - [i2]Carla Groenland, Alex Scott:
H-colouring Pt-free graphs in subexponential time. CoRR abs/1803.05396 (2018) - [i1]Carla Groenland, Guido Schäfer:
The Curse of Ties in Congestion Games with Limited Lookahead. CoRR abs/1804.07107 (2018) - 2016
- [c2]Marco Costantini, Carla Groenland, Ulle Endriss:
Judgment Aggregation under Issue Dependencies. AAAI 2016: 468-474 - 2015
- [c1]Anne Schuth, Robert-Jan Bruintjes
Probabilistic Multileave for Online Retrieval Evaluation. SIGIR 2015: 955-958
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: