2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CG2017★ 2 cited
Range-Clustering Queries
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2
In a geometric -clustering problem the goal is to partition a set of points in into subsets such that a certain cost function of the clustering is minimized.…
cs.DS2015
Finding Pairwise Intersections Inside a Query Range
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-a…
cs.CC2009
On Unique Independence Weighted Graphs
Farzad Didehvar, Ali D. Mehrabi, Fatemeh Raee B
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-wei…