The cluster editing problem asks to transform a given graph into a disjoint union of cliques
by inserting and deleting as few edges as possible. We describe and evaluate an exact …

Finding large" cliquish" subgraphs is a classic NP-hard graph problem. In this work, we
focus on finding maximum $ s $-clubs and $ s $-plexes, ie, graphs of diameter $ s $ and …

We consider a variant of treewidth that we call clique-partitioned treewidth in which each
bag is partitioned into cliques. This is motivated by the recent development of FPT …

At the heart of computer science and artificial intelligence, logic is often used as a powerful
language to model and solve complex problems that arise in academia and in real-world …

Finding a minimum HittingSet is a fundamental optimization problem on hypergraphs.
Despite being NP-complete and even𝑊 [2]-complete (if parametrized by solution size), many …

Power dominating set is a graph problem that asks for the smallest subset of vertices that
can observe all vertices. Observation is defined by two rules. The first one states that all …