Swennenhuis, Céline M. F.

1. Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
   2021/05/31 by Hans L. Bodlaender, Carla Groenland, Bodlaender, Hans L. +5 · 5 citations
   Computer Science · Engineering · #Advanced Graph Theory Research #Scheduling and Optimization Algorithms #Complexity and Algorithms in Graphs
2. Steiner Tree Parameterized by Multiway Cut and Even Less
   2024/06/28 by Jansen, Bart M. P., Swennenhuis, Céline M. F. · 2 citations
   #05C85 #68Q27 #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences
3. Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
   2020/02/11 by Jesper Nederlof, Michał Pilipczuk, Nederlof, Jesper +5 · 1 citation
   Computer Science · #68Q25 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2 #FOS: Computer and information sciences #Graph Theory and Algorithms
4. Parameterized Complexities of Dominating and Independent Set Reconfiguration
   2021/06/30 by Bodlaender, Hans L., Groenland, Carla, Swennenhuis, Céline M. F. · 1 citation
   #68Q25 #68Q27 #Computational Complexity (cs.CC) #FOS: Computer and information sciences