1 citations · 1 across the 6 of their papers we have counts for
6 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…
A Scalable Method for Readable Tree Layouts
Kathryn Gray, Mingwei Li, Reyan Ahmed +4
Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or…
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…
Multicriteria Scalable Graph Drawing via Stochastic 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…