Author

Diya Roy

h-index 4 View on Semantic Scholar

We have 2 of 14 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Subexponential Parameterized Approximation for Group-Fair Euclidean $k$-Center

This work gives a separator-based recursive approximation algorithm for the continuous-center setting of the group-fair Euclidean problem in fixed dimension, where the input points are partitioned into disjoint color classes, and every cluster must satisfy given lower and upper bounds on the fraction of each color.

Rudranarayan Kar, Diya Roy, Abhishek Sahu · 0 citations

Jul 2026

Exploiting Graph Structure for Near-Optimal Broadcasting

A faster approximation algorithms that produce valid schedules for telephone broadcasting, and parameterized hardness for vertex cover above maximum matching, dominating set size, and graph diameter, indicating that FPT algorithms for these parameters are unlikely.

Rudranarayan Kar, Praneet Kumar Patra, Diya Roy et al. · arXiv.org · 0 citations