activity
20242026
collaborators

6 papers

cs.FL2026

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…

cs.FL2026

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…

cs.CC2025

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…

cs.DM2024

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…

cs.CC2024

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…

cs.CG2024

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