M. Monemizadeh

activity

20142026

most citedKernelization via Sampling with Applications to Dynamic Graph Streams

13 citations · 35 across the 15 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2025

Range Counting Oracles for Geometric Problems

Anne Driemel, Morteza Monemizadeh, Eunjin Oh +2

In this paper, we study estimators for geometric optimization problems in the sublinear geometric model. In this model, we have oracle access to a point set with size $n$ in a disc…

cs.CG2021★ 2 cited

$k$ -Center Clustering with Outliers in the Sliding-Window Model

Mark de Berg, Morteza Monemizadeh, Yu Zhong

The $k$ -center problem for a point set~ $P$ asks for a collection of $k$ congruent balls (that is, balls of equal radius) that together cover all the points in $P$ and whose radius…

cs.CG2021

Clique-Based Separators for Geometric Intersection Graphs

Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh +1

Let $F$ be a set of $n$ objects in the plane and let $G (F)$ be its intersection graph. A balanced clique-based separator of $G (F)$ is a set $S$ consisting of cliques whose removal…

Range Counting Oracles for Geometric Problems

k-Center Clustering with Outliers in the Sliding-Window Model

Clique-Based Separators for Geometric Intersection Graphs

$k$ -Center Clustering with Outliers in the Sliding-Window Model