4 citations · 9 across the 18 of their papers we have counts for
5 papers · 1 filter
Lettericity Is NP-Complete
Henning Fernau, Samuel German, Kevin Mann +1
The lettericity of a graph is the smallest size of a set such that there exist and a so-called decoder for which is is…
Parameterized Enumeration of Minimal Defensive Alliances
Henning Fernau, Kevin Mann, Arne Meier +1
In this paper, we consider the complexity of enumerating inclusion minimal defensive alliances. We present a polynomial-delay algorithm on graphs with maximum degree 5. We compleme…
Language-Representability: Possibilities and Limitations
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The study of word-representability was initiated by the seminal work of Kitaev and Pyatkin in 2008 that has later led to the monograph by Kitaev and Lozin in 2015. In this paper, w…
On Languages Describing Large Graph Classes
Henning Fernau, Pamela Fleischmann, Kevin Mann +1
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we…
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
Jean Cardinal, Kevin Mann, Akira Suzuki +3
We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a graph and two ind…