research
∙
08/30/2023
Data reduction for directed feedback vertex set on graphs without long induced cycles
We study reduction rules for Directed Feedback Vertex Set (DFVS) on inst...
share
research
∙
07/15/2023
Minimum Separator Reconfiguration
We study the problem of reconfiguring one minimum s-t-separator A into a...
research
∙
04/27/2023
On Solution Discovery via Reconfiguration
The dynamics of real-world applications and systems require efficient me...
research
∙
09/12/2022
On finding short reconfiguration sequences between independent sets
Assume we are given a graph G, two independent sets S and T in G of size...
research
∙
06/29/2022
Combinatorial and Algorithmic Aspects of Monadic Stability
Nowhere dense classes of graphs are classes of sparse graphs with rich s...
research
∙
05/02/2022
Token sliding on graphs of girth five
In the Token Sliding problem we are given a graph G and two independent ...
research
∙
04/22/2022
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
A graph vertex-subset problem defines which subsets of the vertices of a...
research
∙
04/21/2022
Parallel Vertex Cover Algorithms on GPUs
Finding small vertex covers in a graph has applications in numerous doma...
research
∙
04/12/2022
Galactic Token Sliding
Given a graph G and two independent sets I_s and I_t of size k, the inde...
research
∙
07/26/2021
Parameterized complexity of reconfiguration of atoms
Our work is motivated by the challenges presented in preparing arrays of...
research
∙
07/03/2020
On girth and the parameterized complexity of token sliding and token jumping
In the Token Jumping problem we are given a graph G = (V,E) and two inde...
research
∙
10/01/2019
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
In a reconfiguration version of an optimization problem Q the input is a...
research
∙
07/09/2017