This paper settles the computational complexity of model checking of several extensions of
the monadic second order (MSO) logic on two classes of graphs: graphs of bounded …

Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …

We consider the Sparse Hitting Set (Sparse-HS) problem, where we are given a set system
$(V,\mathcal {F},\mathcal {B}) $ with two families $\mathcal {F},\mathcal {B} $ of subsets of …

Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration
problem asks whether we can reach one vertex set from the other by repeating prescribed …

A prototypical graph problem is centered around a graph-theoretic property for a set of
vertices and a solution to it is a set of vertices for which the desired property holds. The task …

We study the model checking problem of an extended MSO with local and global cardinality
constraints, called MSO Lin GL, introduced recently by Knop et al.(Log Methods Comput Sci …

Abstract We study a Liquid Democracy framework where voters can express preferences in
an approval form, regarding being represented by a subset of voters, casting a ballot …

Selection of a group of representatives satisfying certain fairness constraints, is a commonly
occurring scenario. Motivated by this, we initiate a systematic algorithmic study of a\emph …

Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …

Knop and Schierreich [AAMAS'23] recently introduced a novel model of refugee housing
and specifically asked for the computational complexity picture of the following variant …