research
∙
09/02/2023
Approximating Fair k-Min-Sum-Radii in ℝ^d
The k-center problem is a classical clustering problem in which one is a...
share
research
∙
07/05/2023
Maximum edge colouring problem on graphs that exclude a fixed minor
The maximum edge colouring problem considers the maximum colour assignme...
research
∙
06/13/2023
An update on (n,m)-chromatic numbers
An (n,m)-graph is a graph with n types of arcs and m types of edges. A h...
research
∙
03/15/2022
On Comparable Box Dimension
Two boxes in ℝ^d are comparable if one of them is a subset of a translat...
research
∙
12/14/2021
Reconfiguring Shortest Paths in Graphs
Reconfiguring two shortest paths in a graph means modifying one shortest...
research
∙
10/25/2021
Parameterized Convexity Testing
In this work, we develop new insights into the fundamental problem of co...
research
∙
05/04/2021
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
We give polynomial-time approximation schemes for monotone maximization ...
research
∙
12/17/2019
Approximating MIS over equilateral B_1-VPG graphs
We present an approximation algorithm for the maximum independent set (M...
research
∙
10/25/2019