The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …

Wolfgang Dvorák, Paul E. Dunne abstract. In this chapter we give an overview of the core
computational problems arising in formal argumentation together with a complexity analysis …

The last decade witnessed an ever-increasing stream of successes in Machine Learning
(ML). These successes offer clear evidence that ML is bound to become pervasive in a wide …

Let M=(E, I) be a matroid and let S={S 1, ċ, S t} be a family of subsets of E of size p. A
subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …

Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …

Computing a (short) path between two vertices is one of the most fundamental primitives in
graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs …

A sunflower with r petals is a collection of r sets so that the intersection of each pair is equal
to the intersection of all. Erdős and Rado proved the sunflower lemma: for any fixed r, any …

We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

A contraction sequence of a graph consists of iteratively merging two of its vertices until only
one vertex remains. The recently introduced twin-width graph invariant is based on …