research
∙
05/07/2022
The general position avoidance game and hardness of general position games
Given a graph G, a set S of vertices in G is a general position set if n...
share
research
∙
03/29/2022
Characterizations of graph classes via convex geometries: A survey
Graph convexity has been used as an important tool to better understand ...
research
∙
10/17/2021
Spy game: FPT-algorithm, hardness and graph products
In the (s,d)-spy game over a graph G, k guards and one spy occupy some v...
research
∙
07/10/2020
Target set selection with maximum activation time
A target set selection model is a graph G with a threshold function τ:V→...
research
∙
11/23/2019
Hardness of some variants of the graph coloring game
Very recently, a long-standing open question proposed by Bodlaender in 1...
research
∙
10/18/2018
