4 citations · 14 across the 12 of their papers we have counts for
4 papers · 1 filter
Multi-Priority Graph Sparsification
Reyan Ahmed, Keaton Hamm, Stephen Kobourov +3
A \emph{sparsification} of a given graph is a sparser graph (typically a subgraph) which aims to approximate or preserve some property of . Examples of sparsifications inclu…
New Results and Bounds on Online Facility Assignment Problem
Saad Al Muttakee, Abu Reyan Ahmed, Md. Saidur Rahman
Consider an online facility assignment problem where a set of facilities of equal capacity is situated on a metric space and customer…
Graph Drawing via Gradient Descent,
Reyan Ahmed, Felice De Luca, Sabin Devkota +2
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying da…
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm +2
We study the multi-level Steiner tree problem: a generalization of the Steiner tree problem in graphs where terminals require varying priority, level, or quality of service. In…