The idea of enumeration algorithms with polynomial delay is to polynomia...
The analysis of (social) networks and multi-agent systems is a central t...
Roman domination is one of few examples where the related extension prob...
The concept of sum labelling was introduced in 1990 by Harary. A graph i...
We study the algorithmic complexity of partitioning the vertex set of a ...
A graph G is well-covered if every minimal vertex cover of G is minimum,...
The concept of Roman domination has recently been studied concerning
enu...
All roads lead to Rome is the core idea of the puzzle game Roma. It is p...
We consider the unlabeled motion-planning problem of m unit-disc robots
...
The question to enumerate all inclusion-minimal connected dominating set...
Roman domination is one of the many variants of domination that keeps mo...
The problem DFA-Intersection-Nonemptiness asks if a given number of
dete...
A graph is called a sum graph if its vertices can be labelled by distinc...
In its most traditional setting, the main concern of optimization theory...
The question if a deterministic finite automaton admits a software reset...
We generalize the concept of synchronizing words for finite automata, wh...
The Int_reg-problem of a combinatorial problem P asks, given a
nondeterm...
We consider extension variants of the classical graph problems Vertex Co...
The question if a given partial solution to a problem can be extended
re...
Unit square (grid) visibility graphs (USV and USGV, resp.) are described...