3 citations · 5 across the 7 of their papers we have counts for
10 papers
Burning Signed Graphs
Shaun Fallat, Himanshu Gupta, Kamyar Khodamoradi +1
We introduce and analyze a new model of graph burning, in which two competing fires (coloured yellow and green) ignite vertices of a given signed graph and propagate along its edge…
Distance-based Learning of Hypertrees
Shaun Fallat, Kamyar Khodamoradi, David Kirkpatrick +3
We study the problem of learning hypergraphs with shortest-path queries (SP-queries), and present the first provably optimal online algorithm for a broad and natural class of hyper…
The Computational Complexity of Almost Stable Clustering with Penalties
Kamyar Khodamoradi, Farnam Mansouri, Sandra Zilles
We investigate the complexity of stable (or perturbation-resilient) instances of and clustering problems in metrics with smal…
Independent set in -Claw-Free Graphs: Conditional -boundedness and the Power of LP/SDP Relaxations
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi +1
This paper studies -claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight i…
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
We consider the well-studied Robust -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
This paper considers the well-studied algorithmic regime of designing a -approximation algorithm for a -clustering problem that runs in time (sometimes ca…
Approximation Algorithms for Demand Strip Packing
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli +1
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, each characterized by a processing time and a demand for a given resource (such a…
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
We investigate the complexity of solving stable or perturbation-resilient instances of -Means and -Median clustering in fixed dimension Euclidean metrics (more generally doub…
Approximation Schemes for Clustering with Outliers
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour +1
Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location probl…
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey +1
We consider the problem of allocating a set of indivisible resources (items) to a set of customers (players) competing for the resources. Each resource ha…