21 citations · 75 across the 20 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Fault-Tolerant Approximate Distance Oracles with a Source Set
Dipan Dey, Telikepalli Kavitha
Our input is an undirected weighted graph on vertices along with a source set . The problem is to preprocess and build a compact data structure su…
cs.GT2025
Best-of-Both-Worlds Guarantees with Fairer Endings
Telikepalli Kavitha, Surya Panchapakesan, Rohit Vaish +2
Fair allocation of indivisible goods is a fundamental problem at the interface of economics and computer science. Traditional approaches focus either on randomized allocations that…