4 citations · 8 across the 5 of their papers we have counts for
11 papers
Computing Steiner Trees using Graph Neural Networks
Reyan Ahmed, Md Asadullah Turja, Faryad Darabi Sahneh +3
Graph neural networks have been successful in many learning problems and real-world applications. A recent line of research explores the power of graph neural networks to solve com…
Multi-level Weighted Additive Spanners
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +3
Given a graph , a subgraph is an \emph{additive spanner} if $\dist_H(u,v) \le \dist_G(u,v) + β$ for all . A \emph{pairwise spanner} is a spanner for…
On additive spanners in weighted graphs with local error
Reyan Ahmed, Greg Bodwin, Keaton Hamm +2
An \emph{additive spanner} of a graph is a subgraph which preserves distances up to an additive error. Additive spanners are well-studied in unweighted graphs but hav…
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…