T. Kavitha

activity

20242026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Low-Cost Arborescence Under Edge Faults

Dipan Dey, Telikepalli Kavitha

Our input is a directed graph $G = (V, E)$ on $n$ vertices and $m$ edges with a designated root vertex $r$ and a function $cos t : E \to R_{\geq 0}$ . The problem is t…

cs.DS2025

Fault-Tolerant Approximate Distance Oracles with a Source Set

Dipan Dey, Telikepalli Kavitha

Our input is an undirected weighted graph $G = (V, E)$ on $n$ vertices along with a source set $S \subseteq V$ . The problem is to preprocess $G$ and build a compact data structure su…

cs.DS2024

Perfect Matchings and Popularity in the Many-to-Many Setting

Telikepalli Kavitha, Kazuhisa Makino

We consider a matching problem in a bipartite graph $G$ where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on t…