Keerti Choudhary
I am an assistant professor in the Computer Science and Engineering department at IIT Delhi. Prior to that, I was a post-doctoral fellow at Tel Aviv University, and Weizmann Institute of Science. I did my Ph.D. in Computer Science, and Integrated M.Sc. in Mathematics, from IIT Kanpur.
Research: My research interest lies in graph theory and algorithms, especially dynamic and fault-tolerant graph structures.
Here is a link to my CV.
Courses
- 2026-27 (Sem I) : Mathematical Foundations of Computer Science (COL7004)
- 2025-26 (Sem II) : Introduction to Programming (COL1000)
- 2025-26 (Sem I) : Algorithmic Graph Theory (COL 751 / COL7151)
- 2024-25 (Sem II) : Analysis and Design of Algorithms (COL 351)
- 2024-25 (Sem I) : Algorithmic Graph Theory (COL 751)
- 2023-24 (Sem II) : Analysis and Design of Algorithms (COL 351)
- 2023-24 (Sem I) : Algorithmic Graph Theory (COL 751)
- 2022-23 (Sem II) : Data Structures and Algorithms (COL 106)
- 2022-23 (Sem I) : Analysis and Design of Algorithms (COL 351)
- 2021-22 (Sem II) : Advanced Algorithms (COL 758)
- 2021-22 (Sem I) : Analysis and Design of Algorithms (COL 351)
- 2020-21 (Sem II) : Compact Graph Data-Structures (Special Topics in Algorithms COL 866)
Publications
*Listed chronologically
- Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs with Mridul Ahi, Shlok Pande, Pushpraj, Lakshay Saggi ITCS 2026 - Innovations in Theoretical Computer Science Conference
- Efficient Algorithms for the Disjoint Shortest Paths Problem and Its Extensions with Amit Kumar, Lakshay Saggi ITCS 2026 - Innovations in Theoretical Computer Science Conference
- A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs with Rishabh Dhiman STACS 2025 - Symposium on Theoretical Aspects of Computer Science
- Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks with Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck AAAI 2025 - Association for the Advancement of Artificial Intelligence
- Improved Distance (Sensitivity) Oracles with Subquadratic Space with Davide Bilò, Shiri Chechik, Sarel Cohen, Tobias Friedrich, Martin Schirneck FOCS 2024 - IEEE Annual Symposium on Foundations of Computer Science
- Fault-Tolerant Bounded Flow Preservers with Shivam Bansal, Harkirat Dhanoa, Harsh Wardhan ISAAC 2024 - International Symposium on Algorithms and Computation
- Reactive Dataflow for Inflight Error Handling in ML Workflows with Abhilash Jindal, Kaustubh Beedkar, Vishal Singh, J. Nausheen Mohammed, Tushar Singla, Aman Gupta DEEM@SIGMOD 2024
- Approximate Distance Sensitivity Oracles in Subquadratic Space with Davide Bilò, Shiri Chechik, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck STOC 2023 - Symposium on the Theory of Computing TheoretiCS 2024
- Fault-Tolerant ST-Diameter Oracles with Davide Bilò, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck ICALP 2023 - International Colloquium on Automata, Languages, and Programming
- Compact Distance Oracles with Large Sensitivity and Low Stretch with Davide Bilò, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck WADS 2023 - Algorithms and Data Structures Symposium
- Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances with Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck ICALP 2022 - International Colloquium on Automata, Languages, and Programming
- Pairwise Reachability Oracles and Preservers Under Failures with Diptarka Chakraborty, Kushagra Chatterjee ICALP 2022 - International Colloquium on Automata, Languages, and Programming
- Fixed-Parameter Sensitivity Oracles with Davide Bilò, Katrin Casel, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger ITCS 2022 - Innovations in Theoretical Computer Science Conference
- Budgeted Dominating Sets in Uncertain Graphs with Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan MFCS 2021 - Mathematical Foundations of Computer Science
- Extremal Distances in Directed graphs: Tight Spanners and Near-Optimal Approximation Algorithms with Omer Gold SODA 2020 - Symposium on Discrete Algorithms
- Minimum Neighboring Degree Realization in Graphs and Trees with Amotz Bar-Noy, Avi Cohen, David Peleg, Dror Rawitz ESA 2020 - European Symposium on Algorithms
- Graph Realizations: Maximum Degree in Vertex Neighbourhoods with Amotz Bar-Noy, David Peleg, Dror Rawitz SWAT 2020 - Scandinavian Symposium and Workshops on Algorithm Theory Discrete Mathematics 2023
- Distributed Graph Realizations with John Augustine, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav IPDPS 2020 – International Parallel and Distributed Processing Symposium IEEE Transactions on Parallel and Distributed Systems 2022
- New Fault Tolerant Subset Preservers with Greg Bodwin, Merav Parter, and Noa Shahar ICALP 2020 - International Colloquium on Automata, Languages, and Programming
- New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures with Diptarka Chakraborty ICALP 2020 - International Colloquium on Automata, Languages, and Programming ACM Transactions on Algorithms (TALG) 2025
- Efficiently Realizing Interval Sequences with Amotz Bar-Noy, David Peleg, Dror Rawitz ISAAC 2019 - International Symposium on Algorithms and Computation SIAM Journal on Discrete Mathematics (SIDMA) 2020
- Graph Realizations and Applications to Social Networks with Amotz Bar-Noy, David Peleg, Dror Rawitz WALCOM 2019 - Symposium on Theoretical Aspects of Computer Science
- Realizability of Graph Specifications: Characterizations and Algorithms with Amotz Bar-Noy, David Peleg, Dror Rawitz SIROCCO 2018 - International Colloquium on Structural Information and Communication Complexity
- Space Optimal Maintenance of Single Source Replacement Paths with Davide Bilo, Luciano Guala, Stefano Leucci, Merav Parter, Guido Proietti STACS 2018 - Symposium on Theoretical Aspects of Computer Science
- On single source fault tolerant approximate shortest path with Surender Baswana, Moazzam Hussain, Liam Roditty SODA 2018 - Symposium on Discrete Algorithms ACM Transactions on Algorithms (TALG) 2020
- An efficient strongly connected components algorithm in the fault tolerant model with Surender Baswana, Liam Roditty ICALP 2017 - International Colloquium on Automata, Languages, and Programming Algorithmica 2019
- Dynamic DFS tree in undirected graphs: breaking the O(m) barrier with Surender Baswana, Shreejit Ray Chaudhury, Shahbaz Khan SODA 2016 - Symposium on Discrete Algorithms SIAM Journal on Computing (SICOMP) 2019
- Fault tolerant subgraph for Single Source Reachability: Generic and optimal with Surender Baswana, Liam Roditty STOC 2016 - Symposium on the Theory of Computing SIAM Journal on Computing (SICOMP) 2018
- An Optimal Dual Fault Tolerant Reachability Oracle ICALP 2016 - International Colloquium on Automata, Languages, and Programming
- Fault Tolerant Reachability for Directed Graphs with Surender Baswana, Liam Roditty DISC 2015 - International Symposium on Distributed Computing
- On Dynamic DFS Tree in Directed Graphs with Surender Baswana MFCS 2015 - Mathematical Foundations of Computer Science
- Integer Domination of Cartesian Product Graphs with Susan Margulies, Illya V. Hicks Discrete Mathematics 2015
- A Note on Total and Paired Domination of Cartesian Product Graphs with Susan Margulies, Illya V. Hicks Electronic Journal of Combinatorics 2013
Contact Details
- Office
- Bharti 416
Department of Computer Science and Engineering
Indian Institute of Technology Delhi
Delhi 110016 - Phone
- +91-11-2654 8521 (8521 from within IITD)
- keerti [at] iitd [dot] ac [dot] in