1 citations · 1 across the 11 of their papers we have counts for
11 papers
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…
How to Reconfigure Your Alliances
Henning Fernau, Kevin Mann
Different variations of alliances in graphs have been introduced into the graph-theoretic literature about twenty years ago. More broadly speaking, they can be interpreted as group…
Generalized Word-Representable Graphs
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic s…
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
Zhidan Feng, Henning Fernau, Binhai Zhu
Given a road network modelled as a planar straight-line graph with , let , the shortest path (distance) between is denoted as .…
Offensive Alliances in Signed Graphs
Zhidan Feng, Henning Fernau, Kevin Mann +1
Signed graphs have been introduced to enrich graph structures expressing relationships between persons or general social entities, introducing edge signs to reflect the nature of t…
Enumerating Minimal Defensive Alliances
Zhidan Feng, Henning Fernau, Kevin Mann
In this paper, we study the task of enumerating (and counting) locally and globally minimal defensive alliances in graphs. We consider general graphs as well as special graph class…
Perfect Roman Domination and Unique Response Roman Domination
Henning Fernau, Kevin Mann
The idea of enumeration algorithms with polynomial delay is to polynomially bound the running time between any two subsequent solutions output by the enumeration algorithm. While i…
Defensive Alliances in Signed Networks
Emmanuel Arrighi, Zhidan Feng, Henning Fernau +3
The analysis of (social) networks and multi-agent systems is a central theme in Artificial Intelligence. Some line of research deals with finding groups of agents that could work t…