research
∙
07/15/2023
Minimum Separator Reconfiguration
We study the problem of reconfiguring one minimum s-t-separator A into a...
share
research
∙
08/26/2022
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs
The Shapley value is the solution concept in cooperative game theory tha...
research
∙
11/02/2020
Gourds: a sliding-block puzzle with turning
We propose a new kind of sliding-block puzzle, called Gourds, where the ...
research
∙
02/25/2020
Hedonic Seat Arrangement Problems
In this paper, we study a variant of hedonic games, called Seat Arrangem...
research
∙
09/26/2019
How does object fatness impact the complexity of packing in d dimensions?
Packing is a classical problem where one is given a set of subsets of Eu...
research
∙
05/25/2019
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
We study Subgraph Isomorphism on graph classes defined by a fixed forbid...
research
∙
08/21/2018
Stable divisorial gonality is in NP
Divisorial gonality and stable divisorial gonality are graph parameters,...
research
∙
07/31/2018
On Exploring Temporal Graphs of Small Pathwidth
We show that the Temporal Graph Exploration Problem is NP-complete, even...
research
∙
03/28/2018
A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
We give an algorithmic and lower-bound framework that facilitates the co...
research
∙
03/28/2018
