research
∙
06/03/2023
Make a graph singly connected by edge orientations
A directed graph D is singly connected if for every ordered pair of vert...
share
research
∙
12/11/2022
Beyond circular-arc graphs – recognizing lollipop graphs and medusa graphs
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected grap...
research
∙
06/22/2022
Dispersing Obnoxious Facilities on Graphs by Rounding Distances
We continue the study of δ-dispersion, a continuous facility location pr...
research
∙
05/18/2021
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Given an undirected graph, a conflict-free coloring (CFON*) is an assign...
research
∙
11/23/2020
Recognizing Proper Tree-Graphs
We investigate the parameterized complexity of the recognition problem f...
research
∙
10/22/2020
An Investigation of the Recoverable Robust Assignment Problem
We investigate the so-called recoverable robust assignment problem on ba...
research
∙
10/01/2019
The Complexity of Packing Edge-Disjoint Paths
We introduce and study the complexity of Path Packing. Given a graph G a...
research
∙
11/21/2018
Dispersing obnoxious facilities on a graph
We study a continuous facility location problem on a graph where all edg...
research
∙
10/02/2017
