
Finite Automata Intersection NonEmptiness: Parameterized Complexity Revisited
The problem DFAIntersectionNonemptiness asks if a given number of dete...
read it

The Space Complexity of Sum Labelling
A graph is called a sum graph if its vertices can be labelled by distinc...
read it

Diversity in Kemeny Rank Aggregation: A Parameterized Approach
In its most traditional setting, the main concern of optimization theory...
read it

Synchronizing Deterministic PushDown Automata Can Be Really Hard
The question if a deterministic finite automaton admits a software reset...
read it

Synchronization of Deterministic Visibly PushDown Automata
We generalize the concept of synchronizing words for finite automata, wh...
read it

Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata
The Int_regproblem of a combinatorial problem P asks, given a nondeterm...
read it

Extension of vertex cover and independent set in some classes of graphs and generalizations
We consider extension variants of the classical graph problems Vertex Co...
read it

On the Complexity of Solution Extension of Optimization Problems
The question if a given partial solution to a problem can be extended re...
read it

Combinatorial Properties and Recognition of Unit Square Visibility Graphs
Unit square (grid) visibility graphs (USV and USGV, resp.) are described...
read it
Henning Fernau
is this you? claim profile