1 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
Akash Kumar, Abhiruk Lahiri, C. Seshadhri
Consider a bounded-degree graph that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $…
Approximating Fair -Min-Sum-Radii in Euclidean Space
Lukas Drexler, Annika Hennes, Abhiruk Lahiri +2
The -center problem is a classical clustering problem in which one is asked to find a partitioning of a point set into clusters such that the maximum radius of any clust…
Parameterized Convexity Testing
Abhiruk Lahiri, Ilan Newman, Nithin Varma
In this work, we develop new insights into the fundamental problem of convexity testing of real-valued functions over the domain . Specifically, we present a nonadaptive algor…
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
Zdeněk Dvořák, Abhiruk Lahiri
We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances (up to a fixed upper bound) and efficiently solvable in graphs of…
Approximating MIS over equilateral -VPG graphs
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
We present an approximation algorithm for the maximum independent set (MIS) problem over the class of equilateral -VPG graphs. These are intersection graphs of -shaped plan…