A refined search tree technique for Dominating Set on planar graphs

scholarly article by Jochen Alber et al published November 2005 in Journal of Computer and System Sciences

An exact algorithm for the Maximum Leaf Spanning Tree problem

Aspects of upper defensive alliances

Characterization and complexity results on jumping finite automata

Clustering with Lower-Bounded Sizes

Combinatorics for smaller kernels: The differential of a graph

Complexity of independency and cliquy trees

Computing the metric dimension for chain graphs

Data reductions and combinatorial bounds for improved approximation algorithms

Facility Location Problems: A Parameterized View

Facility location problems: A parameterized view

Investigations on the power of matrix insertion-deletion systems with small sizes

Kernel(s) for problems with no kernel

Offensive r -alliances in graphs

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

article by Henning Fernau et al published January 2018 in RAIRO - Theoretical Informatics and Applications

On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results

scholarly article by Henning Fernau & Juan A. Rodríguez-Velázquez published February 2018 in Discrete Applied Mathematics

On the computational completeness of graph-controlled insertion–deletion systems with binary sizes

On the parameterized complexity of vertex cover and edge cover with connectivity constraints

Preface to Martin Kutrib Festschrift

artículo científico publicado en 2021

Problems on Finite Automata and the Exponential Time Hypothesis

Properties of graphs specified by a regular language

artículo científico publicado en 2022

Ranking and Drawing in Subexponential Time

Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

Special Issue on Reconfiguration Problems

The Curse of Connectivity: t-Total Vertex (Edge) Cover

The complexity of probabilistic lobbying

Weak total resolvability in graphs

nonblocker: Parameterized Algorithmics for minimum dominating set