Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …

Vertex Integrity is a graph measure which sits squarely between two more well-studied
notions, namely vertex cover and tree-depth, and that has recently gained attention as a …

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 …

In this paper, we aim to study how the performance of modern answer set programming
(ASP) solvers is influenced by the treewidth of the input program and to investigate the …

This paper introduces a novel parameter, called iterated type partition, that can be computed
in polynomial time and nicely places between modular-width and neighborhood diversity …

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 …

Clique-width and treewidth are two of the most important and useful graph parameters, and
several problems can be solved efficiently when restricted to graphs of bounded clique …

Our work focuses on a generalization of the classic Minisum approval voting rule, introduced
by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue …

Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in
linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by …