2 citations · 2 across the 7 of their papers we have counts for
8 papers
Adversarially Robust Approximate Furthest Neighbor
Kiarash Banihashem, Jeff Giliberti, Prashant Gokhale +5
We work in the adaptive query model, where one is given a point set and seeks to construct a data structure that can answer correctly and efficiently a seq…
Replicable Composition
Kiarash Banihashem, MohammadHossein Bateni, Hossein Esfandiari +2
Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given problems each…
Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
Kiarash Banihashem, Jeff Giliberti, Samira Goudarzi +3
In this paper, we study the fundamental problems of maintaining the diameter and a -center clustering of a dynamic point set , where points may be insert…
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi +2
We initiate the study of the submodular cover problem in dynamic setting where the elements of the ground set are inserted and deleted. In the classical submodular cover problem, w…
Dynamic Non-monotone Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. More…
Dynamic Algorithms for Matroid Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial op…
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3
Maximizing a monotone submodular function under cardinality constraint is a core problem in machine learning and database with many basic applications, including video and data…
On a question of Haemers regarding vectors in the nullspace of Seidel matrices
Saieed Akbari, Sebastian M. Cioabă, Samira Goudarzi +2
In 2011, Haemers asked the following question: If is the Seidel matrix of a graph of order and is singular, does there exist an eigenvector of corresponding to …