fixed-parameter tractability 1graph algorithms 1graph parameters 1outer k-planar graphs 1parameterized complexity 1
From the 1 of 10 linked papers with an AI index.
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Concurrency Constrained Scheduling with Tree-Like Constraints
Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
This paper investigates concurrency-constrained scheduling problems, where the objective is to construct a schedule for a set of jobs subject to concurrency restrictions. Formally,…
cs.DM2025
On the parameterized complexity of computing tree-partitions
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obta…