activity
20192024
collaborators

5 papers

cs.IT2024

Group Testing with General Correlation Using Hypergraphs

Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti

Group testing, a problem with diverse applications across multiple disciplines, traditionally assumes independence across nodes' states. Recent research, however, focuses on real-w…

cs.LG2023

Containing a spread through sequential learning: to exploit or to explore?

Xingran Chen, Hesam Nikpey, Jungyeol Kim +2

The spread of an undesirable contact process, such as an infectious disease (e.g. COVID-19), is contained through testing and isolation of infected nodes. The temporal and spatial…

cs.IT2022

Group Testing with Correlation under Edge-Faulty Graphs

Hesam Nikpey, Jungyeol Kim, Xingran Chen +2

In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides…

cs.DS2020

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs

Anindya De, Sanjeev Khanna, Huan Li +1

We give the first polynomial-time approximation scheme (PTAS) for the stochastic load balancing problem when the job sizes follow Poisson distributions. This improves upon the 2-ap…

math.CO2019

On the Maximum Order of Induced Paths and Induced Forests in Regular Graphs

Saieed Akbari, Alireza Amanihamedani, Sepehr Mousavi +2

Let be a graph and , LIF denote the maximum orders of an induced forest and an induced linear forest of , respectively. It is well-known that if is an -reg…