research
∙
07/07/2023
Line-Constrained k-Semi-Obnoxious Facility Location
Suppose we are given a set B of blue points and a set R of red points, a...
share
research
∙
09/19/2022
Parameterized Complexity of Path Set Packing
In PATH SET PACKING, the input is an undirected graph G, a collection P ...
research
∙
03/28/2022
Chess is hard even for a single player
We introduce a generalization of "Solo Chess", a single-player variant o...
research
∙
07/19/2021
Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms
In an undirected graph G=(V,E), we say (A,B) is a pair of perfectly matc...
research
∙
01/18/2021
An FPT algorithm for Matching Cut
In an undirected graph, a matching cut is an edge cut which is also a ma...
research
∙
10/03/2020
Planar projections of graphs
We introduce and study a new graph representation where vertices are emb...
research
∙
12/31/2019
Structure and colour in triangle-free graphs
Motivated by a recent conjecture of the first author, we prove that ever...
research
∙
04/11/2018
