4 citations · 14 across the 12 of their papers we have counts for
17 papers
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search
Alvin Chiu, Mithun Ghosh, Reyan Ahmed +3
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman…
Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search
Reyan Ahmed, Mithun Ghosh, Kwang-Sung Jun +1
Graph neural networks are useful for learning problems, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.…
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…
An FPT Algorithm for Bipartite Vertex Splitting
Reyan Ahmed, Stephen Kobourov, Myroslav Kryven
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set…
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…
Visualizing Evolving Trees
Kathryn Gray, Mingwei Li, Reyan Ahmed +1
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static…
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…
Weighted Additive Spanners
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +2
A \emph{spanner} of a graph is a subgraph that approximately preserves shortest path distances in . Spanners are commonly applied to compress computation on metric space…
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…
Graph Spanners: A Tutorial Review
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +4
This tutorial review provides a guiding reference to researchers who want to have an overview of the large body of literature about graph spanners. It reviews the current literatur…
Stress-Plus-X (SPX) Graph Layout
Sabin Devkota, Reyan Ahmed, Felice De Luca +2
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these cr…
Multi-Level Graph Sketches via Single-Level Solvers
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3
Given an undirected weighted graph , a constrained sketch over a terminal set is a subgraph that connects the terminal vertices while satisfying a given s…
Approximation algorithms and an integer program for multi-level graph spanners
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3
Given a weighted graph and , a subgraph is a \emph{--spanner} of if the lengths of shortest paths in are preserved in up to a multiplicative fa…
L-Graphs and Monotone L-Graphs
Abu Reyan Ahmed, Felice De Luca, Sabin Devkota +6
In an -embedding of a graph, each vertex is represented by an -segment, and two segments intersect each other if and only if the corresponding vertices are…