25 citations · 44 across the 17 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Sabyasachi Basu, Nadia Kōshima, Talya Eden +2
Computing distances and finding shortest paths in massive real-world networks is a fundamental algorithmic task in network analysis. There are two main approaches to solving this t…
cs.GT2024
Plant-and-Steal: Truthful Fair Allocations via Predictions
Ilan Reuven Cohen, Alon Eden, Talya Eden +1
We study truthful mechanisms for approximating the Maximin-Share (MMS) allocation of agents with additive valuations for indivisible goods. Algorithmically, constant factor approxi…
cs.DS2024
Testing -freeness in bounded-arboricity graphs
Talya Eden, Reut Levi, Dana Ron
We study the problem of testing -freeness (-cycle-freeness) for fixed constant in graphs with bounded arboricity (but unbounded degrees). In particular, we are inte…