Keerti Choudhary

62 papers A* 14A 8B 6Journal 31Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Efficient Algorithms for the Disjoint Shortest Paths Problem and Its Extensions. ITCS Keerti Choudhary, Amit Kumar, Lakshay Saggi
2026	A	`conf`	Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs. ITCS Mridul Ahi, Keerti Choudhary, Shlok Pande, Pushpraj, Lakshay Saggi
2025	A	`conf`	A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs. STACS Keerti Choudhary, Rishabh Dhiman
2025	J	`jnl`	Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions. CoRR Keerti Choudhary, Amit Kumar, Lakshay Saggi
2025	A*	`conf`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. AAAI Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2025	J	`jnl`	Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs. CoRR Mridul Ahi, Keerti Choudhary, Shlok Pande, Pushpraj, Lakshay Saggi
2025	J	`jnl`	New Extremal Bounds for Reachability and Strong-Connectivity Preservers under Failures. ACM Trans. Algorithms Diptarka Chakraborty, Keerti Choudhary
2024	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2024	J	`jnl`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	B	`conf`	Fault-Tolerant Bounded Flow Preservers. ISAAC Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan
2024	J	`jnl`	Fault-Tolerant Bounded Flow Preservers. CoRR Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan
2024	A*	`conf`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	—	`conf`	Reactive Dataflow for Inflight Error Handling in ML Workflows. DEEM@SIGMOD Abhilash Jindal, Kaustubh Beedkar, Vishal Singh, J. Nausheen Mohammed, Tushar Singla, Aman Gupta, Keerti Choudhary
2023	A*	`conf`	Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	B	`conf`	Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	A*	`conf`	Fault-Tolerant ST-Diameter Oracles. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Fault-Tolerant ST-Diameter Oracles. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2023	J	`jnl`	Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	A*	`conf`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	J	`jnl`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	J	`jnl`	Distributed Graph Realizations. IEEE Trans. Parallel Distributed Syst. John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2022	A	`conf`	Fixed-Parameter Sensitivity Oracles. ITCS Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2022	A*	`conf`	Pairwise Reachability Oracles and Preservers Under Failures. ICALP Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary
2021	B	`conf`	Budgeted Dominating Sets in Uncertain Graphs. MFCS Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021	J	`jnl`	Budgeted Dominating Sets in Uncertain Graphs. CoRR Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021	J	`jnl`	Fixed-Parameter Sensitivity Oracles. CoRR Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2021	J	`jnl`	Pairwise Reachability Oracles and Preservers under Failures. CoRR Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary
2020	J	`jnl`	Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2020	A	`conf`	Distributed Graph Realizations †. IPDPS John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2020	J	`jnl`	Distributed Graph Realizations. CoRR John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav
2020	J	`jnl`	Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2020	A*	`conf`	Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. SODA Keerti Choudhary, Omer Gold
2020	—	`conf`	Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2020	A	`conf`	Minimum Neighboring Degree Realization in Graphs and Trees. ESA Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz
2020	A*	`conf`	New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures. ICALP Diptarka Chakraborty, Keerti Choudhary
2020	J	`jnl`	New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures. CoRR Diptarka Chakraborty, Keerti Choudhary
2020	A*	`conf`	New Fault Tolerant Subset Preservers. ICALP Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar
2019	J	`jnl`	An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica Surender Baswana, Keerti Choudhary, Liam Roditty
2019	J	`jnl`	Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. SIAM J. Comput. Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2019	B	`conf`	Efficiently Realizing Interval Sequences. ISAAC Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	J	`jnl`	Efficiently Realizing Interval Sequences. CoRR Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	B	`conf`	Graph Profile Realizations and Applications to Social Networks. WALCOM Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2019	J	`jnl`	Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2018	A*	`conf`	Approximate Single Source Fault Tolerant Shortest Path. SODA Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty
2018	J	`jnl`	Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant. CoRR Keerti Choudhary, Omer Gold
2018	A	`conf`	Efficient Oracles and Routing Schemes for Replacement Paths. STACS Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
2018	J	`jnl`	Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. Surender Baswana, Keerti Choudhary, Liam Roditty
2018	B	`conf`	Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
2017	A*	`conf`	An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP Surender Baswana, Keerti Choudhary, Liam Roditty
2016	A*	`conf`	An Optimal Dual Fault Tolerant Reachability Oracle. ICALP Keerti Choudhary
2016	J	`jnl`	An efficient strongly connected components algorithm in the fault tolerant model. CoRR Surender Baswana, Keerti Choudhary, Liam Roditty
2016	A*	`conf`	Dynamic DFS in Undirected Graphs: breaking the O( SODA Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2016	A*	`conf`	Fault tolerant subgraph for single source reachability: generic and optimal. STOC Surender Baswana, Keerti Choudhary, Liam Roditty
2015	J	`jnl`	Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. CoRR Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2015	A	`conf`	Fault Tolerant Reachability for Directed Graphs. DISC Surender Baswana, Keerti Choudhary, Liam Roditty
2015	J	`jnl`	Integer domination of Cartesian product graphs. Discret. Math. Keerti Choudhary, Susan Margulies, Illya V. Hicks
2015	—	`conf`	On Dynamic DFS Tree in Directed Graphs. MFCS (2) Surender Baswana, Keerti Choudhary
2013	J	`jnl`	A Note on Total and Paired Domination of Cartesian Product Graphs. Electron. J. Comb. Keerti Choudhary, Susan Margulies, Illya V. Hicks