Keerti Choudhary

activity

20112026

most citedDynamic DFS Tree in Undirected Graphs: breaking the

O (m)

barrier

14 citations · 19 across the 13 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications

Keerti Choudhary, Amit Kumar, Lakshay Saggi

Sensitivity oracles preprocess a graph so that queries can be answered after any $f$ edge insertions and deletions, without recomputing from scratch. For structural optimization pr…

cs.DS2026

Near-Optimal Replacement Path Coverings

Davide Bilò, Keerti Choudhary, Sarel Cohen +1

Let $L$ and $f$ be positive integers. An $(L, f)$ -replacement path covering (RPC) for a graph $G$ is a family $G$ of subgraphs such that, for every set $F$ of at most $f$ …