Céline M. F. Swennenhuis

Inf. Comput., 2024

Steiner Tree Parameterized by Multiway Cut and Even Less.

[BibT_eX]

[DOI]

Bart M. P. Jansen

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.

[BibT_eX]

[DOI]

Jakub Pawlewicz

SIAM J. Comput., December, 2023

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.

[BibT_eX]

[DOI]

Michal Pilipczuk

SIAM J. Discret. Math., September, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2022

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

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Algorithmica, 2022

Isolation Schemes for Problems on Decomposable Graphs.

[BibT_eX]

[DOI]

Michal Pilipczuk

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.

[BibT_eX]

[DOI]

Isja Mannens

Krisztina Szilágyi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Parameterized Complexities of Dominating and Independent Set Reconfiguration.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Carla Groenland

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2019

Parameterized Complexity of Partial Scheduling.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Parallel Machine Scheduling with a Single Resource per Job.

[BibT_eX]

[DOI]

Teun Janssen