Recently, Brand, Ganian and Simonov introduced a parameterized refinemen...
In a right-angle crossing (RAC) drawing of a graph, each edge is represe...
Social distance games have been extensively studied as a coalition forma...
Dynamic programming on various graph decompositions is one of the most
f...
Courcelle's theorem and its adaptations to cliquewidth have shaped the f...
Probably Approximately Correct (i.e., PAC) learning is a core concept of...
The QSAT problem, which asks to evaluate a quantified Boolean formula (Q...
The task of finding an extension to a given partial drawing of a graph w...
Treewidth and hypertree width have proven to be highly successful struct...
The generic homomorphism problem, which asks whether an input graph G
ad...
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
An obstacle representation of a graph G consists of a set of pairwise
di...
Tree-cut width is a parameter that has been introduced as an attempt to
...
Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and
...
The recently introduced graph parameter tree-cut width plays a similar r...
We obtain new parameterized algorithms for the classical problem of
dete...
Decompositional parameters such as treewidth are commonly used to obtain...
Hedonic diversity games are a variant of the classical Hedonic games des...
Algorithms for computing or approximating optimal decompositions for
dec...
Point feature labeling is a classical problem in cartography and GIS tha...
A moplex is a natural graph structure that arises when lifting Dirac's
c...
In extension problems of partial graph drawings one is given an incomple...
Recently a strong connection has been shown between the tractability of
...
An h-queue layout of a graph G consists of a linear order of its vertice...
The problem of extending partial geometric graph representations such as...
Algorithmic extension problems of partial graph representations such as
...
We investigate the following many-to-one stable matching problem with
di...
In this paper we propose, implement, and test the first practical
decomp...
We study fundamental clustering problems for incomplete data. In this
se...
We develop a framework for applying treewidth-based dynamic programming ...
A k-page book embedding of a graph G draws the vertices of G on a line a...
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
We propose joinwidth, a new complexity parameter for the Constraint
Sati...
Integer Linear Programming (ILP) can be seen as the archetypical problem...
The Group Activity Selection Problem (GASP) models situations where a gr...
This paper revisits the classical Edge Disjoint Paths (EDP) problem, whe...
We consider two matrix completion problems, in which we are given a matr...
In spite of the close connection between the evaluation of quantified Bo...
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem...