collaborators

9 papers

cs.SI2026

A Pressure-Based Diffusion Model for Influence Maximization on Social Networks

Curt Stutsman, Eliot W. Robson, Abhishek K. Umrawal

In many real-world scenarios, an individual's local social network carries significant influence over the opinions they form and subsequently propagate. In this paper, we propose a…

cs.SI2026

A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence

Eliot W. Robson, Abhishek K. Umrawal

Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based a…

cs.CG2025

The Fréchet Distance Unleashed: Approximating a Dog with a Frog

Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson

We show that a variant of the continuous Frechet distance between polygonal curves can be computed using essentially the same algorithm used to solve the discrete version. The new…

cs.CG2025

The Road to the Closest Point is Paved by Good Neighbors

Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson

Given a set of points in , and a parameter , we present a new construction of a directed graph , of size $O…

cs.CG2025

Well-Separated Pairs Decomposition Revisited

Sariel Har-Peled, Benjamin Raichel, Eliot W. Robson

We revisit the notion of WSPD (i.e., well-separated pairs-decomposition), presenting a new construction of WSPD for any finite metric space, and show that it is asymptotically inst…

cs.CG2025

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving

Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng

We show the following problems are in : 1. The contiguous art gallery problem -- a variation of the art gallery problem where each guard can protect a contiguous interv…