Céline M. F. Swennenhuis

Orcid: 0000-0001-9654-8094

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Céline M. F. Swennenhuis authored at least 11 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
SIAM J. Comput., December, 2023

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.
SIAM J. Discret. Math., September, 2023

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.
CoRR, 2023

2022
Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995<sup>n</sup>) time.
CoRR, 2022

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.
Algorithmica, 2022

Isolation Schemes for Problems on Decomposable Graphs.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

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

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2019
Parameterized Complexity of Partial Scheduling.
CoRR, 2019

2018
Parallel Machine Scheduling with a Single Resource per Job.
CoRR, 2018


  Loading...