T. Kavitha

activity

20072026

most citedOn Pairwise Spanners

21 citations · 75 across the 20 of their papers we have counts for

collaborators

Showing cs.DSShow all

16 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…

cs.DS2023

Arborescences, Colorful Forests, and Popularity

Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter +1

Our input is a directed, rooted graph $G = (V \cup {r}, E)$ where each vertex in $V$ has a partial order preference over its incoming edges. The preferences of a vertex extend nat…

cs.DS2022

Popular Matchings with One-Sided Bias

Telikepalli Kavitha

Let $G = (A \cup B, E)$ be a bipartite graph where the set $A$ consists of agents or main players and the set $B$ consists of jobs or secondary players. Every vertex has a strict ra…

cs.DS2021

The popular assignment problem: when cardinality is more important than popularity

Telikepalli Kavitha, Tamás Király, Jannik Matuschke +2

We consider a matching problem in a bipartite graph $G = (A \cup B, E)$ where nodes in $A$ are agents having preferences in partial order over their neighbors, while nodes in $B$ are o…