We study the problem of reconfiguring one minimum s-t-separator A into
a...
The Shapley value is the solution concept in cooperative game theory tha...
We propose a new kind of sliding-block puzzle, called Gourds, where the
...
In this paper, we study a variant of hedonic games, called Seat
Arrangem...
Packing is a classical problem where one is given a set of subsets of
Eu...
We study Subgraph Isomorphism on graph classes defined by a fixed forbid...
Divisorial gonality and stable divisorial gonality are graph parameters,...
We show that the Temporal Graph Exploration Problem is NP-complete, even...
We give an algorithmic and lower-bound framework that facilitates the
co...
We give an algorithmic and lower-bound framework that facilitates the
co...