We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
In this paper, we give a very simple proof that Treewidth is NP-complete...
The Shapley value is the solution concept in cooperative game theory tha...
In this paper, we show that Binary CSP with the size of a vertex cover a...
We study the parameterized complexity of computing the tree-partition-wi...
In this paper, we introduce a new class of parameterized problems, which...
We show that List Colouring can be solved on n-vertex trees by a
determi...
We show that some natural problems that are XNLP-hard (which implies
W[t...
In this paper, we show several parameterized problems to be complete for...
We settle the parameterized complexities of several variants of independ...
Let XNLP be the class of parameterized problems such that an instance of...
In this paper, we show that Bandwidth is hard for the complexity class W...
In this paper, we consider the parameterized complexity of the following...
For a graph class 𝒞, the 𝒞-Edge-Deletion
problem asks for a given graph ...
In this paper, we give a constructive proof of the fact that the treewid...
In this paper, we study a variant of hedonic games, called Seat
Arrangem...
We study Subgraph Isomorphism on graph classes defined by a fixed forbid...
In this paper, we show that the Cutwidth, Modified Cutwidth, and Vertex
...
Given a graph G, a q-open neighborhood conflict-free coloring or
q-ONCF-...
In this paper, we study knot diagrams for which the underlying graph has...
Divisorial gonality and stable divisorial gonality are graph parameters,...
We show that the Temporal Graph Exploration Problem is NP-complete, even...
We study exact algorithms for Euclidean TSP in R^d. In the
early 1990s ...
In this paper, we consider tree decompositions, branch decompositions, a...
We give an algorithmic and lower-bound framework that facilitates the
co...
We give an algorithmic and lower-bound framework that facilitates the
co...
Simulations where we have some prior information on the probability
dist...
The currently most efficient algorithm for inference with a probabilisti...
For many real-life Bayesian networks, common knowledge dictates that the...