114 citations · 389 across the 45 of their papers we have counts for
60 papers
The Parameterized Complexity of Problems on Outer k-Planar Graphs
Xiaobin Ren, Hans L. Bodlaender
A graph is outer k-planar if it admits a straight-line drawing in which all vertices lie on a circle and every edge is crossed by at most k other edges. We study the parameterized…
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Hans L. Bodlaender, Maher Mallem
In this paper, we study the parameterized complexity of several variants of scheduling with precedence constraints between jobs. Namely, we consider the single machine setting with…
Trade-off between spread and width for tree decompositions
Hans L. Bodlaender, Carla Groenland, Sergey Norin +1
The spread of a vertex in a tree decomposition is the number of bags that contain . We study the trade-off between spread and width in tree decompositions, answering every o…
On Stable Cutsets in General and Minimum Degree Constrained Graphs
Mats Vroon, Hans L. Bodlaender
A stable cutset is a set of vertices of a connected graph, that is pairwise non-adjacent and when deleting , the graph becomes disconnected. Determining the existence of a s…
On Equivalent Characterizations of the Polynomial Hierarchy in Abstract Models of Computation
Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow +1
We investigate machine models similar to Turing machines that are augmented with the operations of a first-order structure , and we show that under weak conditions on…
Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen
The induced matching width of a tree decomposition of a graph is the cardinality of a largest induced matching of , such that there exists a bag that intersects every ed…