5 citations · 7 across the 33 of their papers we have counts for
9 papers · 1 filter
Approximation Algorithms for Geometric Maximum Coverage
Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number , select objects maximizing the number of po…
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
Dynamic Light Spanners in Doubling Metrics
Sujoy Bhore, Jonathan Conroy, Arnold Filtser
A -spanner of a point set in a metric space is a graph with vertex set such that, for any pair of points , the distance between and…
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and proved that it is the most efficient batch machine teaching model satisfying the co…
Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
Sujoy Bhore, Anupam Gupta, Amit Kumar
In the online hitting set problem, sets arrive over time, and the algorithm has to maintain a subset of elements that hit all the sets seen so far. Alon, Awerbuch, Azar, Buchbinder…