Richard Spence

According to our database, Richard Spence authored at least 14 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Lightweight Near-Additive Spanners.

Yuval Gitlitz, Ofer Neiman, Richard Spence

CoRR, 2024

2023

Multi-priority Graph Sparsification.

Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2021

Weighted Sparse and Lightweight Spanners with Local Additive Error.

Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence

CoRR, 2021

On Additive Spanners in Weighted Graphs with Local Error.

Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Multi-Level Weighted Additive Spanners.

Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Approximation Algorithms for Priority Steiner Tree Problems.

Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Graph spanners: A tutorial review.

Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence

Comput. Sci. Rev., 2020

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

Abu Reyan Ahmed, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence

CoRR, 2020

Weighted Additive Spanners.

Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem.

Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Multi-level Steiner Trees.

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

ACM J. Exp. Algorithmics, 2019

A General Framework for Multi-level Subsetwise Graph Sparsifiers.

Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence

CoRR, 2019

Approximation Algorithms and an Integer Program for Multi-level Graph Spanners.

Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

Computing Vertex-Weighted Multi-Level Steiner Trees.

Faryad Darabi Sahneh, Alon Efrat, Stephen G. Kobourov, Richard Spence

CoRR, 2018