Abu Reyan Ahmed

Orcid: 0000-0001-6830-9053

According to our database1, Abu Reyan Ahmed authored at least 25 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Scalable Method for Readable Tree Layouts.
IEEE Trans. Vis. Comput. Graph., February, 2024

2023
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search.
CoRR, 2023

Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search.
CoRR, 2023

Splitting Vertices in 2-Layer Graph Drawings.
IEEE Computer Graphics and Applications, 2023

Multi-priority Graph Sparsification.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, $(SGD)^{2}$(SGD)2.
IEEE Trans. Vis. Comput. Graph., 2022

Visualizing Evolving Trees.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

An FPT Algorithm for Bipartite Vertex Splitting.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)<sup>2</sup>.
CoRR, 2021

Computing Steiner Trees using Graph Neural Networks.
CoRR, 2021

Weighted Sparse and Lightweight Spanners with Local Additive Error.
CoRR, 2021

On Additive Spanners in Weighted Graphs with Local Error.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Multi-Level Weighted Additive Spanners.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020
Online facility assignment.
Theor. Comput. Sci., 2020

Graph spanners: A tutorial review.
Comput. Sci. Rev., 2020

New Results and Bounds on Online Facility Assignment Problem.
CoRR, 2020

Kruskal-based approximation algorithm for the multi-level Steiner tree problem.
CoRR, 2020

Weighted Additive Spanners.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Graph Drawing via Gradient Descent, (GD)<sup>2</sup>.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Multi-level Steiner Trees.
ACM J. Exp. Algorithmics, 2019

A General Framework for Multi-level Subsetwise Graph Sparsifiers.
CoRR, 2019

Approximation Algorithms and an Integer Program for Multi-level Graph Spanners.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Stress-Plus-X (SPX) Graph Layout.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2017
L-Graphs and Monotone L-Graphs.
CoRR, 2017


  Loading...