A Note on Total and Paired Domination of Cartesian Product Graphs. - Keerti Choudhary; Susan Margulies; Illya V. Hicks (Electron. J. Comb., 2013)

On Dynamic DFS Tree in Directed Graphs. - Surender Baswana; Keerti Choudhary (MFCS (2), 2015)

Fault Tolerant Reachability for Directed Graphs. - Surender Baswana; Keerti Choudhary; Liam Roditty (DISC, 2015)

Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (CoRR, 2015)

Integer domination of Cartesian product graphs. - Keerti Choudhary; Susan Margulies; Illya V. Hicks (Discret. Math., 2015)

An Optimal Dual Fault Tolerant Reachability Oracle. - Keerti Choudhary (ICALP, 2016)

Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SODA, 2016)

Fault tolerant subgraph for single source reachability: generic and optimal. - Surender Baswana; Keerti Choudhary; Liam Roditty (STOC, 2016)

Realizability of Graph Specifications: Characterizations and Algorithms. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (SIROCCO, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant. - Keerti Choudhary; Omer Gold (CoRR, 2018)

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. - Surender Baswana; Keerti Choudhary; Liam Roditty (SIAM J. Comput., 2018)

Graph Profile Realizations and Applications to Social Networks. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (WALCOM, 2019)

An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. - Surender Baswana; Keerti Choudhary; Liam Roditty (Algorithmica, 2019)

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (CoRR, 2019)

Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SIAM J. Comput., 2019)

Minimum Neighboring Degree Realization in Graphs and Trees. - Amotz Bar-Noy; Keerti Choudhary; Avi Cohen; David Peleg; Dror Rawitz (ESA, 2020)

New Fault Tolerant Subset Preservers. - Greg Bodwin; Keerti Choudhary; Merav Parter; Noa Shahar (ICALP, 2020)

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. - Keerti Choudhary; Omer Gold (SODA, 2020)

Efficiently Realizing Interval Sequences. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (SIAM J. Discret. Math., 2020)

Approximate Single-Source Fault Tolerant Shortest Path. - Surender Baswana; Keerti Choudhary; Moazzam Hussain; Liam Roditty (ACM Trans. Algorithms, 2020)

Budgeted Dominating Sets in Uncertain Graphs. - Keerti Choudhary; Avi Cohen; N. S. Narayanaswamy; David Peleg; R. Vijayaragunathan (MFCS, 2021)

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (ICALP, 2022)

Pairwise Reachability Oracles and Preservers Under Failures. - Diptarka Chakraborty; Kushagra Chatterjee; Keerti Choudhary (ICALP, 2022)

Fixed-Parameter Sensitivity Oracles. - Davide Bilò; Katrin Casel; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Martin Schirneck; Simon Wietheger (ITCS, 2022)

Distributed Graph Realizations. - John Augustine; Keerti Choudhary; Avi Cohen; David Peleg; Sumathi Sivasubramaniam; Suman Sourav (IEEE Trans. Parallel Distributed Syst., 2022)

Fault-Tolerant ST-Diameter Oracles. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (ICALP, 2023)

Compact Distance Oracles with Large Sensitivity and Low Stretch. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (WADS, 2023)

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (CoRR, 2023)

Graph realizations: Maximum degree in vertex neighborhoods. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (Discret. Math., 2023)

Reactive Dataflow for Inflight Error Handling in ML Workflows. - Abhilash Jindal; Kaustubh Beedkar; Vishal Singh; J. Nausheen Mohammed; Tushar Singla; Aman Gupta; Keerti Choudhary (DEEM@SIGMOD, 2024)

Improved Distance (Sensitivity) Oracles with Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (FOCS, 2024)

Fault-Tolerant Bounded Flow Preservers. - Shivam Bansal; Keerti Choudhary; Harkirat Dhanoa; Harsh Wardhan (ISAAC, 2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (TheoretiCS, 2024)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (AAAI, 2025)

A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs. - Keerti Choudhary; Rishabh Dhiman (STACS, 2025)

New Extremal Bounds for Reachability and Strong-Connectivity Preservers under Failures. - Diptarka Chakraborty; Keerti Choudhary (ACM Trans. Algorithms, 2025)