default search action
Richard Spence
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Yuval Gitlitz, Ofer Neiman, Richard Spence:
Lightweight Near-Additive Spanners. CoRR abs/2410.23826 (2024) - 2023
- [c8]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 - [i11]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) - 2021
- [c7]Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence
:
Approximation Algorithms for Priority Steiner Tree Problems. COCOON 2021: 112-123 - [c6]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 - [c5]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 - [i10]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) - [i9]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) - [i8]Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Approximation algorithms for priority Steiner tree problems. CoRR abs/2108.13544 (2021) - 2020
- [j2]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli
Graph spanners: A tutorial review. Comput. Sci. Rev. 37: 100253 (2020) - [c4]Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. ESA 2020: 4:1-4:21 - [c3]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence
Weighted Additive Spanners. WG 2020: 401-413 - [i7]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) - [i6]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Weighted Additive Spanners. CoRR abs/2002.07152 (2020)
2010 – 2019
- 2019
- [j1]Abu Reyan Ahmed, Patrizio Angelini
Multi-level Steiner Trees. ACM J. Exp. Algorithmics 24(1): 2.5:1-2.5:22 (2019) - [c2]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli
Approximation Algorithms and an Integer Program for Multi-level Graph Spanners. SEA² 2019: 541-562 - [i5]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) - [i4]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) - [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
- [c1]Abu Reyan Ahmed, Patrizio Angelini
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) - [i1]Faryad Darabi Sahneh, Alon Efrat, Stephen G. Kobourov, Richard Spence:
Computing Vertex-Weighted Multi-Level Steiner Trees. CoRR abs/1811.11700 (2018)
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-12-01 00:18 CET 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: