default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbu Reyan Ahmed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Kathryn Gray
, Mingwei Li, Abu Reyan Ahmed, Md. Khaledur Rahman, Ariful Azad, Stephen G. Kobourov, Katy Börner:
A Scalable Method for Readable Tree Layouts. IEEE Trans. Vis. Comput. Graph. 30(2): 1564-1578 (2024)- [i22]Abu Reyan Ahmed, Cesim Erten, Stephen G. Kobourov, Jonah Lotz, Jacob Miller, Hamlet Taraz:
Size Should not Matter: Scale-invariant Stress Metrics. CoRR abs/2408.04688 (2024) - 2023
- [j5]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [c12]Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence:
Multi-priority Graph Sparsification. IWOCA 2023: 1-12 - [i21]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i20]Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence:
Multi-Priority Graph Sparsification. CoRR abs/2301.12563 (2023) - [i19]Abu Reyan Ahmed, Mithun Ghosh, Kwang-Sung Jun, Stephen G. Kobourov:
Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search. CoRR abs/2305.00535 (2023) - [i18]Kathryn Gray, Mingwei Li, Abu Reyan Ahmed, Md. Khaledur Rahman, Ariful Azad, Stephen G. Kobourov, Katy Börner:
A Scalable Method for Readable Tree Layouts. CoRR abs/2305.09925 (2023) - [i17]Alvin Chiu, Mithun Ghosh, Abu Reyan Ahmed, Kwang-Sung Jun, Stephen G. Kobourov, Michael T. Goodrich:
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search. CoRR abs/2311.10316 (2023) - 2022
- [j4]Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li:
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, $(SGD)^{2}$(SGD)2. IEEE Trans. Vis. Comput. Graph. 28(6): 2388-2399 (2022) - [c11]Abu Reyan Ahmed, Stephen G. Kobourov, Myroslav Kryven:
An FPT Algorithm for Bipartite Vertex Splitting. GD 2022: 261-268 - [c10]Kathryn Gray, Mingwei Li, Abu Reyan Ahmed, Stephen G. Kobourov:
Visualizing Evolving Trees. GD 2022: 319-335 - [i16]Abu Reyan Ahmed, Stephen G. Kobourov, Myroslav Kryven:
An FPT Algorithm for Bipartite Vertex Splitting. CoRR abs/2208.12898 (2022) - 2021
- [c9]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-Level Weighted Additive Spanners. SEA 2021: 16:1-16:23 - [c8]Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
On Additive Spanners in Weighted Graphs with Local Error. WG 2021: 361-373 - [i15]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-level Weighted Additive Spanners. CoRR abs/2102.05831 (2021) - [i14]Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Weighted Sparse and Lightweight Spanners with Local Additive Error. CoRR abs/2103.09731 (2021) - [i13]Kathryn Gray, Mingwei Li, Abu Reyan Ahmed, Stephen G. Kobourov:
Visualizing Evolving Trees. CoRR abs/2106.08843 (2021) - [i12]Abu Reyan Ahmed, Md Asadullah Turja, Faryad Darabi Sahneh, Mithun Ghosh, Keaton Hamm, Stephen G. Kobourov:
Computing Steiner Trees using Graph Neural Networks. CoRR abs/2108.08368 (2021) - [i11]Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li:
Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)2. CoRR abs/2112.01571 (2021) - 2020
- [j3]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence:
Graph spanners: A tutorial review. Comput. Sci. Rev. 37: 100253 (2020) - [j2]Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov:
Online facility assignment. Theor. Comput. Sci. 806: 455-467 (2020) - [c7]Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. ESA 2020: 4:1-4:21 - [c6]Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li:
Graph Drawing via Gradient Descent, (GD)2. GD 2020: 3-17 - [c5]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Weighted Additive Spanners. WG 2020: 401-413 - [i10]Abu Reyan Ahmed, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Kruskal-based approximation algorithm for the multi-level Steiner tree problem. CoRR abs/2002.06421 (2020) - [i9]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Weighted Additive Spanners. CoRR abs/2002.07152 (2020) - [i8]Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li:
Graph Drawing via Gradient Descent, (GD)2. CoRR abs/2008.05584 (2020) - [i7]Saad Al Muttakee, Abu Reyan Ahmed, Md. Saidur Rahman:
New Results and Bounds on Online Facility Assignment Problem. CoRR abs/2009.01446 (2020)
2010 – 2019
- 2019
- [j1]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-level Steiner Trees. ACM J. Exp. Algorithmics 24(1): 2.5:1-2.5:22 (2019) - [c4]Sabin Devkota, Abu Reyan Ahmed, Felice De Luca, Katherine E. Isaacs, Stephen G. Kobourov:
Stress-Plus-X (SPX) Graph Layout. GD 2019: 291-304 - [c3]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
Approximation Algorithms and an Integer Program for Multi-level Graph Spanners. SEA² 2019: 541-562 - [i6]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
Approximation algorithms and an integer program for multi-level graph spanners. CoRR abs/1904.01135 (2019) - [i5]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
A General Framework for Multi-level Subsetwise Graph Sparsifiers. CoRR abs/1905.00536 (2019) - [i4]Sabin Devkota, Abu Reyan Ahmed, Felice De Luca, Kate Isaacs, Stephen G. Kobourov:
Stress-Plus-X (SPX) Graph Layout. CoRR abs/1908.01769 (2019) - [i3]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence:
Graph Spanners: A Tutorial Review. CoRR abs/1909.03152 (2019) - 2018
- [c2]Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov:
Online Facility Assignment. WALCOM 2018: 156-168 - [c1]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-Level Steiner Trees. SEA 2018: 15:1-15:14 - [i2]Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff:
Multi-Level Steiner Trees. CoRR abs/1804.02627 (2018) - 2017
- [i1]Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Alon Efrat, Md. Iqbal Hossain, Stephen G. Kobourov, Jixian Li, Sammi Abida Salma, Eric Welch:
L-Graphs and Monotone L-Graphs. CoRR abs/1703.01544 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
